{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WMLARY2T5UF3OQJV5TLAZHH5R2","short_pith_number":"pith:WMLARY2T","schema_version":"1.0","canonical_sha256":"b31608e353ed0bb74135ecd60c9cfd8e996cfe15cce09c024a9de66d87b5289f","source":{"kind":"arxiv","id":"1802.09007","version":2},"attestation_state":"computed","paper":{"title":"Evaluating and Tuning n-fold Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.DS","authors_text":"Du\\v{s}an Knop, Kate\\v{r}ina Altmanov\\'a, Martin Kouteck\\'y","submitted_at":"2018-02-25T13:59:12Z","abstract_excerpt":"In recent years, algorithmic breakthroughs in stringology, computational social choice, scheduling, etc., were achieved by applying the theory of so-called $n$-fold integer programming. An $n$-fold integer program (IP) has a highly uniform block structured constraint matrix. Hemmecke, Onn, and Romanchuk [Math. Programming, 2013] showed an algorithm with runtime $a^{O(rst + r^2s)} n^3$, where $a$ is the largest coefficient, $r,s$, and $t$ are dimensions of blocks of the constraint matrix and $n$ is the total dimension of the IP; thus, an algorithm efficient if the blocks are of small size and w"},"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":"1802.09007","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-25T13:59:12Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"a385806a41a5651c930f59ec5c3ea45d96d2e82bcad8e13febfbdd4e7111823c","abstract_canon_sha256":"d3f22b311464abf75408ba6a68171f2c92f7625bd3f7d8b326bc82394be671c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:22.585819Z","signature_b64":"NVENYkWPgnjrjiv+d4sgpLP03kUjkG/fySw9u+kKpdRxD9q9582PDMV3RBpqPaYe1HsW6deZMuWUwY6JbagSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b31608e353ed0bb74135ecd60c9cfd8e996cfe15cce09c024a9de66d87b5289f","last_reissued_at":"2026-05-17T23:49:22.585376Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:22.585376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating and Tuning n-fold Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.DS","authors_text":"Du\\v{s}an Knop, Kate\\v{r}ina Altmanov\\'a, Martin Kouteck\\'y","submitted_at":"2018-02-25T13:59:12Z","abstract_excerpt":"In recent years, algorithmic breakthroughs in stringology, computational social choice, scheduling, etc., were achieved by applying the theory of so-called $n$-fold integer programming. An $n$-fold integer program (IP) has a highly uniform block structured constraint matrix. Hemmecke, Onn, and Romanchuk [Math. Programming, 2013] showed an algorithm with runtime $a^{O(rst + r^2s)} n^3$, where $a$ is the largest coefficient, $r,s$, and $t$ are dimensions of blocks of the constraint matrix and $n$ is the total dimension of the IP; thus, an algorithm efficient if the blocks are of small size and w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09007","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1802.09007","created_at":"2026-05-17T23:49:22.585439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09007v2","created_at":"2026-05-17T23:49:22.585439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09007","created_at":"2026-05-17T23:49:22.585439+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMLARY2T5UF3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMLARY2T5UF3OQJV","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMLARY2T","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2","json":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2.json","graph_json":"https://pith.science/api/pith-number/WMLARY2T5UF3OQJV5TLAZHH5R2/graph.json","events_json":"https://pith.science/api/pith-number/WMLARY2T5UF3OQJV5TLAZHH5R2/events.json","paper":"https://pith.science/paper/WMLARY2T"},"agent_actions":{"view_html":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2","download_json":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2.json","view_paper":"https://pith.science/paper/WMLARY2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09007&json=true","fetch_graph":"https://pith.science/api/pith-number/WMLARY2T5UF3OQJV5TLAZHH5R2/graph.json","fetch_events":"https://pith.science/api/pith-number/WMLARY2T5UF3OQJV5TLAZHH5R2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/action/storage_attestation","attest_author":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/action/author_attestation","sign_citation":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/action/citation_signature","submit_replication":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/action/replication_record"}},"created_at":"2026-05-17T23:49:22.585439+00:00","updated_at":"2026-05-17T23:49:22.585439+00:00"}