{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YYYDRL52IT2IURTM3L2CG475VI","short_pith_number":"pith:YYYDRL52","canonical_record":{"source":{"id":"1612.03735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-04T23:36:09Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"c0b1c0032b05fb25afe3138dd231f0d649be687ea774192fd250bc00986fa956","abstract_canon_sha256":"f024e8ffcb50f8a49a6314de7bf2a0b172b225834333717b054a32304044f05e"},"schema_version":"1.0"},"canonical_sha256":"c63038afba44f48a466cdaf42373fdaa37e72d18ba85016eb0a3af668ad1db78","source":{"kind":"arxiv","id":"1612.03735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03735","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03735v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03735","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"YYYDRL52IT2I","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YYYDRL52IT2IURTM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YYYDRL52","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YYYDRL52IT2IURTM3L2CG475VI","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-04T23:36:09Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"c0b1c0032b05fb25afe3138dd231f0d649be687ea774192fd250bc00986fa956","abstract_canon_sha256":"f024e8ffcb50f8a49a6314de7bf2a0b172b225834333717b054a32304044f05e"},"schema_version":"1.0"},"canonical_sha256":"c63038afba44f48a466cdaf42373fdaa37e72d18ba85016eb0a3af668ad1db78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:18.471422Z","signature_b64":"onTUAc6ALbG39qB2dNz4pXW1dzCoxqx6WEmQA5bfGm3VPP6rDvXcoAJ1SqzId3mJggWVipsT9jp9qj5q82eXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63038afba44f48a466cdaf42373fdaa37e72d18ba85016eb0a3af668ad1db78","last_reissued_at":"2026-05-18T00:55:18.470760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:18.470760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03735","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:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oejtYbbJMw8i/h/m1smtfG1bO+SSpMFFUbrexPlMWo6xEfU9ClImlnkA64t+3Ci5kRqRSRcAidlMwVhZqjcKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:13:11.946269Z"},"content_sha256":"a41399740a1ff52896fa9a27fdd010e6b8ed1bc539cd6d537961718bc24f568f","schema_version":"1.0","event_id":"sha256:a41399740a1ff52896fa9a27fdd010e6b8ed1bc539cd6d537961718bc24f568f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YYYDRL52IT2IURTM3L2CG475VI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Testing Intersection of Convex Sets in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Israela Solomon","submitted_at":"2016-12-04T23:36:09Z","abstract_excerpt":"We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\\mathbb{R}^d$ ($n \\gg d$), such as polytopes, balls, etc. We assume that the complexity of each set depends only on $d$ (and not on the number of sets $n$). We test the property that there exists a common point in all sets, i.e. that their intersection is nonempty. Our goal is to distinguish between the case where the intersection is nonempty, and the case where even after removing many of the sets the intersection is empty. In particular, our algorithm returns "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03735","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:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5c00GkvbuyvMRXFLq4LuKAl6Q8nWAgyzvwt/lkfPjY55VKkdgcuqdFMsztEt7ukWlRe2JG4TzRuXrEUEMU/XBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:13:11.947118Z"},"content_sha256":"2721059915474fe0c5a90f060f56a5bb291f78b7d44de17d88e36b9d1eac7633","schema_version":"1.0","event_id":"sha256:2721059915474fe0c5a90f060f56a5bb291f78b7d44de17d88e36b9d1eac7633"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYYDRL52IT2IURTM3L2CG475VI/bundle.json","state_url":"https://pith.science/pith/YYYDRL52IT2IURTM3L2CG475VI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYYDRL52IT2IURTM3L2CG475VI/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-31T07:13:11Z","links":{"resolver":"https://pith.science/pith/YYYDRL52IT2IURTM3L2CG475VI","bundle":"https://pith.science/pith/YYYDRL52IT2IURTM3L2CG475VI/bundle.json","state":"https://pith.science/pith/YYYDRL52IT2IURTM3L2CG475VI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYYDRL52IT2IURTM3L2CG475VI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YYYDRL52IT2IURTM3L2CG475VI","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":"f024e8ffcb50f8a49a6314de7bf2a0b172b225834333717b054a32304044f05e","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-04T23:36:09Z","title_canon_sha256":"c0b1c0032b05fb25afe3138dd231f0d649be687ea774192fd250bc00986fa956"},"schema_version":"1.0","source":{"id":"1612.03735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03735","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03735v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03735","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"YYYDRL52IT2I","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YYYDRL52IT2IURTM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YYYDRL52","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:2721059915474fe0c5a90f060f56a5bb291f78b7d44de17d88e36b9d1eac7633","target":"graph","created_at":"2026-05-18T00:55: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":"We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\\mathbb{R}^d$ ($n \\gg d$), such as polytopes, balls, etc. We assume that the complexity of each set depends only on $d$ (and not on the number of sets $n$). We test the property that there exists a common point in all sets, i.e. that their intersection is nonempty. Our goal is to distinguish between the case where the intersection is nonempty, and the case where even after removing many of the sets the intersection is empty. In particular, our algorithm returns ","authors_text":"Israela Solomon","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-04T23:36:09Z","title":"A Note on Testing Intersection of Convex Sets in Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03735","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:a41399740a1ff52896fa9a27fdd010e6b8ed1bc539cd6d537961718bc24f568f","target":"record","created_at":"2026-05-18T00:55: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":"f024e8ffcb50f8a49a6314de7bf2a0b172b225834333717b054a32304044f05e","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-04T23:36:09Z","title_canon_sha256":"c0b1c0032b05fb25afe3138dd231f0d649be687ea774192fd250bc00986fa956"},"schema_version":"1.0","source":{"id":"1612.03735","kind":"arxiv","version":1}},"canonical_sha256":"c63038afba44f48a466cdaf42373fdaa37e72d18ba85016eb0a3af668ad1db78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c63038afba44f48a466cdaf42373fdaa37e72d18ba85016eb0a3af668ad1db78","first_computed_at":"2026-05-18T00:55:18.470760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:18.470760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"onTUAc6ALbG39qB2dNz4pXW1dzCoxqx6WEmQA5bfGm3VPP6rDvXcoAJ1SqzId3mJggWVipsT9jp9qj5q82eXAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:18.471422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a41399740a1ff52896fa9a27fdd010e6b8ed1bc539cd6d537961718bc24f568f","sha256:2721059915474fe0c5a90f060f56a5bb291f78b7d44de17d88e36b9d1eac7633"],"state_sha256":"be9f559254695bac0b214f216d5ea81abae695210a0a748876148e0d65676b25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKfe6Lyw+ydEIxSSN9KH+P+eiLsCZ9kbjSMRsE5dtduJhmcS7MEmNJ1lLuhrQHU7xvPEKv83mof79sZCTnQkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:13:11.951302Z","bundle_sha256":"974d8d9fc003ceb1e28b3fafc19c3976fa6759ce128ded46eb4130613b6bc1ae"}}