{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DI57RXNGRGIV2GKEAU26BYDB3O","short_pith_number":"pith:DI57RXNG","schema_version":"1.0","canonical_sha256":"1a3bf8dda689915d19440535e0e061dbb4e621665b8e3c60d8f994d6aa49ab02","source":{"kind":"arxiv","id":"1608.03245","version":4},"attestation_state":"computed","paper":{"title":"On the Complexity of Closest Pair via Polar-Pair of Point-Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.MG"],"primary_cat":"cs.CG","authors_text":"Bundit Laekhanukit, Karthik C. S., Roee David","submitted_at":"2016-08-10T18:13:00Z","abstract_excerpt":"Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric $\\Delta$ such that there is an edge $uv$ in $G$ if and only if the spheres corresponding to $u$ and $v$ intersect. The smallest integer $d$ such that $G$ can be represented by a collection of spheres (all of the same radius) in $\\Delta$ is called the sphericity of $G$, and if the collection of spheres are non-overlapping, then the value $d$ is called the contact-dimension of $G$. In this paper, we study the sphericity and contact dimension of the complete bipartite graph $K_{n,n}$ in various $L"},"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":"1608.03245","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-10T18:13:00Z","cross_cats_sorted":["cs.CC","math.MG"],"title_canon_sha256":"34986c9a2174709e2a2b1a785cd485cdfc23c5d52a4b657be365881d6c80e0a4","abstract_canon_sha256":"76d0a3110e3e40c97cb739b0340317b5179ec709ba692e1dfe662e94be412792"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:41.582522Z","signature_b64":"7f5QTwEg0GTe7bgvYQWkFRtI93UMnhlBw4w5f7jkWiwaSfTGHg6If0/S04xjrdO9BbkwnT6besuIvxPBbGMuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a3bf8dda689915d19440535e0e061dbb4e621665b8e3c60d8f994d6aa49ab02","last_reissued_at":"2026-05-18T00:00:41.582027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:41.582027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Closest Pair via Polar-Pair of Point-Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.MG"],"primary_cat":"cs.CG","authors_text":"Bundit Laekhanukit, Karthik C. S., Roee David","submitted_at":"2016-08-10T18:13:00Z","abstract_excerpt":"Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric $\\Delta$ such that there is an edge $uv$ in $G$ if and only if the spheres corresponding to $u$ and $v$ intersect. The smallest integer $d$ such that $G$ can be represented by a collection of spheres (all of the same radius) in $\\Delta$ is called the sphericity of $G$, and if the collection of spheres are non-overlapping, then the value $d$ is called the contact-dimension of $G$. In this paper, we study the sphericity and contact dimension of the complete bipartite graph $K_{n,n}$ in various $L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03245","kind":"arxiv","version":4},"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":"1608.03245","created_at":"2026-05-18T00:00:41.582117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03245v4","created_at":"2026-05-18T00:00:41.582117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03245","created_at":"2026-05-18T00:00:41.582117+00:00"},{"alias_kind":"pith_short_12","alias_value":"DI57RXNGRGIV","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DI57RXNGRGIV2GKE","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DI57RXNG","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09430","citing_title":"Algorithms for Similarity Search and Pseudorandomness","ref_index":69,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O","json":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O.json","graph_json":"https://pith.science/api/pith-number/DI57RXNGRGIV2GKEAU26BYDB3O/graph.json","events_json":"https://pith.science/api/pith-number/DI57RXNGRGIV2GKEAU26BYDB3O/events.json","paper":"https://pith.science/paper/DI57RXNG"},"agent_actions":{"view_html":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O","download_json":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O.json","view_paper":"https://pith.science/paper/DI57RXNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03245&json=true","fetch_graph":"https://pith.science/api/pith-number/DI57RXNGRGIV2GKEAU26BYDB3O/graph.json","fetch_events":"https://pith.science/api/pith-number/DI57RXNGRGIV2GKEAU26BYDB3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/action/storage_attestation","attest_author":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/action/author_attestation","sign_citation":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/action/citation_signature","submit_replication":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/action/replication_record"}},"created_at":"2026-05-18T00:00:41.582117+00:00","updated_at":"2026-05-18T00:00:41.582117+00:00"}