{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VBQYLNWGYY6GNNIATZIGB3UXO2","short_pith_number":"pith:VBQYLNWG","schema_version":"1.0","canonical_sha256":"a86185b6c6c63c66b5009e5060ee97768686ac0b12b3b83b7d63112c9a23d5bc","source":{"kind":"arxiv","id":"1707.00605","version":1},"attestation_state":"computed","paper":{"title":"Proof of the Honeycomb Asymptotics for Optimal Cheeger Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.SP"],"primary_cat":"math.MG","authors_text":"Dorin Bucur, Ilaria Fragala","submitted_at":"2017-06-30T16:54:04Z","abstract_excerpt":"We prove that, in the limit as $k \\to+ \\infty$, the hexagonal honeycomb solves the optimal partition problem in which the criterion is minimizing the largest among the Cheeger constants of $k$ mutually disjoint cells in a planar domain. As a by-product, the same result holds true when the Cheeger constant is replaced by the first Robin eigenvalue of the Laplacian."},"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":"1707.00605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2017-06-30T16:54:04Z","cross_cats_sorted":["math.OC","math.SP"],"title_canon_sha256":"ac9be3c2bd7e84f87e8e510824aee14870e39b6e02492b9ff883b9a52fdfa98d","abstract_canon_sha256":"7e2f26b4ec72127c07b0402b8b66d708e78910245f207a6bd43c15d7e32a23b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:02.921965Z","signature_b64":"/itMq3v52aQKN9y8HNr6U5zpcvB65tf2xKT3maMvuxUW5oAXUcN6LhuJtqY6rXJBZst0Zx+UWiSR8ithOKlBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86185b6c6c63c66b5009e5060ee97768686ac0b12b3b83b7d63112c9a23d5bc","last_reissued_at":"2026-05-18T00:41:02.921231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:02.921231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of the Honeycomb Asymptotics for Optimal Cheeger Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.SP"],"primary_cat":"math.MG","authors_text":"Dorin Bucur, Ilaria Fragala","submitted_at":"2017-06-30T16:54:04Z","abstract_excerpt":"We prove that, in the limit as $k \\to+ \\infty$, the hexagonal honeycomb solves the optimal partition problem in which the criterion is minimizing the largest among the Cheeger constants of $k$ mutually disjoint cells in a planar domain. As a by-product, the same result holds true when the Cheeger constant is replaced by the first Robin eigenvalue of the Laplacian."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00605","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":"1707.00605","created_at":"2026-05-18T00:41:02.921369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00605v1","created_at":"2026-05-18T00:41:02.921369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00605","created_at":"2026-05-18T00:41:02.921369+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBQYLNWGYY6G","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBQYLNWGYY6GNNIA","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBQYLNWG","created_at":"2026-05-18T12:31:49.984773+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/VBQYLNWGYY6GNNIATZIGB3UXO2","json":"https://pith.science/pith/VBQYLNWGYY6GNNIATZIGB3UXO2.json","graph_json":"https://pith.science/api/pith-number/VBQYLNWGYY6GNNIATZIGB3UXO2/graph.json","events_json":"https://pith.science/api/pith-number/VBQYLNWGYY6GNNIATZIGB3UXO2/events.json","paper":"https://pith.science/paper/VBQYLNWG"},"agent_actions":{"view_html":"https://pith.science/pith/VBQYLNWGYY6GNNIATZIGB3UXO2","download_json":"https://pith.science/pith/VBQYLNWGYY6GNNIATZIGB3UXO2.json","view_paper":"https://pith.science/paper/VBQYLNWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00605&json=true","fetch_graph":"https://pith.science/api/pith-number/VBQYLNWGYY6GNNIATZIGB3UXO2/graph.json","fetch_events":"https://pith.science/api/pith-number/VBQYLNWGYY6GNNIATZIGB3UXO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBQYLNWGYY6GNNIATZIGB3UXO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBQYLNWGYY6GNNIATZIGB3UXO2/action/storage_attestation","attest_author":"https://pith.science/pith/VBQYLNWGYY6GNNIATZIGB3UXO2/action/author_attestation","sign_citation":"https://pith.science/pith/VBQYLNWGYY6GNNIATZIGB3UXO2/action/citation_signature","submit_replication":"https://pith.science/pith/VBQYLNWGYY6GNNIATZIGB3UXO2/action/replication_record"}},"created_at":"2026-05-18T00:41:02.921369+00:00","updated_at":"2026-05-18T00:41:02.921369+00:00"}