{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4KU3LCBW3C2Q46JVWXOLXTQ5FP","short_pith_number":"pith:4KU3LCBW","schema_version":"1.0","canonical_sha256":"e2a9b58836d8b50e7935b5dcbbce1d2bec5642235de2a3d07498969c0a07712e","source":{"kind":"arxiv","id":"1704.00854","version":3},"attestation_state":"computed","paper":{"title":"Polytopes close to being simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Yost, Guillermo Pineda-Villavicencio, Julien Ugon","submitted_at":"2017-04-04T02:34:00Z","abstract_excerpt":"It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2 and $d-2$, showing that certain polytopes with more than two nonsimple vertices are reconstructible from their graphs. In particular, we prove that reconstructibility from graphs also holds for $d$-polytopes with $d+k$ vertices and at most $d-k+3$ nonsimple vertices, provided $k\\ge 5$. For $k\\le4$, the same conclusion holds under a slightly stronger assumptio"},"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":"1704.00854","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-04T02:34:00Z","cross_cats_sorted":[],"title_canon_sha256":"8a06f920c9a33922103719b3e73ea273a8fbac628915edda0ac95d97b87fbfd6","abstract_canon_sha256":"940d62747850ce1a9332ab870fb4cf0bf59c9e65ee598986d27d95ffbf6f5efe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:53.879598Z","signature_b64":"hGc+vOGnKktNYEu+1Fc6ZNCTepeAcYYx5PtiywzFrK8x52LicfiSPFdpPYdn5aa/2pERgRTpGmRLxNCR+JviBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a9b58836d8b50e7935b5dcbbce1d2bec5642235de2a3d07498969c0a07712e","last_reissued_at":"2026-05-17T23:59:53.879108Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:53.879108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polytopes close to being simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Yost, Guillermo Pineda-Villavicencio, Julien Ugon","submitted_at":"2017-04-04T02:34:00Z","abstract_excerpt":"It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2 and $d-2$, showing that certain polytopes with more than two nonsimple vertices are reconstructible from their graphs. In particular, we prove that reconstructibility from graphs also holds for $d$-polytopes with $d+k$ vertices and at most $d-k+3$ nonsimple vertices, provided $k\\ge 5$. For $k\\le4$, the same conclusion holds under a slightly stronger assumptio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00854","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.00854","created_at":"2026-05-17T23:59:53.879177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00854v3","created_at":"2026-05-17T23:59:53.879177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00854","created_at":"2026-05-17T23:59:53.879177+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KU3LCBW3C2Q","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KU3LCBW3C2Q46JV","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KU3LCBW","created_at":"2026-05-18T12:31:00.734936+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/4KU3LCBW3C2Q46JVWXOLXTQ5FP","json":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP.json","graph_json":"https://pith.science/api/pith-number/4KU3LCBW3C2Q46JVWXOLXTQ5FP/graph.json","events_json":"https://pith.science/api/pith-number/4KU3LCBW3C2Q46JVWXOLXTQ5FP/events.json","paper":"https://pith.science/paper/4KU3LCBW"},"agent_actions":{"view_html":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP","download_json":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP.json","view_paper":"https://pith.science/paper/4KU3LCBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00854&json=true","fetch_graph":"https://pith.science/api/pith-number/4KU3LCBW3C2Q46JVWXOLXTQ5FP/graph.json","fetch_events":"https://pith.science/api/pith-number/4KU3LCBW3C2Q46JVWXOLXTQ5FP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/action/storage_attestation","attest_author":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/action/author_attestation","sign_citation":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/action/citation_signature","submit_replication":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/action/replication_record"}},"created_at":"2026-05-17T23:59:53.879177+00:00","updated_at":"2026-05-17T23:59:53.879177+00:00"}