{"id":"W4392452257","doi":"10.1007/978-3-031-55598-5_14","title":"On Approximate Colored Path Counting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Colored; Path (computing); Artificial intelligence; Algorithm; Computer network","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000992683,0.0005423723,0.0004342963,0.0008977355,0.0002270287,0.001877066,0.004178868,0.000196924,0.0000218959],"category_scores_gemma":[0.00004701139,0.0004657421,0.0001212705,0.0007434663,0.0003944591,0.000789707,0.002672391,0.0008150414,0.0003493916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002317076,"about_ca_system_score_gemma":0.0001854291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008311312,"about_ca_topic_score_gemma":0.00001167448,"domain_scores_codex":[0.9957677,0.00001392461,0.0004307315,0.00189369,0.001192063,0.0007018793],"domain_scores_gemma":[0.997803,0.0002900027,0.0001910943,0.001489201,0.0001050629,0.0001215923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003555479,0.00002643366,0.000003389749,0.00009849387,0.00001819114,0.0003629841,0.0002619192,0.005284186,0.00002010552,0.5013418,0.0004616337,0.4921173],"study_design_scores_gemma":[0.0001161286,0.0001202116,0.000005557834,0.0004533986,0.000007410151,0.00001388179,7.88758e-8,0.6162384,0.0001131061,0.3754665,0.007010527,0.0004548941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001303094,0.0002336966,0.964986,0.001015658,0.003385549,0.0003806765,0.00001449152,0.000382644,0.0295883],"genre_scores_gemma":[0.03660335,0.0001445702,0.9399024,0.008939238,0.001897981,0.00004796111,0.00007012738,0.0001716837,0.01222275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6109542,"threshold_uncertainty_score":0.9997794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01404454146261868,"score_gpt":0.2327552379191174,"score_spread":0.2187106964564987,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}