{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:GMHUUCCX3VB7H6P5FSVWIVNOBN","short_pith_number":"pith:GMHUUCCX","schema_version":"1.0","canonical_sha256":"330f4a0857dd43f3f9fd2cab6455ae0b4fbe968f825918fa2009375175478f3f","source":{"kind":"arxiv","id":"math/9405218","version":1},"attestation_state":"computed","paper":{"title":"Average kissing numbers for non-congruent sphere packings","license":"","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Greg Kuperberg, Oded Schramm","submitted_at":"1994-05-13T00:00:00Z","abstract_excerpt":"The Koebe circle packing theorem states that every finite planar graph can be realized as the nerve of a packing of (non-congruent) circles in R^3. We investigate the average kissing number of finite packings of non-congruent spheres in R^3 as a first restriction on the possible nerves of such packings. We show that the supremum k of the average kissing number for all packings satisfies\n 12.566 ~ 666/53 <= k < 8 + 4*sqrt(3) ~ 14.928\n  We obtain the upper bound by a resource exhaustion argument and the upper bound by a construction involving packings of spherical caps in S^3. Our result contrad"},"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":"math/9405218","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.MG","submitted_at":"1994-05-13T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"315cc90b5701d34fcff35e99680c7732959601b8fc526b627e65bb42e8b622c1","abstract_canon_sha256":"6b4b5f2c38b14511d38baddb543e5964bf5b66155ae811bdac016eff2f9fbe0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:51.354451Z","signature_b64":"UzwOpFGk/aI46Gxhx0Zp+bKwldnYEgMs9yL1/AI/cC5jZCG4BToPvOCgRXB/uSH8hnXoLasYPQ6rsOtFOLK0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330f4a0857dd43f3f9fd2cab6455ae0b4fbe968f825918fa2009375175478f3f","last_reissued_at":"2026-05-18T01:05:51.353963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:51.353963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average kissing numbers for non-congruent sphere packings","license":"","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Greg Kuperberg, Oded Schramm","submitted_at":"1994-05-13T00:00:00Z","abstract_excerpt":"The Koebe circle packing theorem states that every finite planar graph can be realized as the nerve of a packing of (non-congruent) circles in R^3. We investigate the average kissing number of finite packings of non-congruent spheres in R^3 as a first restriction on the possible nerves of such packings. We show that the supremum k of the average kissing number for all packings satisfies\n 12.566 ~ 666/53 <= k < 8 + 4*sqrt(3) ~ 14.928\n  We obtain the upper bound by a resource exhaustion argument and the upper bound by a construction involving packings of spherical caps in S^3. Our result contrad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9405218","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/9405218","created_at":"2026-05-18T01:05:51.354033+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9405218v1","created_at":"2026-05-18T01:05:51.354033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9405218","created_at":"2026-05-18T01:05:51.354033+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMHUUCCX3VB7","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMHUUCCX3VB7H6P5","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMHUUCCX","created_at":"2026-05-18T12:25:47.102015+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/GMHUUCCX3VB7H6P5FSVWIVNOBN","json":"https://pith.science/pith/GMHUUCCX3VB7H6P5FSVWIVNOBN.json","graph_json":"https://pith.science/api/pith-number/GMHUUCCX3VB7H6P5FSVWIVNOBN/graph.json","events_json":"https://pith.science/api/pith-number/GMHUUCCX3VB7H6P5FSVWIVNOBN/events.json","paper":"https://pith.science/paper/GMHUUCCX"},"agent_actions":{"view_html":"https://pith.science/pith/GMHUUCCX3VB7H6P5FSVWIVNOBN","download_json":"https://pith.science/pith/GMHUUCCX3VB7H6P5FSVWIVNOBN.json","view_paper":"https://pith.science/paper/GMHUUCCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9405218&json=true","fetch_graph":"https://pith.science/api/pith-number/GMHUUCCX3VB7H6P5FSVWIVNOBN/graph.json","fetch_events":"https://pith.science/api/pith-number/GMHUUCCX3VB7H6P5FSVWIVNOBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMHUUCCX3VB7H6P5FSVWIVNOBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMHUUCCX3VB7H6P5FSVWIVNOBN/action/storage_attestation","attest_author":"https://pith.science/pith/GMHUUCCX3VB7H6P5FSVWIVNOBN/action/author_attestation","sign_citation":"https://pith.science/pith/GMHUUCCX3VB7H6P5FSVWIVNOBN/action/citation_signature","submit_replication":"https://pith.science/pith/GMHUUCCX3VB7H6P5FSVWIVNOBN/action/replication_record"}},"created_at":"2026-05-18T01:05:51.354033+00:00","updated_at":"2026-05-18T01:05:51.354033+00:00"}