{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:27Y6W2FFXTYUQB3Z64NNOMD27L","short_pith_number":"pith:27Y6W2FF","schema_version":"1.0","canonical_sha256":"d7f1eb68a5bcf1480779f71ad7307afac55d7777d04d34e29aa8b16fb0da89c3","source":{"kind":"arxiv","id":"1705.00924","version":2},"attestation_state":"computed","paper":{"title":"Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christian Scheffer, S\\'andor P. Fekete, Sebastian Morr","submitted_at":"2017-05-02T11:48:45Z","abstract_excerpt":"In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\\mathsf{NP}$-hard. In this paper, we present new sufficient conditions for packing circles into square and triangular containers, using only the sum of the circles' areas: For square containers, it is possible to pack any set of circles with a combined area of up to approximately 53.90% of the square's area. And when the container is a right or obtuse triangle, any set of circles whose combined area does not exceed the triangle's"},"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":"1705.00924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-05-02T11:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"e5623e2cc4854d679cfcd85138f7894696e89e7e5e1d03e808eccd058f249492","abstract_canon_sha256":"b77960ada38befa12b0b2dbef875f397fb284fb2766e41114b9b533e93a6ae7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:14.307601Z","signature_b64":"Z44nbO3Xd7xFwX9x307iG2mSzQQ7QA8BSC8yk0/iCT9VfwBR39G3CVdWTiu+IHicYKByAE0/+57jWYzFPoAlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7f1eb68a5bcf1480779f71ad7307afac55d7777d04d34e29aa8b16fb0da89c3","last_reissued_at":"2026-05-18T00:12:14.307082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:14.307082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christian Scheffer, S\\'andor P. Fekete, Sebastian Morr","submitted_at":"2017-05-02T11:48:45Z","abstract_excerpt":"In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\\mathsf{NP}$-hard. In this paper, we present new sufficient conditions for packing circles into square and triangular containers, using only the sum of the circles' areas: For square containers, it is possible to pack any set of circles with a combined area of up to approximately 53.90% of the square's area. And when the container is a right or obtuse triangle, any set of circles whose combined area does not exceed the triangle's"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00924","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":""},"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":"1705.00924","created_at":"2026-05-18T00:12:14.307144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00924v2","created_at":"2026-05-18T00:12:14.307144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00924","created_at":"2026-05-18T00:12:14.307144+00:00"},{"alias_kind":"pith_short_12","alias_value":"27Y6W2FFXTYU","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"27Y6W2FFXTYUQB3Z","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"27Y6W2FF","created_at":"2026-05-18T12:30:55.937587+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/27Y6W2FFXTYUQB3Z64NNOMD27L","json":"https://pith.science/pith/27Y6W2FFXTYUQB3Z64NNOMD27L.json","graph_json":"https://pith.science/api/pith-number/27Y6W2FFXTYUQB3Z64NNOMD27L/graph.json","events_json":"https://pith.science/api/pith-number/27Y6W2FFXTYUQB3Z64NNOMD27L/events.json","paper":"https://pith.science/paper/27Y6W2FF"},"agent_actions":{"view_html":"https://pith.science/pith/27Y6W2FFXTYUQB3Z64NNOMD27L","download_json":"https://pith.science/pith/27Y6W2FFXTYUQB3Z64NNOMD27L.json","view_paper":"https://pith.science/paper/27Y6W2FF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00924&json=true","fetch_graph":"https://pith.science/api/pith-number/27Y6W2FFXTYUQB3Z64NNOMD27L/graph.json","fetch_events":"https://pith.science/api/pith-number/27Y6W2FFXTYUQB3Z64NNOMD27L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27Y6W2FFXTYUQB3Z64NNOMD27L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27Y6W2FFXTYUQB3Z64NNOMD27L/action/storage_attestation","attest_author":"https://pith.science/pith/27Y6W2FFXTYUQB3Z64NNOMD27L/action/author_attestation","sign_citation":"https://pith.science/pith/27Y6W2FFXTYUQB3Z64NNOMD27L/action/citation_signature","submit_replication":"https://pith.science/pith/27Y6W2FFXTYUQB3Z64NNOMD27L/action/replication_record"}},"created_at":"2026-05-18T00:12:14.307144+00:00","updated_at":"2026-05-18T00:12:14.307144+00:00"}