{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NPO35GRAR3DK4VDUL5PWX4MJRI","short_pith_number":"pith:NPO35GRA","canonical_record":{"source":{"id":"1612.01696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-06T08:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"96ec52ed0fec08e952c9257d18f71286be504f3ea825a19b64997e2b8933dcaf","abstract_canon_sha256":"575e6a727a136668ad21a63a0b2498594ac0d0410aae67d598e7067638114071"},"schema_version":"1.0"},"canonical_sha256":"6bddbe9a208ec6ae54745f5f6bf1898a29eaea863015cdaeb49dc4958337f50f","source":{"kind":"arxiv","id":"1612.01696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01696","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01696v1","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01696","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"NPO35GRAR3DK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NPO35GRAR3DK4VDU","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NPO35GRA","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NPO35GRAR3DK4VDUL5PWX4MJRI","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-06T08:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"96ec52ed0fec08e952c9257d18f71286be504f3ea825a19b64997e2b8933dcaf","abstract_canon_sha256":"575e6a727a136668ad21a63a0b2498594ac0d0410aae67d598e7067638114071"},"schema_version":"1.0"},"canonical_sha256":"6bddbe9a208ec6ae54745f5f6bf1898a29eaea863015cdaeb49dc4958337f50f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:18.445234Z","signature_b64":"HI9RmV8ENcobsUMcdM07No6Yp7MJ2JBFVHbxosdnhCwUSej/ewnbDTGKW38WWbrDU2palHZNPG8r3Xhv75QyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bddbe9a208ec6ae54745f5f6bf1898a29eaea863015cdaeb49dc4958337f50f","last_reissued_at":"2026-05-18T00:26:18.444739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:18.444739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01696","source_version":1,"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:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQpVjHnT9Fj+fvOpHS6euXIODGRDbLYB3ekckdJpRzuuO3xulGN28IRf4V6pCM//RltdWJQjvDOkQjxUQRzmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:10:21.456952Z"},"content_sha256":"3ce69461f4139fb9cbb3d15532cd42fa594c1da06f7747a02e3184d3974abcc6","schema_version":"1.0","event_id":"sha256:3ce69461f4139fb9cbb3d15532cd42fa594c1da06f7747a02e3184d3974abcc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NPO35GRAR3DK4VDUL5PWX4MJRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Approximate Polytope Membership","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David M. Mount, Guilherme D. da Fonseca, Sunil Arya","submitted_at":"2016-12-06T08:07:36Z","abstract_excerpt":"In the polytope membership problem, a convex polytope $K$ in $R^d$ is given, and the objective is to preprocess $K$ into a data structure so that, given a query point $q \\in R^d$, it is possible to determine efficiently whether $q \\in K$. We consider this problem in an approximate setting and assume that $d$ is a constant. Given an approximation parameter $\\varepsilon > 0$, the query can be answered either way if the distance from $q$ to $K$'s boundary is at most $\\varepsilon$ times $K$'s diameter. Previous solutions to the problem were on the form of a space-time trade-off, where logarithmic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01696","kind":"arxiv","version":1},"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:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nNmY1kEo08wYLLCScJd2LC1hE+1v/icfVfSpUhzVZypnLMueWod4kMRkLgT/5tmUtcV6Bp3RH4UFDFMgThIeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:10:21.457671Z"},"content_sha256":"34a5019c6e9a54dad671e1db81c381695ba7c3367b7ff4e0a1cd0b0bc21fb39e","schema_version":"1.0","event_id":"sha256:34a5019c6e9a54dad671e1db81c381695ba7c3367b7ff4e0a1cd0b0bc21fb39e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPO35GRAR3DK4VDUL5PWX4MJRI/bundle.json","state_url":"https://pith.science/pith/NPO35GRAR3DK4VDUL5PWX4MJRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPO35GRAR3DK4VDUL5PWX4MJRI/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-05-30T08:10:21Z","links":{"resolver":"https://pith.science/pith/NPO35GRAR3DK4VDUL5PWX4MJRI","bundle":"https://pith.science/pith/NPO35GRAR3DK4VDUL5PWX4MJRI/bundle.json","state":"https://pith.science/pith/NPO35GRAR3DK4VDUL5PWX4MJRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPO35GRAR3DK4VDUL5PWX4MJRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NPO35GRAR3DK4VDUL5PWX4MJRI","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":"575e6a727a136668ad21a63a0b2498594ac0d0410aae67d598e7067638114071","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-06T08:07:36Z","title_canon_sha256":"96ec52ed0fec08e952c9257d18f71286be504f3ea825a19b64997e2b8933dcaf"},"schema_version":"1.0","source":{"id":"1612.01696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01696","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01696v1","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01696","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"NPO35GRAR3DK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NPO35GRAR3DK4VDU","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NPO35GRA","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:34a5019c6e9a54dad671e1db81c381695ba7c3367b7ff4e0a1cd0b0bc21fb39e","target":"graph","created_at":"2026-05-18T00:26:18Z","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":"In the polytope membership problem, a convex polytope $K$ in $R^d$ is given, and the objective is to preprocess $K$ into a data structure so that, given a query point $q \\in R^d$, it is possible to determine efficiently whether $q \\in K$. We consider this problem in an approximate setting and assume that $d$ is a constant. Given an approximation parameter $\\varepsilon > 0$, the query can be answered either way if the distance from $q$ to $K$'s boundary is at most $\\varepsilon$ times $K$'s diameter. Previous solutions to the problem were on the form of a space-time trade-off, where logarithmic ","authors_text":"David M. Mount, Guilherme D. da Fonseca, Sunil Arya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-06T08:07:36Z","title":"Optimal Approximate Polytope Membership"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01696","kind":"arxiv","version":1},"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:3ce69461f4139fb9cbb3d15532cd42fa594c1da06f7747a02e3184d3974abcc6","target":"record","created_at":"2026-05-18T00:26:18Z","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":"575e6a727a136668ad21a63a0b2498594ac0d0410aae67d598e7067638114071","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-06T08:07:36Z","title_canon_sha256":"96ec52ed0fec08e952c9257d18f71286be504f3ea825a19b64997e2b8933dcaf"},"schema_version":"1.0","source":{"id":"1612.01696","kind":"arxiv","version":1}},"canonical_sha256":"6bddbe9a208ec6ae54745f5f6bf1898a29eaea863015cdaeb49dc4958337f50f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bddbe9a208ec6ae54745f5f6bf1898a29eaea863015cdaeb49dc4958337f50f","first_computed_at":"2026-05-18T00:26:18.444739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:18.444739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HI9RmV8ENcobsUMcdM07No6Yp7MJ2JBFVHbxosdnhCwUSej/ewnbDTGKW38WWbrDU2palHZNPG8r3Xhv75QyBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:18.445234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ce69461f4139fb9cbb3d15532cd42fa594c1da06f7747a02e3184d3974abcc6","sha256:34a5019c6e9a54dad671e1db81c381695ba7c3367b7ff4e0a1cd0b0bc21fb39e"],"state_sha256":"cb2f6a14f5bfdfc44c007174b660afec5ce836ccefd83e699c64c391515e06dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"49/9B962ODn/tb07Xp/FaaGJTxjRY1/nElk6uEaSzgtRBtQ0Q2IKQHLkSzflpTEo4MnmyXRUvj+7aPpn/EOMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:10:21.461094Z","bundle_sha256":"70a65cffbe85034b520b569e72bf3b77935d807eb51ac840a849eaa4d57ea7bf"}}