{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BZ4UY3JJ225MQLFRVAOB3XPVR3","short_pith_number":"pith:BZ4UY3JJ","canonical_record":{"source":{"id":"1207.0979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-04T13:34:33Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"c514cfd66fc17d9c9062d9446a51d9f98aef6de5a2019207d4924e0aefa1b876","abstract_canon_sha256":"aac371014ebe60aa7a9a32dba255efc914394b6968be875723611efa8be3a19c"},"schema_version":"1.0"},"canonical_sha256":"0e794c6d29d6bac82cb1a81c1dddf58ed5e9a40ab9cac54a17d99eb412ff3afc","source":{"kind":"arxiv","id":"1207.0979","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0979","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0979v1","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0979","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"pith_short_12","alias_value":"BZ4UY3JJ225M","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BZ4UY3JJ225MQLFR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BZ4UY3JJ","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BZ4UY3JJ225MQLFRVAOB3XPVR3","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-04T13:34:33Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"c514cfd66fc17d9c9062d9446a51d9f98aef6de5a2019207d4924e0aefa1b876","abstract_canon_sha256":"aac371014ebe60aa7a9a32dba255efc914394b6968be875723611efa8be3a19c"},"schema_version":"1.0"},"canonical_sha256":"0e794c6d29d6bac82cb1a81c1dddf58ed5e9a40ab9cac54a17d99eb412ff3afc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:47.813731Z","signature_b64":"+KTee240lu1Ib8ne5ETrV/A06e3kBpQU4qvtBCysP5HpbbaDje28gIzi07hP0KbRDkgusvYWPwKPs8aShJadAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e794c6d29d6bac82cb1a81c1dddf58ed5e9a40ab9cac54a17d99eb412ff3afc","last_reissued_at":"2026-05-18T03:51:47.813211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:47.813211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0979","source_version":1,"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-18T03:51:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xl8c8Up6gFJwpc0u3S5XYTkXjq41bk/9G2mYpM/hk7+wevSR9bt1Y0un7qMs5gAsMQJS+01YVYxDdTU2ehLNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:39:21.795292Z"},"content_sha256":"8280ca53deb28767f0e5ac5df5f76edf9c97092b4322892c62109d624a9fe46f","schema_version":"1.0","event_id":"sha256:8280ca53deb28767f0e5ac5df5f76edf9c97092b4322892c62109d624a9fe46f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BZ4UY3JJ225MQLFRVAOB3XPVR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing the number of lattice points in a translated polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CC","authors_text":"Friedrich Eisenbrand, Nicolai H\\\"ahnle","submitted_at":"2012-07-04T13:34:33Z","abstract_excerpt":"The parametric lattice-point counting problem is as follows: Given an integer matrix $A \\in Z^{m \\times n}$, compute an explicit formula parameterized by $b \\in R^m$ that determines the number of integer points in the polyhedron $\\{x \\in R^n : Ax \\leq b\\}$. In the last decade, this counting problem has received considerable attention in the literature. Several variants of Barvinok's algorithm have been shown to solve this problem in polynomial time if the number $n$ of columns of $A$ is fixed.\n  Central to our investigation is the following question: Can one also efficiently determine a parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0979","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":""},"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-18T03:51:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7amNuyZMnvt3n3pytBLlI8WG/ikZX/ZcjFNq/p81Ykbbjk6pxyiu2bz5uGWTp+y7VkU0ggHdUouaQgUBUTArBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:39:21.795715Z"},"content_sha256":"c6ff480533c21338b026d6da77b61804696c30fd2360567e8e958c871113f6c8","schema_version":"1.0","event_id":"sha256:c6ff480533c21338b026d6da77b61804696c30fd2360567e8e958c871113f6c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZ4UY3JJ225MQLFRVAOB3XPVR3/bundle.json","state_url":"https://pith.science/pith/BZ4UY3JJ225MQLFRVAOB3XPVR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZ4UY3JJ225MQLFRVAOB3XPVR3/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-30T02:39:21Z","links":{"resolver":"https://pith.science/pith/BZ4UY3JJ225MQLFRVAOB3XPVR3","bundle":"https://pith.science/pith/BZ4UY3JJ225MQLFRVAOB3XPVR3/bundle.json","state":"https://pith.science/pith/BZ4UY3JJ225MQLFRVAOB3XPVR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZ4UY3JJ225MQLFRVAOB3XPVR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BZ4UY3JJ225MQLFRVAOB3XPVR3","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":"aac371014ebe60aa7a9a32dba255efc914394b6968be875723611efa8be3a19c","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-04T13:34:33Z","title_canon_sha256":"c514cfd66fc17d9c9062d9446a51d9f98aef6de5a2019207d4924e0aefa1b876"},"schema_version":"1.0","source":{"id":"1207.0979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0979","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0979v1","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0979","created_at":"2026-05-18T03:51:47Z"},{"alias_kind":"pith_short_12","alias_value":"BZ4UY3JJ225M","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BZ4UY3JJ225MQLFR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BZ4UY3JJ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:c6ff480533c21338b026d6da77b61804696c30fd2360567e8e958c871113f6c8","target":"graph","created_at":"2026-05-18T03:51:47Z","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":"The parametric lattice-point counting problem is as follows: Given an integer matrix $A \\in Z^{m \\times n}$, compute an explicit formula parameterized by $b \\in R^m$ that determines the number of integer points in the polyhedron $\\{x \\in R^n : Ax \\leq b\\}$. In the last decade, this counting problem has received considerable attention in the literature. Several variants of Barvinok's algorithm have been shown to solve this problem in polynomial time if the number $n$ of columns of $A$ is fixed.\n  Central to our investigation is the following question: Can one also efficiently determine a parame","authors_text":"Friedrich Eisenbrand, Nicolai H\\\"ahnle","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-04T13:34:33Z","title":"Minimizing the number of lattice points in a translated polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0979","kind":"arxiv","version":1},"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:8280ca53deb28767f0e5ac5df5f76edf9c97092b4322892c62109d624a9fe46f","target":"record","created_at":"2026-05-18T03:51:47Z","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":"aac371014ebe60aa7a9a32dba255efc914394b6968be875723611efa8be3a19c","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-04T13:34:33Z","title_canon_sha256":"c514cfd66fc17d9c9062d9446a51d9f98aef6de5a2019207d4924e0aefa1b876"},"schema_version":"1.0","source":{"id":"1207.0979","kind":"arxiv","version":1}},"canonical_sha256":"0e794c6d29d6bac82cb1a81c1dddf58ed5e9a40ab9cac54a17d99eb412ff3afc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e794c6d29d6bac82cb1a81c1dddf58ed5e9a40ab9cac54a17d99eb412ff3afc","first_computed_at":"2026-05-18T03:51:47.813211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:47.813211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+KTee240lu1Ib8ne5ETrV/A06e3kBpQU4qvtBCysP5HpbbaDje28gIzi07hP0KbRDkgusvYWPwKPs8aShJadAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:47.813731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8280ca53deb28767f0e5ac5df5f76edf9c97092b4322892c62109d624a9fe46f","sha256:c6ff480533c21338b026d6da77b61804696c30fd2360567e8e958c871113f6c8"],"state_sha256":"a54e4c56ff65b71ccf4a584ad9bdfeac6963512e678332df348e9965077f77a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+sux3AHFE+WLA3V5ZyjSsOtk/gFyS0/3tBpq1bvl5zI1d8VKXdinJBcVoCTuQGjGwHciv14uW7Vf7HZU0E1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:39:21.798498Z","bundle_sha256":"c3609e6d71943f2403438a1d5d1597c25df64215f960c6af969f9ac79aa95bd9"}}