{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UFCOI6DO6JQJ2IF36HUHL5DHQE","short_pith_number":"pith:UFCOI6DO","schema_version":"1.0","canonical_sha256":"a144e4786ef2609d20bbf1e875f4678121fbd2376e6da0a043555eb928111f50","source":{"kind":"arxiv","id":"1412.4709","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-Time Approximation Schemes for Circle and Other Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fl\\'avio K. Miyazawa, Lehilton L. C. Pedrosa, Maxim Sviridenko, Rafael C. S. Schouery, Yoshiko Wakabayashi","submitted_at":"2014-12-15T18:27:32Z","abstract_excerpt":"We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augmented bins of height $1+\\gamma$, for some arbitrarily small number $\\gamma > 0$. Our algorithm is polynomial on $\\log 1/\\gamma$, and thus $\\gamma$ is part of the problem input. For the special case that $\\gamma$ is constant, we give a (one dimensional) resource augmentation scheme, that is, we obtain a packing into bins of unit width and height $1+\\gamma$ using no more than the number of bins in an optimal packing. Ad"},"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":"1412.4709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-15T18:27:32Z","cross_cats_sorted":[],"title_canon_sha256":"c48fb3e201e4061a15903324efbf9c3a31335d99d699cda73074eeab40cce183","abstract_canon_sha256":"e5b7a88ca1d2e6cea5dfa45b2c1be04d77e90e9c4a896afc849097c6371f8714"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:18.479046Z","signature_b64":"q0r7qbeEXdmrmk1pcEWXAQ4STImtVcj/cF+FAp662PWCpp0c2aENUOFqKntnvY+cGZlNfkEvwXG4fdFwG0SsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a144e4786ef2609d20bbf1e875f4678121fbd2376e6da0a043555eb928111f50","last_reissued_at":"2026-05-18T02:31:18.478551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:18.478551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-Time Approximation Schemes for Circle and Other Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fl\\'avio K. Miyazawa, Lehilton L. C. Pedrosa, Maxim Sviridenko, Rafael C. S. Schouery, Yoshiko Wakabayashi","submitted_at":"2014-12-15T18:27:32Z","abstract_excerpt":"We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augmented bins of height $1+\\gamma$, for some arbitrarily small number $\\gamma > 0$. Our algorithm is polynomial on $\\log 1/\\gamma$, and thus $\\gamma$ is part of the problem input. For the special case that $\\gamma$ is constant, we give a (one dimensional) resource augmentation scheme, that is, we obtain a packing into bins of unit width and height $1+\\gamma$ using no more than the number of bins in an optimal packing. Ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4709","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":"1412.4709","created_at":"2026-05-18T02:31:18.478627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4709v1","created_at":"2026-05-18T02:31:18.478627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4709","created_at":"2026-05-18T02:31:18.478627+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFCOI6DO6JQJ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFCOI6DO6JQJ2IF3","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFCOI6DO","created_at":"2026-05-18T12:28:52.271510+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/UFCOI6DO6JQJ2IF36HUHL5DHQE","json":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE.json","graph_json":"https://pith.science/api/pith-number/UFCOI6DO6JQJ2IF36HUHL5DHQE/graph.json","events_json":"https://pith.science/api/pith-number/UFCOI6DO6JQJ2IF36HUHL5DHQE/events.json","paper":"https://pith.science/paper/UFCOI6DO"},"agent_actions":{"view_html":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE","download_json":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE.json","view_paper":"https://pith.science/paper/UFCOI6DO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4709&json=true","fetch_graph":"https://pith.science/api/pith-number/UFCOI6DO6JQJ2IF36HUHL5DHQE/graph.json","fetch_events":"https://pith.science/api/pith-number/UFCOI6DO6JQJ2IF36HUHL5DHQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/action/storage_attestation","attest_author":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/action/author_attestation","sign_citation":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/action/citation_signature","submit_replication":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/action/replication_record"}},"created_at":"2026-05-18T02:31:18.478627+00:00","updated_at":"2026-05-18T02:31:18.478627+00:00"}