{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3LWAPTEKJD4PFCBOA5VP4MMNTE","short_pith_number":"pith:3LWAPTEK","schema_version":"1.0","canonical_sha256":"daec07cc8a48f8f2882e076afe318d9920303fd47d3fa1b132684bb1e4b10ddf","source":{"kind":"arxiv","id":"1701.08334","version":2},"attestation_state":"computed","paper":{"title":"Reconstructing Nearly Simple Polytopes from their Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joseph Doolittle","submitted_at":"2017-01-28T23:53:36Z","abstract_excerpt":"We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a notion of $h$-nearly simple and prove that 1-nearly simple and 2-nearly simple polytopes are reconstructible from their graphs. We also give an example of a 3-nearly simple polytope which is not reconstructible from its graph. Furthermore, we give a partial list of polytopes which are reconstructible from their graphs in an entire"},"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":"1701.08334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T23:53:36Z","cross_cats_sorted":[],"title_canon_sha256":"ddfeb61d508c05c5965e996268855830bcfb0279125adc1c3ed06c68018092e2","abstract_canon_sha256":"8c5a64e539cb586102fb537b6674060c298199e569477d7e259c92dbab79c61b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:28.667479Z","signature_b64":"S9193ijEXReH1TmQMLH/vchBOUlHyoGRzgxg2bIwic/kO7D4+yf7+b4OKt/LDBaBHje2auLFs2kOqr74YvGvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daec07cc8a48f8f2882e076afe318d9920303fd47d3fa1b132684bb1e4b10ddf","last_reissued_at":"2026-05-18T00:50:28.666792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:28.666792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstructing Nearly Simple Polytopes from their Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joseph Doolittle","submitted_at":"2017-01-28T23:53:36Z","abstract_excerpt":"We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a notion of $h$-nearly simple and prove that 1-nearly simple and 2-nearly simple polytopes are reconstructible from their graphs. We also give an example of a 3-nearly simple polytope which is not reconstructible from its graph. Furthermore, we give a partial list of polytopes which are reconstructible from their graphs in an entire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08334","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":""},"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":"1701.08334","created_at":"2026-05-18T00:50:28.666906+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08334v2","created_at":"2026-05-18T00:50:28.666906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08334","created_at":"2026-05-18T00:50:28.666906+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LWAPTEKJD4P","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LWAPTEKJD4PFCBO","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LWAPTEK","created_at":"2026-05-18T12:30:58.224056+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/3LWAPTEKJD4PFCBOA5VP4MMNTE","json":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE.json","graph_json":"https://pith.science/api/pith-number/3LWAPTEKJD4PFCBOA5VP4MMNTE/graph.json","events_json":"https://pith.science/api/pith-number/3LWAPTEKJD4PFCBOA5VP4MMNTE/events.json","paper":"https://pith.science/paper/3LWAPTEK"},"agent_actions":{"view_html":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE","download_json":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE.json","view_paper":"https://pith.science/paper/3LWAPTEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08334&json=true","fetch_graph":"https://pith.science/api/pith-number/3LWAPTEKJD4PFCBOA5VP4MMNTE/graph.json","fetch_events":"https://pith.science/api/pith-number/3LWAPTEKJD4PFCBOA5VP4MMNTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/action/storage_attestation","attest_author":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/action/author_attestation","sign_citation":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/action/citation_signature","submit_replication":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/action/replication_record"}},"created_at":"2026-05-18T00:50:28.666906+00:00","updated_at":"2026-05-18T00:50:28.666906+00:00"}