{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MZEPLAS7L7GZLJ66BA432A6L2U","short_pith_number":"pith:MZEPLAS7","schema_version":"1.0","canonical_sha256":"6648f5825f5fcd95a7de0839bd03cbd528c2aac2ede7eac7aefda5d74647d3af","source":{"kind":"arxiv","id":"1401.5583","version":1},"attestation_state":"computed","paper":{"title":"Improved Online Square-into-Square Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Brian Brubach","submitted_at":"2014-01-22T07:52:52Z","abstract_excerpt":"In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This two-dimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area $\\alpha$ such that any set of squares with total area $\\alpha$ can be packed. We show an algorithm that can pack any set of squares with total area $\\alpha \\leq 3/8$ into a unit square in an online setting, improving the previous bound of $11/32$."},"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":"1401.5583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-22T07:52:52Z","cross_cats_sorted":[],"title_canon_sha256":"3cc35c62c2b6a1a06a445853b73c2958e63054d0ea0ff2e513376bc4e2ddc0ae","abstract_canon_sha256":"38bd41a8c4abd6c4955e362e27d13d84fb3d33805f1923f7dde6ba580b6b2495"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:25.875075Z","signature_b64":"UlC7x1nd7Wkt7IcFl/wQzUziLNKGnBAlweR6S+jxPHQ1El8WoAcw9T+93AqiOez8eljfZ0N1YXR43r23RuBaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6648f5825f5fcd95a7de0839bd03cbd528c2aac2ede7eac7aefda5d74647d3af","last_reissued_at":"2026-05-18T03:01:25.874477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:25.874477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Online Square-into-Square Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Brian Brubach","submitted_at":"2014-01-22T07:52:52Z","abstract_excerpt":"In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This two-dimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area $\\alpha$ such that any set of squares with total area $\\alpha$ can be packed. We show an algorithm that can pack any set of squares with total area $\\alpha \\leq 3/8$ into a unit square in an online setting, improving the previous bound of $11/32$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5583","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":"1401.5583","created_at":"2026-05-18T03:01:25.874570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5583v1","created_at":"2026-05-18T03:01:25.874570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5583","created_at":"2026-05-18T03:01:25.874570+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZEPLAS7L7GZ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZEPLAS7L7GZLJ66","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZEPLAS7","created_at":"2026-05-18T12:28:41.024544+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/MZEPLAS7L7GZLJ66BA432A6L2U","json":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U.json","graph_json":"https://pith.science/api/pith-number/MZEPLAS7L7GZLJ66BA432A6L2U/graph.json","events_json":"https://pith.science/api/pith-number/MZEPLAS7L7GZLJ66BA432A6L2U/events.json","paper":"https://pith.science/paper/MZEPLAS7"},"agent_actions":{"view_html":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U","download_json":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U.json","view_paper":"https://pith.science/paper/MZEPLAS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5583&json=true","fetch_graph":"https://pith.science/api/pith-number/MZEPLAS7L7GZLJ66BA432A6L2U/graph.json","fetch_events":"https://pith.science/api/pith-number/MZEPLAS7L7GZLJ66BA432A6L2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/action/storage_attestation","attest_author":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/action/author_attestation","sign_citation":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/action/citation_signature","submit_replication":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/action/replication_record"}},"created_at":"2026-05-18T03:01:25.874570+00:00","updated_at":"2026-05-18T03:01:25.874570+00:00"}