{"id":"W2950188498","doi":"10.48550/arxiv.math/0112257","title":"The computational complexity of the local postage stamp problem","year":2001,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Combinatorics; Mathematics; Postage Stamps; Time complexity; Discrete mathematics; Turing; Computational complexity theory; Set (abstract data type); Computer science; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0006700077,0.0003299795,0.0003570848,0.00007200237,0.0007134706,0.0001952729,0.004163175,0.000165114,0.00002745741],"category_scores_gemma":[0.00004496371,0.0002110448,0.0003589701,0.0005163105,0.001505929,0.0001348486,0.004740994,0.00101491,0.0000299028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009073778,"about_ca_system_score_gemma":0.0003743969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003265899,"about_ca_topic_score_gemma":0.0001812009,"domain_scores_codex":[0.9972196,0.0003083361,0.0006189314,0.0006512658,0.0007609701,0.0004408628],"domain_scores_gemma":[0.9970101,0.0004090978,0.0004966333,0.001662818,0.0003291853,0.00009212559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004186535,0.0005745625,0.1318504,0.0002924798,0.0003699048,0.0000316039,0.00222917,0.06353109,0.00004535892,0.7572291,0.003770526,0.04003398],"study_design_scores_gemma":[0.000341703,0.00005941096,0.3099316,0.0001797232,0.00002111994,0.00002881777,0.00008769918,0.1411845,0.000175987,0.5403142,0.007263097,0.0004121305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2154796,0.000430411,0.7700565,0.008146463,0.001804326,0.0008787794,0.00009586624,0.0002067781,0.002901279],"genre_scores_gemma":[0.9762623,0.00004838781,0.02271928,0.0004362827,0.0001349045,0.00003185961,0.0000240193,0.00001840202,0.0003245831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7607827,"threshold_uncertainty_score":0.8606156,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07116568959009759,"score_gpt":0.2758229870363237,"score_spread":0.2046572974462261,"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."}}