{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3LWAPTEKJD4PFCBOA5VP4MMNTE","short_pith_number":"pith:3LWAPTEK","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"},"canonical_sha256":"daec07cc8a48f8f2882e076afe318d9920303fd47d3fa1b132684bb1e4b10ddf","source":{"kind":"arxiv","id":"1701.08334","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08334","created_at":"2026-05-18T00:50:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08334v2","created_at":"2026-05-18T00:50:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08334","created_at":"2026-05-18T00:50:28Z"},{"alias_kind":"pith_short_12","alias_value":"3LWAPTEKJD4P","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3LWAPTEKJD4PFCBO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3LWAPTEK","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3LWAPTEKJD4PFCBOA5VP4MMNTE","target":"record","payload":{"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"},"canonical_sha256":"daec07cc8a48f8f2882e076afe318d9920303fd47d3fa1b132684bb1e4b10ddf","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"},"source_kind":"arxiv","source_id":"1701.08334","source_version":2,"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-18T00:50:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYpP3+FuNsnGqOXzNSCiwH1au4aSDhkYaF9OdS64vWRZk1NdwdSGnMtILgZV8TF8TA/5sUv6eX0FPTGtZDXnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:04:05.622084Z"},"content_sha256":"3b952830807bd261a277a35a565a7a42636894175f80c24461fcffcd0585619b","schema_version":"1.0","event_id":"sha256:3b952830807bd261a277a35a565a7a42636894175f80c24461fcffcd0585619b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3LWAPTEKJD4PFCBOA5VP4MMNTE","target":"graph","payload":{"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"},"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-18T00:50:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZoEUXg6bGcBwHBltHvtSJY5j09DFZmKym9b5SXzk7mnMuE3R4hRHocrSfeOaZ3Ic8Dn2P0IjQyK9KlN63HQIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:04:05.622441Z"},"content_sha256":"2b8ef393f0a6292434cde6cd7c6b80e366b8aa7ccacc38734432755dde8e793d","schema_version":"1.0","event_id":"sha256:2b8ef393f0a6292434cde6cd7c6b80e366b8aa7ccacc38734432755dde8e793d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/bundle.json","state_url":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/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-07-07T03:04:05Z","links":{"resolver":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE","bundle":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/bundle.json","state":"https://pith.science/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LWAPTEKJD4PFCBOA5VP4MMNTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3LWAPTEKJD4PFCBOA5VP4MMNTE","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":"8c5a64e539cb586102fb537b6674060c298199e569477d7e259c92dbab79c61b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T23:53:36Z","title_canon_sha256":"ddfeb61d508c05c5965e996268855830bcfb0279125adc1c3ed06c68018092e2"},"schema_version":"1.0","source":{"id":"1701.08334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08334","created_at":"2026-05-18T00:50:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08334v2","created_at":"2026-05-18T00:50:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08334","created_at":"2026-05-18T00:50:28Z"},{"alias_kind":"pith_short_12","alias_value":"3LWAPTEKJD4P","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3LWAPTEKJD4PFCBO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3LWAPTEK","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:2b8ef393f0a6292434cde6cd7c6b80e366b8aa7ccacc38734432755dde8e793d","target":"graph","created_at":"2026-05-18T00:50:28Z","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":"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","authors_text":"Joseph Doolittle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T23:53:36Z","title":"Reconstructing Nearly Simple Polytopes from their Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08334","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:3b952830807bd261a277a35a565a7a42636894175f80c24461fcffcd0585619b","target":"record","created_at":"2026-05-18T00:50:28Z","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":"8c5a64e539cb586102fb537b6674060c298199e569477d7e259c92dbab79c61b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T23:53:36Z","title_canon_sha256":"ddfeb61d508c05c5965e996268855830bcfb0279125adc1c3ed06c68018092e2"},"schema_version":"1.0","source":{"id":"1701.08334","kind":"arxiv","version":2}},"canonical_sha256":"daec07cc8a48f8f2882e076afe318d9920303fd47d3fa1b132684bb1e4b10ddf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daec07cc8a48f8f2882e076afe318d9920303fd47d3fa1b132684bb1e4b10ddf","first_computed_at":"2026-05-18T00:50:28.666792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:28.666792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S9193ijEXReH1TmQMLH/vchBOUlHyoGRzgxg2bIwic/kO7D4+yf7+b4OKt/LDBaBHje2auLFs2kOqr74YvGvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:28.667479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b952830807bd261a277a35a565a7a42636894175f80c24461fcffcd0585619b","sha256:2b8ef393f0a6292434cde6cd7c6b80e366b8aa7ccacc38734432755dde8e793d"],"state_sha256":"113a0268be11c9a5396855c9d9a5692f0dcbc99e218590353296c77bcc209501"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKm3F0RdGCP3A0KgbKTcv5nPPPR8keoFtu32xotER3CiJAUv2KjnAnhKbF/y9ad1PC5avp68UrBJABPvWveACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:04:05.624237Z","bundle_sha256":"fa41f3021be80167657c15f3b3bfb36b870608aa9b54ea8fd1d2219cfb7c42bc"}}