{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:URGMIKZICXV3NN72NE5HUOFK6B","short_pith_number":"pith:URGMIKZI","schema_version":"1.0","canonical_sha256":"a44cc42b2815ebb6b7fa693a7a38aaf05b655077ea4d4d5c63a5e74a2abe246c","source":{"kind":"arxiv","id":"1511.05301","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.05301","created_at":"2026-05-18T01:26:49.545040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05301v1","created_at":"2026-05-18T01:26:49.545040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05301","created_at":"2026-05-18T01:26:49.545040+00:00"},{"alias_kind":"pith_short_12","alias_value":"URGMIKZICXV3","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"URGMIKZICXV3NN72","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"URGMIKZI","created_at":"2026-05-18T12:29:44.643036+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/URGMIKZICXV3NN72NE5HUOFK6B","json":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B.json","graph_json":"https://pith.science/api/pith-number/URGMIKZICXV3NN72NE5HUOFK6B/graph.json","events_json":"https://pith.science/api/pith-number/URGMIKZICXV3NN72NE5HUOFK6B/events.json","paper":"https://pith.science/paper/URGMIKZI"},"agent_actions":{"view_html":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B","download_json":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B.json","view_paper":"https://pith.science/paper/URGMIKZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05301&json=true","fetch_graph":"https://pith.science/api/pith-number/URGMIKZICXV3NN72NE5HUOFK6B/graph.json","fetch_events":"https://pith.science/api/pith-number/URGMIKZICXV3NN72NE5HUOFK6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/action/storage_attestation","attest_author":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/action/author_attestation","sign_citation":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/action/citation_signature","submit_replication":"https://pith.science/pith/URGMIKZICXV3NN72NE5HUOFK6B/action/replication_record"}},"created_at":"2026-05-18T01:26:49.545040+00:00","updated_at":"2026-05-18T01:26:49.545040+00:00"}