{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UFCOI6DO6JQJ2IF36HUHL5DHQE","short_pith_number":"pith:UFCOI6DO","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"},"canonical_sha256":"a144e4786ef2609d20bbf1e875f4678121fbd2376e6da0a043555eb928111f50","source":{"kind":"arxiv","id":"1412.4709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4709","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4709v1","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4709","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"UFCOI6DO6JQJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UFCOI6DO6JQJ2IF3","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UFCOI6DO","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UFCOI6DO6JQJ2IF36HUHL5DHQE","target":"record","payload":{"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"},"canonical_sha256":"a144e4786ef2609d20bbf1e875f4678121fbd2376e6da0a043555eb928111f50","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"},"source_kind":"arxiv","source_id":"1412.4709","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIQIh+gJAYcY9GI6dWnttLBmuvylrDBmxGM3ATDXj9Ov26+UY6FF9C5lB7sOpAe9CxA+unrQETzlATGa+xobCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:16:42.526458Z"},"content_sha256":"4743a6089627f8b6a871121987aa47ccfadc450d11246199e918af988f3b78e9","schema_version":"1.0","event_id":"sha256:4743a6089627f8b6a871121987aa47ccfadc450d11246199e918af988f3b78e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UFCOI6DO6JQJ2IF36HUHL5DHQE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++vyHzJ8oYzD/bX3goWaoiPf+/sexGh8PJOvwk/uw6S9GdJ8/YfFHXM+jAFt/1Rp4HVAyFoCMvS+z7TXORVVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:16:42.527161Z"},"content_sha256":"a490926c9f608bf81cb4060f9e309dcf9ea7246dca652ffc52ae6da7ac4c727a","schema_version":"1.0","event_id":"sha256:a490926c9f608bf81cb4060f9e309dcf9ea7246dca652ffc52ae6da7ac4c727a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/bundle.json","state_url":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T16:16:42Z","links":{"resolver":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE","bundle":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/bundle.json","state":"https://pith.science/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFCOI6DO6JQJ2IF36HUHL5DHQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UFCOI6DO6JQJ2IF36HUHL5DHQE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e5b7a88ca1d2e6cea5dfa45b2c1be04d77e90e9c4a896afc849097c6371f8714","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-15T18:27:32Z","title_canon_sha256":"c48fb3e201e4061a15903324efbf9c3a31335d99d699cda73074eeab40cce183"},"schema_version":"1.0","source":{"id":"1412.4709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4709","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4709v1","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4709","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"UFCOI6DO6JQJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UFCOI6DO6JQJ2IF3","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UFCOI6DO","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:a490926c9f608bf81cb4060f9e309dcf9ea7246dca652ffc52ae6da7ac4c727a","target":"graph","created_at":"2026-05-18T02:31:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fl\\'avio K. Miyazawa, Lehilton L. C. Pedrosa, Maxim Sviridenko, Rafael C. S. Schouery, Yoshiko Wakabayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-15T18:27:32Z","title":"Polynomial-Time Approximation Schemes for Circle and Other Packing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4709","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4743a6089627f8b6a871121987aa47ccfadc450d11246199e918af988f3b78e9","target":"record","created_at":"2026-05-18T02:31:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e5b7a88ca1d2e6cea5dfa45b2c1be04d77e90e9c4a896afc849097c6371f8714","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-15T18:27:32Z","title_canon_sha256":"c48fb3e201e4061a15903324efbf9c3a31335d99d699cda73074eeab40cce183"},"schema_version":"1.0","source":{"id":"1412.4709","kind":"arxiv","version":1}},"canonical_sha256":"a144e4786ef2609d20bbf1e875f4678121fbd2376e6da0a043555eb928111f50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a144e4786ef2609d20bbf1e875f4678121fbd2376e6da0a043555eb928111f50","first_computed_at":"2026-05-18T02:31:18.478551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:18.478551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q0r7qbeEXdmrmk1pcEWXAQ4STImtVcj/cF+FAp662PWCpp0c2aENUOFqKntnvY+cGZlNfkEvwXG4fdFwG0SsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:18.479046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4743a6089627f8b6a871121987aa47ccfadc450d11246199e918af988f3b78e9","sha256:a490926c9f608bf81cb4060f9e309dcf9ea7246dca652ffc52ae6da7ac4c727a"],"state_sha256":"6f587fe5e3bac5be4ccb742f9d382f0efd1a914b913fb056d96fd1f4aa87c2e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gbQWpq5tSKn4mPbZcFoev4NPziTAHn2eSqJihz0HZnqzvvWvOmOHO6Cz0tAlDGpkfmwY2W18sgqV7wIUjK2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T16:16:42.530290Z","bundle_sha256":"c6e93234aa93f6f6cd1e724801a10808d017b73f98906c0739d140c62c52a2b8"}}