{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PHBOITSXBF6FKBAWNDP443D5LJ","short_pith_number":"pith:PHBOITSX","schema_version":"1.0","canonical_sha256":"79c2e44e57097c55041668dfce6c7d5a68a23799beb6e323f4723b54c1bcf0eb","source":{"kind":"arxiv","id":"2411.19744","version":1},"attestation_state":"computed","paper":{"title":"Amplifying human performance in combinatorial competitive programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE","cs.PL"],"primary_cat":"cs.LG","authors_text":"Alexander Novikov, Alex Vitvitskyi, Borja Ibarz, Larisa Markeeva, Lars Buesing, Matej Balog, Petar Veli\\v{c}kovi\\'c","submitted_at":"2024-11-29T14:40:36Z","abstract_excerpt":"Recent years have seen a significant surge in complex AI systems for competitive programming, capable of performing at admirable levels against human competitors. While steady progress has been made, the highest percentiles still remain out of reach for these methods on standard competition platforms such as Codeforces. Here we instead focus on combinatorial competitive programming, where the target is to find as-good-as-possible solutions to otherwise computationally intractable problems, over specific given inputs. We hypothesise that this scenario offers a unique testbed for human-AI synerg"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.19744","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-29T14:40:36Z","cross_cats_sorted":["cs.AI","cs.NE","cs.PL"],"title_canon_sha256":"9b199b6ade9cfbb5e267fb16fd8b38a99fbc0a1d39ae8f8e162e416dc207e133","abstract_canon_sha256":"9ccdeeac3c2ff6697bed8f5f2abc2c9d9e04c366092fe44377f94ed63df506b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:07.638248Z","signature_b64":"mUmAuT47C38ccuWc8YXwIQImjJKqc4PnYlgf575pYanSJlXW+upmaisjPxx9H0QuRMCcoMtRmBtYW6QNriDIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79c2e44e57097c55041668dfce6c7d5a68a23799beb6e323f4723b54c1bcf0eb","last_reissued_at":"2026-07-05T09:42:07.637711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:07.637711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amplifying human performance in combinatorial competitive programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE","cs.PL"],"primary_cat":"cs.LG","authors_text":"Alexander Novikov, Alex Vitvitskyi, Borja Ibarz, Larisa Markeeva, Lars Buesing, Matej Balog, Petar Veli\\v{c}kovi\\'c","submitted_at":"2024-11-29T14:40:36Z","abstract_excerpt":"Recent years have seen a significant surge in complex AI systems for competitive programming, capable of performing at admirable levels against human competitors. While steady progress has been made, the highest percentiles still remain out of reach for these methods on standard competition platforms such as Codeforces. Here we instead focus on combinatorial competitive programming, where the target is to find as-good-as-possible solutions to otherwise computationally intractable problems, over specific given inputs. We hypothesise that this scenario offers a unique testbed for human-AI synerg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19744","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.19744/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.19744","created_at":"2026-07-05T09:42:07.637778+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.19744v1","created_at":"2026-07-05T09:42:07.637778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19744","created_at":"2026-07-05T09:42:07.637778+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHBOITSXBF6F","created_at":"2026-07-05T09:42:07.637778+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHBOITSXBF6FKBAW","created_at":"2026-07-05T09:42:07.637778+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHBOITSX","created_at":"2026-07-05T09:42:07.637778+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06786","citing_title":"From Agentic to Autogenic Network Management for AI-Native 6G and Beyond: A Standards Perspective","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2606.25870","citing_title":"Evolving Quantum Error-Correcting Encodings for Molecular Simulation","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2606.21891","citing_title":"Learning the ARTS of Search for Automated Discovery","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23417","citing_title":"An Open-Source Training Dataset for Foundation Models for Black-box Optimization","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ","json":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ.json","graph_json":"https://pith.science/api/pith-number/PHBOITSXBF6FKBAWNDP443D5LJ/graph.json","events_json":"https://pith.science/api/pith-number/PHBOITSXBF6FKBAWNDP443D5LJ/events.json","paper":"https://pith.science/paper/PHBOITSX"},"agent_actions":{"view_html":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ","download_json":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ.json","view_paper":"https://pith.science/paper/PHBOITSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.19744&json=true","fetch_graph":"https://pith.science/api/pith-number/PHBOITSXBF6FKBAWNDP443D5LJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PHBOITSXBF6FKBAWNDP443D5LJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ/action/storage_attestation","attest_author":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ/action/author_attestation","sign_citation":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ/action/citation_signature","submit_replication":"https://pith.science/pith/PHBOITSXBF6FKBAWNDP443D5LJ/action/replication_record"}},"created_at":"2026-07-05T09:42:07.637778+00:00","updated_at":"2026-07-05T09:42:07.637778+00:00"}