{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:URGMIKZICXV3NN72NE5HUOFK6B","short_pith_number":"pith:URGMIKZI","canonical_record":{"source":{"id":"1511.05301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T07:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"2881b6de5eccf4385f8984df5ff978379f5d7ddfd21853ad733810095b40db8e","abstract_canon_sha256":"f7c1ee9953456827e8417667c90b49801b150dee1eca98798bbe9ce05c1a4084"},"schema_version":"1.0"},"canonical_sha256":"a44cc42b2815ebb6b7fa693a7a38aaf05b655077ea4d4d5c63a5e74a2abe246c","source":{"kind":"arxiv","id":"1511.05301","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05301","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05301v1","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05301","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"pith_short_12","alias_value":"URGMIKZICXV3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"URGMIKZICXV3NN72","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"URGMIKZI","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:URGMIKZICXV3NN72NE5HUOFK6B","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T07:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"2881b6de5eccf4385f8984df5ff978379f5d7ddfd21853ad733810095b40db8e","abstract_canon_sha256":"f7c1ee9953456827e8417667c90b49801b150dee1eca98798bbe9ce05c1a4084"},"schema_version":"1.0"},"canonical_sha256":"a44cc42b2815ebb6b7fa693a7a38aaf05b655077ea4d4d5c63a5e74a2abe246c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:49.545801Z","signature_b64":"u4HHfzJVBGVcy+96DssHTvFIBSdQ4vs9fZ2dnvIk53D0hwYwi7pZAhsDim4oKfvUutO/iPseUxTC3c/JZa/fCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a44cc42b2815ebb6b7fa693a7a38aaf05b655077ea4d4d5c63a5e74a2abe246c","last_reissued_at":"2026-05-18T01:26:49.544940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:49.544940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05301","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-18T01:26:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ul6d97zfMdBXVztIkyeIc1L28BHg3dm0iQ0UfYj6TRsmMn0jgo4gxWZTzyXBUvoz/Xv1p5nradFbrZ6roS+rCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:20:56.880926Z"},"content_sha256":"6ff2bf07bfae2d2346efa3a959ca3471808d00e7747ee1656987bc5874697c34","schema_version":"1.0","event_id":"sha256:6ff2bf07bfae2d2346efa3a959ca3471808d00e7747ee1656987bc5874697c34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:URGMIKZICXV3NN72NE5HUOFK6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition of a cube into nearly equal smaller cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amram Meir, Janos Pach, Peter Frankl","submitted_at":"2015-11-17T07:57:58Z","abstract_excerpt":"Let $d$ be a fixed positive integer and let $\\epsilon>0$. It is shown that for every sufficiently large $n\\geq n_0(d,\\epsilon)$, the $d$-dimensional unit cube can be decomposed into exactly $n$ smaller cubes such that the ratio of the side length of the largest cube to the side length of the smallest one is at most $1+\\epsilon$. Moreover, for every $n\\geq n_0$, there is a decomposition with the required properties, using cubes of at most $d+2$ different side lengths. If we drop the condition that the side lengths of the cubes must be roughly equal, it is sufficient to use cubes of two differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05301","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-18T01:26:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+Xtqfba0WhR4z+q7Tg52hJ7aiWFn0b4/an5UPbFGlzSpRgmNn78Q7/bfhTu9gS62td1YCswszwl+Qgcxwt8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:20:56.881517Z"},"content_sha256":"9dc5d97965d4a97440c6d0ced09890f6f56ecc542872ab8adeac39eb857f551e","schema_version":"1.0","event_id":"sha256:9dc5d97965d4a97440c6d0ced09890f6f56ecc542872ab8adeac39eb857f551e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/bundle.json","state_url":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URGMIKZICXV3NN72NE5HUOFK6B/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-24T22:20:56Z","links":{"resolver":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B","bundle":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/bundle.json","state":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URGMIKZICXV3NN72NE5HUOFK6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:URGMIKZICXV3NN72NE5HUOFK6B","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":"f7c1ee9953456827e8417667c90b49801b150dee1eca98798bbe9ce05c1a4084","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T07:57:58Z","title_canon_sha256":"2881b6de5eccf4385f8984df5ff978379f5d7ddfd21853ad733810095b40db8e"},"schema_version":"1.0","source":{"id":"1511.05301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05301","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05301v1","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05301","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"pith_short_12","alias_value":"URGMIKZICXV3","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"URGMIKZICXV3NN72","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"URGMIKZI","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:9dc5d97965d4a97440c6d0ced09890f6f56ecc542872ab8adeac39eb857f551e","target":"graph","created_at":"2026-05-18T01:26:49Z","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":"Let $d$ be a fixed positive integer and let $\\epsilon>0$. It is shown that for every sufficiently large $n\\geq n_0(d,\\epsilon)$, the $d$-dimensional unit cube can be decomposed into exactly $n$ smaller cubes such that the ratio of the side length of the largest cube to the side length of the smallest one is at most $1+\\epsilon$. Moreover, for every $n\\geq n_0$, there is a decomposition with the required properties, using cubes of at most $d+2$ different side lengths. If we drop the condition that the side lengths of the cubes must be roughly equal, it is sufficient to use cubes of two differen","authors_text":"Amram Meir, Janos Pach, Peter Frankl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T07:57:58Z","title":"Decomposition of a cube into nearly equal smaller cubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05301","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:6ff2bf07bfae2d2346efa3a959ca3471808d00e7747ee1656987bc5874697c34","target":"record","created_at":"2026-05-18T01:26:49Z","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":"f7c1ee9953456827e8417667c90b49801b150dee1eca98798bbe9ce05c1a4084","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-17T07:57:58Z","title_canon_sha256":"2881b6de5eccf4385f8984df5ff978379f5d7ddfd21853ad733810095b40db8e"},"schema_version":"1.0","source":{"id":"1511.05301","kind":"arxiv","version":1}},"canonical_sha256":"a44cc42b2815ebb6b7fa693a7a38aaf05b655077ea4d4d5c63a5e74a2abe246c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a44cc42b2815ebb6b7fa693a7a38aaf05b655077ea4d4d5c63a5e74a2abe246c","first_computed_at":"2026-05-18T01:26:49.544940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:49.544940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u4HHfzJVBGVcy+96DssHTvFIBSdQ4vs9fZ2dnvIk53D0hwYwi7pZAhsDim4oKfvUutO/iPseUxTC3c/JZa/fCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:49.545801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ff2bf07bfae2d2346efa3a959ca3471808d00e7747ee1656987bc5874697c34","sha256:9dc5d97965d4a97440c6d0ced09890f6f56ecc542872ab8adeac39eb857f551e"],"state_sha256":"55a4db099c41c589aacefb1b23c2c868d64f1f99a858b72e0d391aab6ed3f4da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FmN0/07HGcYIrw7h4TOz+fLMNWW1MBIZcc4mqusYqvWDBt5a31J81e0wc/nTanc3sYim8RUU1VJXOeYTx+16BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T22:20:56.884551Z","bundle_sha256":"d51220917ec208774a07cdd7e71289bba4cfab2bb23b1202218475fccb41ace9"}}