{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MZEPLAS7L7GZLJ66BA432A6L2U","short_pith_number":"pith:MZEPLAS7","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"},"canonical_sha256":"6648f5825f5fcd95a7de0839bd03cbd528c2aac2ede7eac7aefda5d74647d3af","source":{"kind":"arxiv","id":"1401.5583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5583","created_at":"2026-05-18T03:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5583v1","created_at":"2026-05-18T03:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5583","created_at":"2026-05-18T03:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"MZEPLAS7L7GZ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"MZEPLAS7L7GZLJ66","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"MZEPLAS7","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MZEPLAS7L7GZLJ66BA432A6L2U","target":"record","payload":{"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"},"canonical_sha256":"6648f5825f5fcd95a7de0839bd03cbd528c2aac2ede7eac7aefda5d74647d3af","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"},"source_kind":"arxiv","source_id":"1401.5583","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-18T03:01:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPqPtfMzR8G5J4SyX9uxL7QJ/ZEwK51/ET+wWcC3tRUSSeHy8EuN5nJKPdI6rqBkgD6+j4RySwGAjbaURqBcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:14:07.916542Z"},"content_sha256":"832fea85f357425733fec9b6dbf3581ddd61f69c956b638d33222f8cb50214ce","schema_version":"1.0","event_id":"sha256:832fea85f357425733fec9b6dbf3581ddd61f69c956b638d33222f8cb50214ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MZEPLAS7L7GZLJ66BA432A6L2U","target":"graph","payload":{"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"},"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-18T03:01:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzJdq29q43syp4ZFsLngypPIn2Yl9lF/PjBrKMWROECBmvHE/v6ifTPQ0DJ2a0dQCQW92zsLwoY7UIzkeOH0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:14:07.916892Z"},"content_sha256":"50c4872990e04293768db498c87d613d8c5e6e7bd0e985f1e9e3844694cd1ef4","schema_version":"1.0","event_id":"sha256:50c4872990e04293768db498c87d613d8c5e6e7bd0e985f1e9e3844694cd1ef4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/bundle.json","state_url":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZEPLAS7L7GZLJ66BA432A6L2U/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-28T01:14:07Z","links":{"resolver":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U","bundle":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/bundle.json","state":"https://pith.science/pith/MZEPLAS7L7GZLJ66BA432A6L2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZEPLAS7L7GZLJ66BA432A6L2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MZEPLAS7L7GZLJ66BA432A6L2U","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":"38bd41a8c4abd6c4955e362e27d13d84fb3d33805f1923f7dde6ba580b6b2495","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-22T07:52:52Z","title_canon_sha256":"3cc35c62c2b6a1a06a445853b73c2958e63054d0ea0ff2e513376bc4e2ddc0ae"},"schema_version":"1.0","source":{"id":"1401.5583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5583","created_at":"2026-05-18T03:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5583v1","created_at":"2026-05-18T03:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5583","created_at":"2026-05-18T03:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"MZEPLAS7L7GZ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"MZEPLAS7L7GZLJ66","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"MZEPLAS7","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:50c4872990e04293768db498c87d613d8c5e6e7bd0e985f1e9e3844694cd1ef4","target":"graph","created_at":"2026-05-18T03:01:25Z","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":"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$.","authors_text":"Brian Brubach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-22T07:52:52Z","title":"Improved Online Square-into-Square Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5583","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:832fea85f357425733fec9b6dbf3581ddd61f69c956b638d33222f8cb50214ce","target":"record","created_at":"2026-05-18T03:01:25Z","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":"38bd41a8c4abd6c4955e362e27d13d84fb3d33805f1923f7dde6ba580b6b2495","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-22T07:52:52Z","title_canon_sha256":"3cc35c62c2b6a1a06a445853b73c2958e63054d0ea0ff2e513376bc4e2ddc0ae"},"schema_version":"1.0","source":{"id":"1401.5583","kind":"arxiv","version":1}},"canonical_sha256":"6648f5825f5fcd95a7de0839bd03cbd528c2aac2ede7eac7aefda5d74647d3af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6648f5825f5fcd95a7de0839bd03cbd528c2aac2ede7eac7aefda5d74647d3af","first_computed_at":"2026-05-18T03:01:25.874477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:25.874477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlC7x1nd7Wkt7IcFl/wQzUziLNKGnBAlweR6S+jxPHQ1El8WoAcw9T+93AqiOez8eljfZ0N1YXR43r23RuBaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:25.875075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:832fea85f357425733fec9b6dbf3581ddd61f69c956b638d33222f8cb50214ce","sha256:50c4872990e04293768db498c87d613d8c5e6e7bd0e985f1e9e3844694cd1ef4"],"state_sha256":"25748fccb6dd5d767de72e65b944dea54f98c55108fd861d3e16b49ae3bb66fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pr0q5bF06zFe5/FG7+szSOl7y1YD8CnKDBo+PD9OZSGpdjyqEmoK7j46+gL2XT7HymBtvz7JGHMf26Q7W8gfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:14:07.918957Z","bundle_sha256":"cddc5c35aadc56c758c85b35bf4aff3505d1d8cb51efcc34fb3e411f5fd311c2"}}