{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RJ5EL6MTEPTB5XU3TAAJQQA7CU","short_pith_number":"pith:RJ5EL6MT","canonical_record":{"source":{"id":"1704.00249","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:22:40Z","cross_cats_sorted":["cs.CC","cs.DM","cs.LO","math.LO"],"title_canon_sha256":"7455ea4da9257aaeed5c96548259c3b55927b1ed33ce3cf05543b849bd7bdb2e","abstract_canon_sha256":"d57ecdac85d403e0ce536b090499a9f3ae7ffac580a6c924b8e8a2e1ea7189b2"},"schema_version":"1.0"},"canonical_sha256":"8a7a45f99323e61ede9b980098401f1510c6e1610297e70d86155e6623011d5f","source":{"kind":"arxiv","id":"1704.00249","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00249","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00249v3","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00249","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"RJ5EL6MTEPTB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJ5EL6MTEPTB5XU3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJ5EL6MT","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RJ5EL6MTEPTB5XU3TAAJQQA7CU","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00249","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:22:40Z","cross_cats_sorted":["cs.CC","cs.DM","cs.LO","math.LO"],"title_canon_sha256":"7455ea4da9257aaeed5c96548259c3b55927b1ed33ce3cf05543b849bd7bdb2e","abstract_canon_sha256":"d57ecdac85d403e0ce536b090499a9f3ae7ffac580a6c924b8e8a2e1ea7189b2"},"schema_version":"1.0"},"canonical_sha256":"8a7a45f99323e61ede9b980098401f1510c6e1610297e70d86155e6623011d5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:21.861296Z","signature_b64":"BZNUc5me3rX7UCI23oskkUsGiUwrdXar3xOiN3kaGXdDFTJT7EZpoXiKm+/anDP/eanr1e0RxZbApYveKBkwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a7a45f99323e61ede9b980098401f1510c6e1610297e70d86155e6623011d5f","last_reissued_at":"2026-05-18T00:45:21.860564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:21.860564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00249","source_version":3,"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-18T00:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UaaH9oqachdNHLYvs6eIdRFrcMtLSkZC6HFhMplw24/3FxylqlzpgtQ5APmtjQIQewM/qkrmDLiMTKNNJjBbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:04:56.418250Z"},"content_sha256":"0358e40ffbfaa896201d1e4e6a1b826a59dcfa6c287e2fb3280728d8d2f04aae","schema_version":"1.0","event_id":"sha256:0358e40ffbfaa896201d1e4e6a1b826a59dcfa6c287e2fb3280728d8d2f04aae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RJ5EL6MTEPTB5XU3TAAJQQA7CU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of short Presburger arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.LO","math.LO"],"primary_cat":"math.CO","authors_text":"Danny Nguyen, Igor Pak","submitted_at":"2017-04-02T03:22:40Z","abstract_excerpt":"We study complexity of short sentences in Presburger arithmetic (Short-PA). Here by \"short\" we mean sentences with a bounded number of variables, quantifiers, inequalities and Boolean operations; the input consists only of the integers involved in the inequalities. We prove that assuming Kannan's partition can be found in polynomial time, the satisfiability of Short-PA sentences can be decided in polynomial time. Furthermore, under the same assumption, we show that the numbers of satisfying assignments of short Presburger sentences can also be computed in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00249","kind":"arxiv","version":3},"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-18T00:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxF0c0Kb3xbRSbKJ0n7rlsf5u8QtjTVOs9qPIttpKzFXxCE9gj8TQlOi/p8Oy0Y2xknR6k8Jlp1Ejva4UmJyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:04:56.418614Z"},"content_sha256":"e9d529566af3753244660709fc7a17e53d3064ef6b41bbae50517ed60a087931","schema_version":"1.0","event_id":"sha256:e9d529566af3753244660709fc7a17e53d3064ef6b41bbae50517ed60a087931"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJ5EL6MTEPTB5XU3TAAJQQA7CU/bundle.json","state_url":"https://pith.science/pith/RJ5EL6MTEPTB5XU3TAAJQQA7CU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJ5EL6MTEPTB5XU3TAAJQQA7CU/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-31T01:04:56Z","links":{"resolver":"https://pith.science/pith/RJ5EL6MTEPTB5XU3TAAJQQA7CU","bundle":"https://pith.science/pith/RJ5EL6MTEPTB5XU3TAAJQQA7CU/bundle.json","state":"https://pith.science/pith/RJ5EL6MTEPTB5XU3TAAJQQA7CU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJ5EL6MTEPTB5XU3TAAJQQA7CU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RJ5EL6MTEPTB5XU3TAAJQQA7CU","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":"d57ecdac85d403e0ce536b090499a9f3ae7ffac580a6c924b8e8a2e1ea7189b2","cross_cats_sorted":["cs.CC","cs.DM","cs.LO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:22:40Z","title_canon_sha256":"7455ea4da9257aaeed5c96548259c3b55927b1ed33ce3cf05543b849bd7bdb2e"},"schema_version":"1.0","source":{"id":"1704.00249","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00249","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00249v3","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00249","created_at":"2026-05-18T00:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"RJ5EL6MTEPTB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJ5EL6MTEPTB5XU3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJ5EL6MT","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:e9d529566af3753244660709fc7a17e53d3064ef6b41bbae50517ed60a087931","target":"graph","created_at":"2026-05-18T00:45:21Z","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":"We study complexity of short sentences in Presburger arithmetic (Short-PA). Here by \"short\" we mean sentences with a bounded number of variables, quantifiers, inequalities and Boolean operations; the input consists only of the integers involved in the inequalities. We prove that assuming Kannan's partition can be found in polynomial time, the satisfiability of Short-PA sentences can be decided in polynomial time. Furthermore, under the same assumption, we show that the numbers of satisfying assignments of short Presburger sentences can also be computed in polynomial time.","authors_text":"Danny Nguyen, Igor Pak","cross_cats":["cs.CC","cs.DM","cs.LO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:22:40Z","title":"Complexity of short Presburger arithmetic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00249","kind":"arxiv","version":3},"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:0358e40ffbfaa896201d1e4e6a1b826a59dcfa6c287e2fb3280728d8d2f04aae","target":"record","created_at":"2026-05-18T00:45:21Z","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":"d57ecdac85d403e0ce536b090499a9f3ae7ffac580a6c924b8e8a2e1ea7189b2","cross_cats_sorted":["cs.CC","cs.DM","cs.LO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T03:22:40Z","title_canon_sha256":"7455ea4da9257aaeed5c96548259c3b55927b1ed33ce3cf05543b849bd7bdb2e"},"schema_version":"1.0","source":{"id":"1704.00249","kind":"arxiv","version":3}},"canonical_sha256":"8a7a45f99323e61ede9b980098401f1510c6e1610297e70d86155e6623011d5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a7a45f99323e61ede9b980098401f1510c6e1610297e70d86155e6623011d5f","first_computed_at":"2026-05-18T00:45:21.860564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:21.860564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BZNUc5me3rX7UCI23oskkUsGiUwrdXar3xOiN3kaGXdDFTJT7EZpoXiKm+/anDP/eanr1e0RxZbApYveKBkwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:21.861296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00249","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0358e40ffbfaa896201d1e4e6a1b826a59dcfa6c287e2fb3280728d8d2f04aae","sha256:e9d529566af3753244660709fc7a17e53d3064ef6b41bbae50517ed60a087931"],"state_sha256":"8fe5f5a3f8eba2352f7b9b979cf2d7da90f59bbd1fdc6f58d228550b5ac03efa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"af8V823fy9oyO7XmoD12Ua+hLX1Cq52VP1+S64hndbGzfwKWbR29pZYHsZBkTW/XwghzUz0mOxgCaeezls8NDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:04:56.420632Z","bundle_sha256":"aadd2634c76a8f6ac644515d4843ea11aee19e2744e902a6442b0c4e86b31fcf"}}