{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DI57RXNGRGIV2GKEAU26BYDB3O","short_pith_number":"pith:DI57RXNG","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"},"canonical_sha256":"1a3bf8dda689915d19440535e0e061dbb4e621665b8e3c60d8f994d6aa49ab02","source":{"kind":"arxiv","id":"1608.03245","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03245","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03245v4","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03245","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"DI57RXNGRGIV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DI57RXNGRGIV2GKE","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DI57RXNG","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DI57RXNGRGIV2GKEAU26BYDB3O","target":"record","payload":{"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"},"canonical_sha256":"1a3bf8dda689915d19440535e0e061dbb4e621665b8e3c60d8f994d6aa49ab02","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"},"source_kind":"arxiv","source_id":"1608.03245","source_version":4,"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:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NF5g6W7STb8volpT2WG1brajC6by9ouRqGe/lmCCnVtm6BMMPyvDd4n+S+GqIelADitoZnnc6ie0o03jbtbpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:45:56.651072Z"},"content_sha256":"14ddb1119925ae6a38aa1956414d4712b12cc8c361a391ad42bbacad1c0ed1fd","schema_version":"1.0","event_id":"sha256:14ddb1119925ae6a38aa1956414d4712b12cc8c361a391ad42bbacad1c0ed1fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DI57RXNGRGIV2GKEAU26BYDB3O","target":"graph","payload":{"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"},"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:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CR0y06iams4/aDwDJsbnEeCwKpAh4NIUWSGQWyAXKaZnRHClCqaQRFNzsmuPMWiSbgIO4qO3LX7U8Yu8NQRiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:45:56.651739Z"},"content_sha256":"fe98e1f4fd241cb46a096fd4ed87d0490e4a4aed08b0837ae805b3e1d28ca13f","schema_version":"1.0","event_id":"sha256:fe98e1f4fd241cb46a096fd4ed87d0490e4a4aed08b0837ae805b3e1d28ca13f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/bundle.json","state_url":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DI57RXNGRGIV2GKEAU26BYDB3O/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-26T14:45:56Z","links":{"resolver":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O","bundle":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/bundle.json","state":"https://pith.science/pith/DI57RXNGRGIV2GKEAU26BYDB3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DI57RXNGRGIV2GKEAU26BYDB3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DI57RXNGRGIV2GKEAU26BYDB3O","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":"76d0a3110e3e40c97cb739b0340317b5179ec709ba692e1dfe662e94be412792","cross_cats_sorted":["cs.CC","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-10T18:13:00Z","title_canon_sha256":"34986c9a2174709e2a2b1a785cd485cdfc23c5d52a4b657be365881d6c80e0a4"},"schema_version":"1.0","source":{"id":"1608.03245","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03245","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03245v4","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03245","created_at":"2026-05-18T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"DI57RXNGRGIV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DI57RXNGRGIV2GKE","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DI57RXNG","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:fe98e1f4fd241cb46a096fd4ed87d0490e4a4aed08b0837ae805b3e1d28ca13f","target":"graph","created_at":"2026-05-18T00:00:41Z","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":"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","authors_text":"Bundit Laekhanukit, Karthik C. S., Roee David","cross_cats":["cs.CC","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-10T18:13:00Z","title":"On the Complexity of Closest Pair via Polar-Pair of Point-Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03245","kind":"arxiv","version":4},"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:14ddb1119925ae6a38aa1956414d4712b12cc8c361a391ad42bbacad1c0ed1fd","target":"record","created_at":"2026-05-18T00:00:41Z","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":"76d0a3110e3e40c97cb739b0340317b5179ec709ba692e1dfe662e94be412792","cross_cats_sorted":["cs.CC","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-10T18:13:00Z","title_canon_sha256":"34986c9a2174709e2a2b1a785cd485cdfc23c5d52a4b657be365881d6c80e0a4"},"schema_version":"1.0","source":{"id":"1608.03245","kind":"arxiv","version":4}},"canonical_sha256":"1a3bf8dda689915d19440535e0e061dbb4e621665b8e3c60d8f994d6aa49ab02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a3bf8dda689915d19440535e0e061dbb4e621665b8e3c60d8f994d6aa49ab02","first_computed_at":"2026-05-18T00:00:41.582027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:41.582027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7f5QTwEg0GTe7bgvYQWkFRtI93UMnhlBw4w5f7jkWiwaSfTGHg6If0/S04xjrdO9BbkwnT6besuIvxPBbGMuCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:41.582522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03245","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14ddb1119925ae6a38aa1956414d4712b12cc8c361a391ad42bbacad1c0ed1fd","sha256:fe98e1f4fd241cb46a096fd4ed87d0490e4a4aed08b0837ae805b3e1d28ca13f"],"state_sha256":"0851c54280df4f7a7a21bf6c298fdbf16209e5a810837ab9f0d3b6bc9f4cd58f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNEVWtUg+i7Lhvx7hrjw3mvRx+xuJhQ8TUbwBAp+pt6Gkajb4h9mRAILqMOkhFBmQdQ4ZDsUbQuYXBdpx9sbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:45:56.655168Z","bundle_sha256":"054c2c1ad8f136c613183fdf377cf328d581c670b20f1e5f11670d4c2cb826c8"}}