{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WMLARY2T5UF3OQJV5TLAZHH5R2","short_pith_number":"pith:WMLARY2T","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"},"canonical_sha256":"b31608e353ed0bb74135ecd60c9cfd8e996cfe15cce09c024a9de66d87b5289f","source":{"kind":"arxiv","id":"1802.09007","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09007","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09007v2","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09007","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"WMLARY2T5UF3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WMLARY2T5UF3OQJV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WMLARY2T","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WMLARY2T5UF3OQJV5TLAZHH5R2","target":"record","payload":{"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"},"canonical_sha256":"b31608e353ed0bb74135ecd60c9cfd8e996cfe15cce09c024a9de66d87b5289f","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"},"source_kind":"arxiv","source_id":"1802.09007","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VFehtaBYd7wq818+eSthoOmhsTPS8Gk6enpRTQiKqxKsb4j16KltxWAbbl2YmMB2ZfumRGGwHOhjN35prvHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:46:58.139335Z"},"content_sha256":"be14a49125c9e76f0deae6639a7fd2956b49d647b2dc830fe4028adb21fb0196","schema_version":"1.0","event_id":"sha256:be14a49125c9e76f0deae6639a7fd2956b49d647b2dc830fe4028adb21fb0196"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WMLARY2T5UF3OQJV5TLAZHH5R2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MY0yHeh74WupcEOMiTYEg9cmsCdHhsoT7M2olr9E8GCVpI3sbNwW2CY+JRmnO1GPOOGzDZYa3QV4VkzGpTdYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:46:58.139732Z"},"content_sha256":"75d069626bc5042f29b1db700928d9814bba452201d342e646be0ec97a3805bd","schema_version":"1.0","event_id":"sha256:75d069626bc5042f29b1db700928d9814bba452201d342e646be0ec97a3805bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/bundle.json","state_url":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T17:46:58Z","links":{"resolver":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2","bundle":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/bundle.json","state":"https://pith.science/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMLARY2T5UF3OQJV5TLAZHH5R2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WMLARY2T5UF3OQJV5TLAZHH5R2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d3f22b311464abf75408ba6a68171f2c92f7625bd3f7d8b326bc82394be671c9","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-25T13:59:12Z","title_canon_sha256":"a385806a41a5651c930f59ec5c3ea45d96d2e82bcad8e13febfbdd4e7111823c"},"schema_version":"1.0","source":{"id":"1802.09007","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09007","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09007v2","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09007","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"WMLARY2T5UF3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WMLARY2T5UF3OQJV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WMLARY2T","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:75d069626bc5042f29b1db700928d9814bba452201d342e646be0ec97a3805bd","target":"graph","created_at":"2026-05-17T23:49:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Du\\v{s}an Knop, Kate\\v{r}ina Altmanov\\'a, Martin Kouteck\\'y","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-25T13:59:12Z","title":"Evaluating and Tuning n-fold Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09007","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:be14a49125c9e76f0deae6639a7fd2956b49d647b2dc830fe4028adb21fb0196","target":"record","created_at":"2026-05-17T23:49:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d3f22b311464abf75408ba6a68171f2c92f7625bd3f7d8b326bc82394be671c9","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-25T13:59:12Z","title_canon_sha256":"a385806a41a5651c930f59ec5c3ea45d96d2e82bcad8e13febfbdd4e7111823c"},"schema_version":"1.0","source":{"id":"1802.09007","kind":"arxiv","version":2}},"canonical_sha256":"b31608e353ed0bb74135ecd60c9cfd8e996cfe15cce09c024a9de66d87b5289f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b31608e353ed0bb74135ecd60c9cfd8e996cfe15cce09c024a9de66d87b5289f","first_computed_at":"2026-05-17T23:49:22.585376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:22.585376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NVENYkWPgnjrjiv+d4sgpLP03kUjkG/fySw9u+kKpdRxD9q9582PDMV3RBpqPaYe1HsW6deZMuWUwY6JbagSBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:22.585819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09007","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be14a49125c9e76f0deae6639a7fd2956b49d647b2dc830fe4028adb21fb0196","sha256:75d069626bc5042f29b1db700928d9814bba452201d342e646be0ec97a3805bd"],"state_sha256":"8ac614b9b607a87c781fd8d1b6c29cad1c117280b993b07ce8c5de02eec1a832"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KI+qt8VBvlfxLLZzfQhctWIkYZ6EbK2bTlSVz9SBTldC2Mc2CB51TJb6+dCcy3GQHoDC2tcokjOoLx8hh3G5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:46:58.142270Z","bundle_sha256":"3ceaef102ec09dbbeb94cc5f5bb33a1bbca3133ccd5dddae99c62409eeb29754"}}