{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YR6XYIT75BBQUTW4GAPPOTNFP5","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":"05e557b9e46df2b388f2b8e54a959d724ffd6b6d659d52a6d26d7f2586f75a8c","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-06T15:31:43Z","title_canon_sha256":"5fe818d90faddaf63eb4d198726c24633d7229427c44738ff3dc319a7737dcb4"},"schema_version":"1.0","source":{"id":"1908.02213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02213","created_at":"2026-07-04T23:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02213v1","created_at":"2026-07-04T23:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02213","created_at":"2026-07-04T23:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"YR6XYIT75BBQ","created_at":"2026-07-04T23:51:52Z"},{"alias_kind":"pith_short_16","alias_value":"YR6XYIT75BBQUTW4","created_at":"2026-07-04T23:51:52Z"},{"alias_kind":"pith_short_8","alias_value":"YR6XYIT7","created_at":"2026-07-04T23:51:52Z"}],"graph_snapshots":[{"event_id":"sha256:1c5ba3e5888a83054109fd20fa105c3914780eef8fb1a6ae32cddd643353fbad","target":"graph","created_at":"2026-07-04T23:51:52Z","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/1908.02213/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope $X$ on $k$ vertices such that $A\\subseteq X \\subseteq B$. The polytope $A$ is given by a set of vertices and the polytope $B$ is given by the defining hyperplanes. We show a universality theorem for NPP. Given an instance $I$ of the NPP, we define the solutions set of $I$ as $$ V'(I) = \\{(x_1,\\ldots,x_k)\\in \\mathbb{R}^{k\\cdot n} : A\\subseteq \\text{conv}(x_1,\\","authors_text":"Andreas Holmsen, Michael G. Dobbins, Tillmann Miltzow","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-06T15:31:43Z","title":"A Universality Theorem for Nested Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02213","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:0ac65b36de0632553b618fb80e9bcecab36b8aeb708e67538a67406abefd7ce7","target":"record","created_at":"2026-07-04T23:51:52Z","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":"05e557b9e46df2b388f2b8e54a959d724ffd6b6d659d52a6d26d7f2586f75a8c","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-06T15:31:43Z","title_canon_sha256":"5fe818d90faddaf63eb4d198726c24633d7229427c44738ff3dc319a7737dcb4"},"schema_version":"1.0","source":{"id":"1908.02213","kind":"arxiv","version":1}},"canonical_sha256":"c47d7c227fe8430a4edc301ef74da57f567f35da81bf75d4f077d0f7590dd65b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c47d7c227fe8430a4edc301ef74da57f567f35da81bf75d4f077d0f7590dd65b","first_computed_at":"2026-07-04T23:51:52.140163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:52.140163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S+A3y8ZBhkI1RunuAk/dR8Ld9oYrHhtQrhgWrW1a20ux0vrADoGQjd31C5STYrJVxxpZ/72uWdUeC2NFFvKLCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:52.140556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ac65b36de0632553b618fb80e9bcecab36b8aeb708e67538a67406abefd7ce7","sha256:1c5ba3e5888a83054109fd20fa105c3914780eef8fb1a6ae32cddd643353fbad"],"state_sha256":"e4022ce23ff904f5cf3b7aa6dd084dcbbeaae07c955bcba445d9c882b8893ece"}