{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:P54L4AFPST2NAM5HLPRHCG3DY6","short_pith_number":"pith:P54L4AFP","schema_version":"1.0","canonical_sha256":"7f78be00af94f4d033a75be2711b63c78bd6a4a78bb22469b6ed9d2f0f0d8f56","source":{"kind":"arxiv","id":"1307.8268","version":2},"attestation_state":"computed","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$-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.8268","created_at":"2026-05-18T03:04:37.451097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.8268v2","created_at":"2026-05-18T03:04:37.451097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8268","created_at":"2026-05-18T03:04:37.451097+00:00"},{"alias_kind":"pith_short_12","alias_value":"P54L4AFPST2N","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P54L4AFPST2NAM5H","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P54L4AFP","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6","json":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6.json","graph_json":"https://pith.science/api/pith-number/P54L4AFPST2NAM5HLPRHCG3DY6/graph.json","events_json":"https://pith.science/api/pith-number/P54L4AFPST2NAM5HLPRHCG3DY6/events.json","paper":"https://pith.science/paper/P54L4AFP"},"agent_actions":{"view_html":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6","download_json":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6.json","view_paper":"https://pith.science/paper/P54L4AFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.8268&json=true","fetch_graph":"https://pith.science/api/pith-number/P54L4AFPST2NAM5HLPRHCG3DY6/graph.json","fetch_events":"https://pith.science/api/pith-number/P54L4AFPST2NAM5HLPRHCG3DY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/action/storage_attestation","attest_author":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/action/author_attestation","sign_citation":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/action/citation_signature","submit_replication":"https://pith.science/pith/P54L4AFPST2NAM5HLPRHCG3DY6/action/replication_record"}},"created_at":"2026-05-18T03:04:37.451097+00:00","updated_at":"2026-05-18T03:04:37.451097+00:00"}