{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TQCI4HYAWCWLDU3FU5ZE6NF7GA","short_pith_number":"pith:TQCI4HYA","canonical_record":{"source":{"id":"1202.4045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-18T01:09:23Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8e6ce324386c2e710568785893bb0ef52849429ca13877b0b41c5e6266e4ae06","abstract_canon_sha256":"3f063406fe1eaede50cc8559e017569290f3dc7207799f7dba5a1089cc5c5c82"},"schema_version":"1.0"},"canonical_sha256":"9c048e1f00b0acb1d365a7724f34bf303a7c8b997034baca35e5a94c0a2dd9b8","source":{"kind":"arxiv","id":"1202.4045","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4045","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4045v2","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4045","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"TQCI4HYAWCWL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TQCI4HYAWCWLDU3F","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TQCI4HYA","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TQCI4HYAWCWLDU3FU5ZE6NF7GA","target":"record","payload":{"canonical_record":{"source":{"id":"1202.4045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-18T01:09:23Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8e6ce324386c2e710568785893bb0ef52849429ca13877b0b41c5e6266e4ae06","abstract_canon_sha256":"3f063406fe1eaede50cc8559e017569290f3dc7207799f7dba5a1089cc5c5c82"},"schema_version":"1.0"},"canonical_sha256":"9c048e1f00b0acb1d365a7724f34bf303a7c8b997034baca35e5a94c0a2dd9b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:01.140306Z","signature_b64":"HhLUUwhOMmOW/+0G6QmoTyMlJM/yWROQXL2MnZurbaxzRG7vKEQDHjz4r/Dhejt0uhuLUUG7DJG3Z4WTFNjCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c048e1f00b0acb1d365a7724f34bf303a7c8b997034baca35e5a94c0a2dd9b8","last_reissued_at":"2026-05-18T03:47:01.139644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:01.139644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.4045","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-18T03:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/OjpjUehjGRq7V7KebevFaNPOduW8yvrSSTT/4QJTIGJ4sQ3/FUh87o5Riqkjaw+JdJGxXy4pZzvixNTE7MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:19:49.474890Z"},"content_sha256":"aaddb71125a15e859285e3ddc5a16b1909c39e460176dc525762c6a43eb2dad5","schema_version":"1.0","event_id":"sha256:aaddb71125a15e859285e3ddc5a16b1909c39e460176dc525762c6a43eb2dad5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TQCI4HYAWCWLDU3FU5ZE6NF7GA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complementary vertices and adjacency testing in polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Benjamin A. Burton","submitted_at":"2012-02-18T01:09:23Z","abstract_excerpt":"Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we improve adjacency testing for vertices in both simple and non-simple polytopes: given a polytope in the standard form {x \\in R^n | Ax = b and x \\geq 0} and a list of its V vertices, we describe an O(n) test to identify whether any two given vertices are adjacent. For simple polytopes this test is perfect; for non-simple polytopes it may be indeterminate, and in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4045","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-18T03:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiPrVmL21AbBEO/62EWUZicF2MTJNgfPUXz47owZ8trAc5POUaGWpyCxY6ipnKWokf4S46y8iNgb7FQrcXGvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:19:49.475642Z"},"content_sha256":"d237626daa6e77022bb0e5a75bc0a5b6f9b3b4b1b83e087a89ceb773d03ecd95","schema_version":"1.0","event_id":"sha256:d237626daa6e77022bb0e5a75bc0a5b6f9b3b4b1b83e087a89ceb773d03ecd95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQCI4HYAWCWLDU3FU5ZE6NF7GA/bundle.json","state_url":"https://pith.science/pith/TQCI4HYAWCWLDU3FU5ZE6NF7GA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQCI4HYAWCWLDU3FU5ZE6NF7GA/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-12T02:19:49Z","links":{"resolver":"https://pith.science/pith/TQCI4HYAWCWLDU3FU5ZE6NF7GA","bundle":"https://pith.science/pith/TQCI4HYAWCWLDU3FU5ZE6NF7GA/bundle.json","state":"https://pith.science/pith/TQCI4HYAWCWLDU3FU5ZE6NF7GA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQCI4HYAWCWLDU3FU5ZE6NF7GA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TQCI4HYAWCWLDU3FU5ZE6NF7GA","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":"3f063406fe1eaede50cc8559e017569290f3dc7207799f7dba5a1089cc5c5c82","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-18T01:09:23Z","title_canon_sha256":"8e6ce324386c2e710568785893bb0ef52849429ca13877b0b41c5e6266e4ae06"},"schema_version":"1.0","source":{"id":"1202.4045","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4045","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4045v2","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4045","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"TQCI4HYAWCWL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TQCI4HYAWCWLDU3F","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TQCI4HYA","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:d237626daa6e77022bb0e5a75bc0a5b6f9b3b4b1b83e087a89ceb773d03ecd95","target":"graph","created_at":"2026-05-18T03:47:01Z","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":"Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we improve adjacency testing for vertices in both simple and non-simple polytopes: given a polytope in the standard form {x \\in R^n | Ax = b and x \\geq 0} and a list of its V vertices, we describe an O(n) test to identify whether any two given vertices are adjacent. For simple polytopes this test is perfect; for non-simple polytopes it may be indeterminate, and in","authors_text":"Benjamin A. Burton","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-18T01:09:23Z","title":"Complementary vertices and adjacency testing in polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4045","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:aaddb71125a15e859285e3ddc5a16b1909c39e460176dc525762c6a43eb2dad5","target":"record","created_at":"2026-05-18T03:47:01Z","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":"3f063406fe1eaede50cc8559e017569290f3dc7207799f7dba5a1089cc5c5c82","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-18T01:09:23Z","title_canon_sha256":"8e6ce324386c2e710568785893bb0ef52849429ca13877b0b41c5e6266e4ae06"},"schema_version":"1.0","source":{"id":"1202.4045","kind":"arxiv","version":2}},"canonical_sha256":"9c048e1f00b0acb1d365a7724f34bf303a7c8b997034baca35e5a94c0a2dd9b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c048e1f00b0acb1d365a7724f34bf303a7c8b997034baca35e5a94c0a2dd9b8","first_computed_at":"2026-05-18T03:47:01.139644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:01.139644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HhLUUwhOMmOW/+0G6QmoTyMlJM/yWROQXL2MnZurbaxzRG7vKEQDHjz4r/Dhejt0uhuLUUG7DJG3Z4WTFNjCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:01.140306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4045","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaddb71125a15e859285e3ddc5a16b1909c39e460176dc525762c6a43eb2dad5","sha256:d237626daa6e77022bb0e5a75bc0a5b6f9b3b4b1b83e087a89ceb773d03ecd95"],"state_sha256":"154797eea3963ce5cdd6ee9836cbe3b8fb3193cc98a54697515308454c5d8d14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HpkAJUId3ZaoXZfIT9IWi9e4NVKBVE5NKmmnNlCLkPDprybcGdwFZLEUZJuoJZKkQnNwGhrqhhH3dWZL72wBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:19:49.479963Z","bundle_sha256":"db8404689c7b54c1b6acc4cb1c64327b1d64fc107d41b63b65ab795dc42e5253"}}