{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DHJOXYMOF43NENJ5QWRJWOKQWV","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":"45e50e3f8a82cb8fbe2c1998ea40533ace442d9a8323baab6d0ac39cde08ea66","cross_cats_sorted":["math.MG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-05T08:52:14Z","title_canon_sha256":"c108879e35a9d902feb715714e4ca72b2d11b70f52336e8f05ac39e47f68d6d2"},"schema_version":"1.0","source":{"id":"1912.02439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.02439","created_at":"2026-07-05T03:40:26Z"},{"alias_kind":"arxiv_version","alias_value":"1912.02439v1","created_at":"2026-07-05T03:40:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.02439","created_at":"2026-07-05T03:40:26Z"},{"alias_kind":"pith_short_12","alias_value":"DHJOXYMOF43N","created_at":"2026-07-05T03:40:26Z"},{"alias_kind":"pith_short_16","alias_value":"DHJOXYMOF43NENJ5","created_at":"2026-07-05T03:40:26Z"},{"alias_kind":"pith_short_8","alias_value":"DHJOXYMO","created_at":"2026-07-05T03:40:26Z"}],"graph_snapshots":[{"event_id":"sha256:473499b3ca0c8806acc8cfd5b63115a22898b8698d2e502d6a35f74a291645a4","target":"graph","created_at":"2026-07-05T03:40:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.02439/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A class of counting problems ask for the number of regions of a central hyperplane arrangement. By duality, this is the same as counting the vertices of a zonotope. We give several efficient algorithms, based on a linear optimization oracle, that solve this and related enumeration problems. More precisely, our algorithms compute the vertices of a zonotope from the set of its generators and inversely, recover the generators of a zonotope from its vertices. A variation of the latter algorithm also allows to decide whether a polytope, given as its vertex set, is a zonotope and when it is not, to ","authors_text":"Antoine Deza, Lionel Pournin","cross_cats":["math.MG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-05T08:52:14Z","title":"A linear optimization oracle for zonotope computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.02439","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:ce34c02c592b88b95262b81c68940434ef7b9669cd232ef76002c50b3bef74eb","target":"record","created_at":"2026-07-05T03:40:26Z","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":"45e50e3f8a82cb8fbe2c1998ea40533ace442d9a8323baab6d0ac39cde08ea66","cross_cats_sorted":["math.MG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-05T08:52:14Z","title_canon_sha256":"c108879e35a9d902feb715714e4ca72b2d11b70f52336e8f05ac39e47f68d6d2"},"schema_version":"1.0","source":{"id":"1912.02439","kind":"arxiv","version":1}},"canonical_sha256":"19d2ebe18e2f36d2353d85a29b3950b554dade715e6120bbe9d98ff2ccd5f3fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19d2ebe18e2f36d2353d85a29b3950b554dade715e6120bbe9d98ff2ccd5f3fa","first_computed_at":"2026-07-05T03:40:26.258562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:40:26.258562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iu7bjf2D9+SqoEExv4c0zex22m1RNMfQgFifyD4pOMolY593+kE74YmuKjd1PAV2hYOGFV+XO9gorWtOaErxBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:40:26.258943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.02439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce34c02c592b88b95262b81c68940434ef7b9669cd232ef76002c50b3bef74eb","sha256:473499b3ca0c8806acc8cfd5b63115a22898b8698d2e502d6a35f74a291645a4"],"state_sha256":"1db069fb68022e919c566cb00bb0811cec1ebc72dd9dc71ff65caa91568eeb00"}