{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IQZP75AT5TT6BCVRPTZ57SKHGT","short_pith_number":"pith:IQZP75AT","schema_version":"1.0","canonical_sha256":"4432fff413ece7e08ab17cf3dfc94734e26028e129d308c93b770a5d12261164","source":{"kind":"arxiv","id":"1910.05241","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial Inscribability Obstructions for Higher-Dimensional Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Carsten E. M. C. Lange, G\\\"unter M. Ziegler, Jean-Philippe Labb\\'e, Jonathan Spreer, Joseph Doolittle, Rainer Sinn","submitted_at":"2019-10-11T15:19:26Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1910.05241","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2019-10-11T15:19:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"361dd4bf6e69a952626c8c9df432bfd376923a9ce208b94377f83e869281328a","abstract_canon_sha256":"92ac4e5289c962915d33d4ef65fd7e6501aeecacf449f401d1e6889374c0fd89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:33.708433Z","signature_b64":"0oxOp//o0Z/gdvcJe1YNUE6LA23HKcFsWQQY8qZHTdbPf0i9ilkd3cxqNqVP3Ru3QeS+nmx6Op9gRTMz5TBpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4432fff413ece7e08ab17cf3dfc94734e26028e129d308c93b770a5d12261164","last_reissued_at":"2026-07-05T00:27:33.707946Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:33.707946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Inscribability Obstructions for Higher-Dimensional Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Carsten E. M. C. Lange, G\\\"unter M. Ziegler, Jean-Philippe Labb\\'e, Jonathan Spreer, Joseph Doolittle, Rainer Sinn","submitted_at":"2019-10-11T15:19:26Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05241","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.05241/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1910.05241","created_at":"2026-07-05T00:27:33.708004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.05241v2","created_at":"2026-07-05T00:27:33.708004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05241","created_at":"2026-07-05T00:27:33.708004+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQZP75AT5TT6","created_at":"2026-07-05T00:27:33.708004+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQZP75AT5TT6BCVR","created_at":"2026-07-05T00:27:33.708004+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQZP75AT","created_at":"2026-07-05T00:27:33.708004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT","json":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT.json","graph_json":"https://pith.science/api/pith-number/IQZP75AT5TT6BCVRPTZ57SKHGT/graph.json","events_json":"https://pith.science/api/pith-number/IQZP75AT5TT6BCVRPTZ57SKHGT/events.json","paper":"https://pith.science/paper/IQZP75AT"},"agent_actions":{"view_html":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT","download_json":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT.json","view_paper":"https://pith.science/paper/IQZP75AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.05241&json=true","fetch_graph":"https://pith.science/api/pith-number/IQZP75AT5TT6BCVRPTZ57SKHGT/graph.json","fetch_events":"https://pith.science/api/pith-number/IQZP75AT5TT6BCVRPTZ57SKHGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT/action/storage_attestation","attest_author":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT/action/author_attestation","sign_citation":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT/action/citation_signature","submit_replication":"https://pith.science/pith/IQZP75AT5TT6BCVRPTZ57SKHGT/action/replication_record"}},"created_at":"2026-07-05T00:27:33.708004+00:00","updated_at":"2026-07-05T00:27:33.708004+00:00"}