{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IQZP75AT5TT6BCVRPTZ57SKHGT","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":"92ac4e5289c962915d33d4ef65fd7e6501aeecacf449f401d1e6889374c0fd89","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-10-11T15:19:26Z","title_canon_sha256":"361dd4bf6e69a952626c8c9df432bfd376923a9ce208b94377f83e869281328a"},"schema_version":"1.0","source":{"id":"1910.05241","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.05241","created_at":"2026-07-05T00:27:33Z"},{"alias_kind":"arxiv_version","alias_value":"1910.05241v2","created_at":"2026-07-05T00:27:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05241","created_at":"2026-07-05T00:27:33Z"},{"alias_kind":"pith_short_12","alias_value":"IQZP75AT5TT6","created_at":"2026-07-05T00:27:33Z"},{"alias_kind":"pith_short_16","alias_value":"IQZP75AT5TT6BCVR","created_at":"2026-07-05T00:27:33Z"},{"alias_kind":"pith_short_8","alias_value":"IQZP75AT","created_at":"2026-07-05T00:27:33Z"}],"graph_snapshots":[{"event_id":"sha256:ceb70f9729ae1306ce22f630bad99556c0d1e466d9d044e4d16654ec5d38aeca","target":"graph","created_at":"2026-07-05T00:27:33Z","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/1910.05241/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested in polynomial time, and for every $f$-vector of $3$-polytopes, there exists an inscribable polytope with that $f$-vector. For higher-dimensional polytopes, much less is known. Of course, for any inscribable polytope, all of its lower-dimensional faces need to be inscribable, but this condition does not appear to be very strong.\n  We observe non-trivial new ","authors_text":"Carsten E. M. C. Lange, G\\\"unter M. Ziegler, Jean-Philippe Labb\\'e, Jonathan Spreer, Joseph Doolittle, Rainer Sinn","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-10-11T15:19:26Z","title":"Combinatorial Inscribability Obstructions for Higher-Dimensional Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05241","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:ec51b76e87b81aebf3fc77384bfe55a226edcbd7bc39e228c5aee873509cf67d","target":"record","created_at":"2026-07-05T00:27:33Z","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":"92ac4e5289c962915d33d4ef65fd7e6501aeecacf449f401d1e6889374c0fd89","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-10-11T15:19:26Z","title_canon_sha256":"361dd4bf6e69a952626c8c9df432bfd376923a9ce208b94377f83e869281328a"},"schema_version":"1.0","source":{"id":"1910.05241","kind":"arxiv","version":2}},"canonical_sha256":"4432fff413ece7e08ab17cf3dfc94734e26028e129d308c93b770a5d12261164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4432fff413ece7e08ab17cf3dfc94734e26028e129d308c93b770a5d12261164","first_computed_at":"2026-07-05T00:27:33.707946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:27:33.707946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0oxOp//o0Z/gdvcJe1YNUE6LA23HKcFsWQQY8qZHTdbPf0i9ilkd3cxqNqVP3Ru3QeS+nmx6Op9gRTMz5TBpCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:27:33.708433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.05241","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec51b76e87b81aebf3fc77384bfe55a226edcbd7bc39e228c5aee873509cf67d","sha256:ceb70f9729ae1306ce22f630bad99556c0d1e466d9d044e4d16654ec5d38aeca"],"state_sha256":"b56f26b78953375aa98ddeb115be43daa86066d8d1a866c3b59c1e61132362f3"}