{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MADT5QM5FFQDOOZ6VGOH2R6NXU","short_pith_number":"pith:MADT5QM5","schema_version":"1.0","canonical_sha256":"60073ec19d2960373b3ea99c7d47cdbd1130806c43f7dbbe2e98bf68018bb88f","source":{"kind":"arxiv","id":"2303.02650","version":2},"attestation_state":"computed","paper":{"title":"Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Chu-Min Li, Jianrong Zhou, Jiongzhi Zheng, Kun He","submitted_at":"2023-03-05T11:57:18Z","abstract_excerpt":"The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This problem is computationally challenging, and researchers mainly focus on small-scale instances with the number of circular items n less than 320 in the literature. In this work, we aim to solve this problem on large scale. Specifically, we propose a novel geometric batch optimization method that not only can significantly speed up the convergence process of continuous optimization but also reduce the memory requirement du"},"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":"2303.02650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-03-05T11:57:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2a4a99e63c25a1e43081fc55f31c288a9c11d0d7f4f91aaf53b360cdeb353afd","abstract_canon_sha256":"c325d298586c3c3a06c9add295023d6d4a395af4a31e9dddc02b5101de4e4214"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:18.571189Z","signature_b64":"7HfbctpzABiaV/ceN0xVgaDL8M0kvxwKl41FHf0lM9rIA1yRO8IiPv261h59JVFQt1vtmnmVW3XdX9K/uXfBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60073ec19d2960373b3ea99c7d47cdbd1130806c43f7dbbe2e98bf68018bb88f","last_reissued_at":"2026-07-05T05:49:18.570583Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:18.570583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Chu-Min Li, Jianrong Zhou, Jiongzhi Zheng, Kun He","submitted_at":"2023-03-05T11:57:18Z","abstract_excerpt":"The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This problem is computationally challenging, and researchers mainly focus on small-scale instances with the number of circular items n less than 320 in the literature. In this work, we aim to solve this problem on large scale. Specifically, we propose a novel geometric batch optimization method that not only can significantly speed up the convergence process of continuous optimization but also reduce the memory requirement du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.02650","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.02650/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.02650","created_at":"2026-07-05T05:49:18.570645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.02650v2","created_at":"2026-07-05T05:49:18.570645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.02650","created_at":"2026-07-05T05:49:18.570645+00:00"},{"alias_kind":"pith_short_12","alias_value":"MADT5QM5FFQD","created_at":"2026-07-05T05:49:18.570645+00:00"},{"alias_kind":"pith_short_16","alias_value":"MADT5QM5FFQDOOZ6","created_at":"2026-07-05T05:49:18.570645+00:00"},{"alias_kind":"pith_short_8","alias_value":"MADT5QM5","created_at":"2026-07-05T05:49:18.570645+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/MADT5QM5FFQDOOZ6VGOH2R6NXU","json":"https://pith.science/pith/MADT5QM5FFQDOOZ6VGOH2R6NXU.json","graph_json":"https://pith.science/api/pith-number/MADT5QM5FFQDOOZ6VGOH2R6NXU/graph.json","events_json":"https://pith.science/api/pith-number/MADT5QM5FFQDOOZ6VGOH2R6NXU/events.json","paper":"https://pith.science/paper/MADT5QM5"},"agent_actions":{"view_html":"https://pith.science/pith/MADT5QM5FFQDOOZ6VGOH2R6NXU","download_json":"https://pith.science/pith/MADT5QM5FFQDOOZ6VGOH2R6NXU.json","view_paper":"https://pith.science/paper/MADT5QM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.02650&json=true","fetch_graph":"https://pith.science/api/pith-number/MADT5QM5FFQDOOZ6VGOH2R6NXU/graph.json","fetch_events":"https://pith.science/api/pith-number/MADT5QM5FFQDOOZ6VGOH2R6NXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MADT5QM5FFQDOOZ6VGOH2R6NXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MADT5QM5FFQDOOZ6VGOH2R6NXU/action/storage_attestation","attest_author":"https://pith.science/pith/MADT5QM5FFQDOOZ6VGOH2R6NXU/action/author_attestation","sign_citation":"https://pith.science/pith/MADT5QM5FFQDOOZ6VGOH2R6NXU/action/citation_signature","submit_replication":"https://pith.science/pith/MADT5QM5FFQDOOZ6VGOH2R6NXU/action/replication_record"}},"created_at":"2026-07-05T05:49:18.570645+00:00","updated_at":"2026-07-05T05:49:18.570645+00:00"}