{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4KU3LCBW3C2Q46JVWXOLXTQ5FP","short_pith_number":"pith:4KU3LCBW","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"},"canonical_sha256":"e2a9b58836d8b50e7935b5dcbbce1d2bec5642235de2a3d07498969c0a07712e","source":{"kind":"arxiv","id":"1704.00854","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00854","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00854v3","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00854","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"4KU3LCBW3C2Q","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4KU3LCBW3C2Q46JV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4KU3LCBW","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4KU3LCBW3C2Q46JVWXOLXTQ5FP","target":"record","payload":{"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"},"canonical_sha256":"e2a9b58836d8b50e7935b5dcbbce1d2bec5642235de2a3d07498969c0a07712e","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"},"source_kind":"arxiv","source_id":"1704.00854","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ul2RGF9u2O1IAx0X8I4p9Jna37XxzVE7g7dc4bpDJkMpVbuKzPxv8I8SoFbYrqTS06OMhgkE5fQhBCrF1phoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:50:47.974885Z"},"content_sha256":"248ee6840b125774c08d413684a19d9567d094f08485bed000095ea36417688f","schema_version":"1.0","event_id":"sha256:248ee6840b125774c08d413684a19d9567d094f08485bed000095ea36417688f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4KU3LCBW3C2Q46JVWXOLXTQ5FP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRB17r03fgvMfzmz8ac+beSeTyZSpAx4mBT3CTDr+ZW45A10E2X53mi+PNBeBn8WI6X0u6cOgkfMfBhXYm9IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:50:47.975239Z"},"content_sha256":"0f1806505570376eec00e5b2c90492f095724d9b810c5d8e08913562411bd1da","schema_version":"1.0","event_id":"sha256:0f1806505570376eec00e5b2c90492f095724d9b810c5d8e08913562411bd1da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/bundle.json","state_url":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T00:50:47Z","links":{"resolver":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP","bundle":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/bundle.json","state":"https://pith.science/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KU3LCBW3C2Q46JVWXOLXTQ5FP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4KU3LCBW3C2Q46JVWXOLXTQ5FP","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":"940d62747850ce1a9332ab870fb4cf0bf59c9e65ee598986d27d95ffbf6f5efe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-04T02:34:00Z","title_canon_sha256":"8a06f920c9a33922103719b3e73ea273a8fbac628915edda0ac95d97b87fbfd6"},"schema_version":"1.0","source":{"id":"1704.00854","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00854","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00854v3","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00854","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"4KU3LCBW3C2Q","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4KU3LCBW3C2Q46JV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4KU3LCBW","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:0f1806505570376eec00e5b2c90492f095724d9b810c5d8e08913562411bd1da","target":"graph","created_at":"2026-05-17T23:59:53Z","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"},"paper":{"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","authors_text":"David Yost, Guillermo Pineda-Villavicencio, Julien Ugon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-04T02:34:00Z","title":"Polytopes close to being simple"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00854","kind":"arxiv","version":3},"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:248ee6840b125774c08d413684a19d9567d094f08485bed000095ea36417688f","target":"record","created_at":"2026-05-17T23:59:53Z","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":"940d62747850ce1a9332ab870fb4cf0bf59c9e65ee598986d27d95ffbf6f5efe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-04T02:34:00Z","title_canon_sha256":"8a06f920c9a33922103719b3e73ea273a8fbac628915edda0ac95d97b87fbfd6"},"schema_version":"1.0","source":{"id":"1704.00854","kind":"arxiv","version":3}},"canonical_sha256":"e2a9b58836d8b50e7935b5dcbbce1d2bec5642235de2a3d07498969c0a07712e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2a9b58836d8b50e7935b5dcbbce1d2bec5642235de2a3d07498969c0a07712e","first_computed_at":"2026-05-17T23:59:53.879108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:53.879108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hGc+vOGnKktNYEu+1Fc6ZNCTepeAcYYx5PtiywzFrK8x52LicfiSPFdpPYdn5aa/2pERgRTpGmRLxNCR+JviBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:53.879598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00854","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:248ee6840b125774c08d413684a19d9567d094f08485bed000095ea36417688f","sha256:0f1806505570376eec00e5b2c90492f095724d9b810c5d8e08913562411bd1da"],"state_sha256":"ec53d6d6e5a7582c60b27e6c3f9d8aac4803b68af1d1a54a3a0bcf8484d8ee0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTvB9akUCOxnfN6I6TbtBT8siCzV/09uydXATBaUyMiW0bnWJksL8eDY5dkF40+H0dVIsx8/Tlk8jlISq0stCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T00:50:47.977615Z","bundle_sha256":"33450d7063748eebd53f025c6e6307dc341f7c643100f3e7a982e177e0fda22c"}}