{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:P54L4AFPST2NAM5HLPRHCG3DY6","short_pith_number":"pith:P54L4AFP","canonical_record":{"source":{"id":"1307.8268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-07-31T10:19:10Z","cross_cats_sorted":[],"title_canon_sha256":"8addea701fcecb7dffdd33e2f9ab7455c2445abed663f00976c9aec7fb0f703e","abstract_canon_sha256":"3be13476476733afefa652d791cb5f262b732c62c44d6b0ac8abca7c3e5a2e23"},"schema_version":"1.0"},"canonical_sha256":"7f78be00af94f4d033a75be2711b63c78bd6a4a78bb22469b6ed9d2f0f0d8f56","source":{"kind":"arxiv","id":"1307.8268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8268","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8268v2","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8268","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"P54L4AFPST2N","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P54L4AFPST2NAM5H","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P54L4AFP","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:P54L4AFPST2NAM5HLPRHCG3DY6","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-07-31T10:19:10Z","cross_cats_sorted":[],"title_canon_sha256":"8addea701fcecb7dffdd33e2f9ab7455c2445abed663f00976c9aec7fb0f703e","abstract_canon_sha256":"3be13476476733afefa652d791cb5f262b732c62c44d6b0ac8abca7c3e5a2e23"},"schema_version":"1.0"},"canonical_sha256":"7f78be00af94f4d033a75be2711b63c78bd6a4a78bb22469b6ed9d2f0f0d8f56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:37.451697Z","signature_b64":"KijG6yp10BJVnBCsRVaNkdMkGMUfZ6jTYanxZuer9ntxHUA36/kUDiifKfhbqfwUebx3ctRYSzEmcfSvj2b2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f78be00af94f4d033a75be2711b63c78bd6a4a78bb22469b6ed9d2f0f0d8f56","last_reissued_at":"2026-05-18T03:04:37.450973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:37.450973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8268","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:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZIAirOc16eJL4PhAnO3gmpzeZz9ISyVndNfrvqTQ2nEYMPepStLyHkilFLqW1Is9q0SP8BG1LYW15MeokNZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:13:11.787877Z"},"content_sha256":"a7d83938c24bec17c5794e3266eeecd24f9dfb4673203d800f1c9dc320bfad34","schema_version":"1.0","event_id":"sha256:a7d83938c24bec17c5794e3266eeecd24f9dfb4673203d800f1c9dc320bfad34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:P54L4AFPST2NAM5HLPRHCG3DY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Helly-Type Theorems in Property Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf, Sourav Chakraborty","submitted_at":"2013-07-31T10:19:10Z","abstract_excerpt":"Helly's theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If $S$ is a set of $n$ points in $R^d$, we say that $S$ is $(k,G)$-clusterable if it can be partitioned into $k$ clusters (subsets) such that each cluster can be contained in a translated copy of a geometric object $G$. In this paper, as an application of Helly's theorem, by taking a constant size sample from $S$, we present a testing algorithm for $(k,G)$-clustering, i.e., to distinguish between two cases: when $S$ is $(k,G)$-clusterable, and when it is $\\epsilon$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8268","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:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vs8sBPfv+QOTmfkM6iTQokJ/M2VYpuRwrYyWe9vRL6pysyuiZUhKK1HRJFHzdiyNveeIhK39bgiYPY/UO+gHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:13:11.788217Z"},"content_sha256":"36225549f15e82403a570607af70927b5c2d2bfa39464adaeab81bd7c6efb485","schema_version":"1.0","event_id":"sha256:36225549f15e82403a570607af70927b5c2d2bfa39464adaeab81bd7c6efb485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/bundle.json","state_url":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P54L4AFPST2NAM5HLPRHCG3DY6/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-01T08:13:11Z","links":{"resolver":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6","bundle":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/bundle.json","state":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P54L4AFPST2NAM5HLPRHCG3DY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:P54L4AFPST2NAM5HLPRHCG3DY6","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":"3be13476476733afefa652d791cb5f262b732c62c44d6b0ac8abca7c3e5a2e23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-07-31T10:19:10Z","title_canon_sha256":"8addea701fcecb7dffdd33e2f9ab7455c2445abed663f00976c9aec7fb0f703e"},"schema_version":"1.0","source":{"id":"1307.8268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8268","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8268v2","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8268","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"P54L4AFPST2N","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P54L4AFPST2NAM5H","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P54L4AFP","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:36225549f15e82403a570607af70927b5c2d2bfa39464adaeab81bd7c6efb485","target":"graph","created_at":"2026-05-18T03:04:37Z","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":"Helly's theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If $S$ is a set of $n$ points in $R^d$, we say that $S$ is $(k,G)$-clusterable if it can be partitioned into $k$ clusters (subsets) such that each cluster can be contained in a translated copy of a geometric object $G$. In this paper, as an application of Helly's theorem, by taking a constant size sample from $S$, we present a testing algorithm for $(k,G)$-clustering, i.e., to distinguish between two cases: when $S$ is $(k,G)$-clusterable, and when it is $\\epsilon$-","authors_text":"Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf, Sourav Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-07-31T10:19:10Z","title":"Helly-Type Theorems in Property Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8268","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:a7d83938c24bec17c5794e3266eeecd24f9dfb4673203d800f1c9dc320bfad34","target":"record","created_at":"2026-05-18T03:04:37Z","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":"3be13476476733afefa652d791cb5f262b732c62c44d6b0ac8abca7c3e5a2e23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-07-31T10:19:10Z","title_canon_sha256":"8addea701fcecb7dffdd33e2f9ab7455c2445abed663f00976c9aec7fb0f703e"},"schema_version":"1.0","source":{"id":"1307.8268","kind":"arxiv","version":2}},"canonical_sha256":"7f78be00af94f4d033a75be2711b63c78bd6a4a78bb22469b6ed9d2f0f0d8f56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f78be00af94f4d033a75be2711b63c78bd6a4a78bb22469b6ed9d2f0f0d8f56","first_computed_at":"2026-05-18T03:04:37.450973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:37.450973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KijG6yp10BJVnBCsRVaNkdMkGMUfZ6jTYanxZuer9ntxHUA36/kUDiifKfhbqfwUebx3ctRYSzEmcfSvj2b2Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:37.451697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7d83938c24bec17c5794e3266eeecd24f9dfb4673203d800f1c9dc320bfad34","sha256:36225549f15e82403a570607af70927b5c2d2bfa39464adaeab81bd7c6efb485"],"state_sha256":"0dcbf9d7bd76c683bd7b2bdd0b4a283902fed33370d893d760a616e6dffd9bfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+hM7yUuR0HCYwHfzL1om8W0rzgO0Dt/gwj/UQwVWvr67TDJJDjrvLdkgSZmHDXYr02AFo8hPRuNs8JaboZwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:13:11.790200Z","bundle_sha256":"7617d7f2ec80771e7471027eb425c7e4340818e65d11ed6c4b4b4e45cb4e0f81"}}