{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VKKXNJVPXSXNMPRVUIKN2SG6K2","short_pith_number":"pith:VKKXNJVP","schema_version":"1.0","canonical_sha256":"aa9576a6afbcaed63e35a214dd48de5697928ac5c3cfd75d9568971e43e33a81","source":{"kind":"arxiv","id":"1210.5228","version":3},"attestation_state":"computed","paper":{"title":"Rudolph's Two-Step Coding Theorem and Alpern's Lemma for R^d Actions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Anthony Quas, Ayse Sahin, Bryna Kra","submitted_at":"2012-10-18T19:26:26Z","abstract_excerpt":"Rudolph showed that the orbits of any measurable, measure preserving $\\mathbb R^d$ action can be measurably tiled by $2^d$ rectangles and asked if this number of tiles is optimal for $d>1$. In this paper, using a tiling of $\\mathbb R^d$ by notched cubes, we show that $d+1$ tiles suffice. Furthermore, using a detailed analysis of the set of invariant measures on tilings of $\\mathbb R^2$ by two rectangles, we show that while for $\\mathbb R^2$ actions with completely positive entropy this bound is optimal there exist mixing $\\mathbb R^2$ actions whose orbits can be tiled by 2 tiles."},"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":"1210.5228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-10-18T19:26:26Z","cross_cats_sorted":[],"title_canon_sha256":"4d1ec643d04e4bdebd2a76786de17e678ca9ba7132291851d79e709f74631ffb","abstract_canon_sha256":"affdc7586cd5906d1614e25944798d9eb64eab21c7f6b671c7ce322e9b9479a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:14.505593Z","signature_b64":"oP8H4qF1F6zbK2s/pbzEqI7EwDJZwrvOAadSrNc5/hSrGpDj6rRYnNQELBQgyEkgdlrI6/fAwYubnDD7V8+BDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa9576a6afbcaed63e35a214dd48de5697928ac5c3cfd75d9568971e43e33a81","last_reissued_at":"2026-05-18T02:52:14.504878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:14.504878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rudolph's Two-Step Coding Theorem and Alpern's Lemma for R^d Actions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Anthony Quas, Ayse Sahin, Bryna Kra","submitted_at":"2012-10-18T19:26:26Z","abstract_excerpt":"Rudolph showed that the orbits of any measurable, measure preserving $\\mathbb R^d$ action can be measurably tiled by $2^d$ rectangles and asked if this number of tiles is optimal for $d>1$. In this paper, using a tiling of $\\mathbb R^d$ by notched cubes, we show that $d+1$ tiles suffice. Furthermore, using a detailed analysis of the set of invariant measures on tilings of $\\mathbb R^2$ by two rectangles, we show that while for $\\mathbb R^2$ actions with completely positive entropy this bound is optimal there exist mixing $\\mathbb R^2$ actions whose orbits can be tiled by 2 tiles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5228","kind":"arxiv","version":3},"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":"1210.5228","created_at":"2026-05-18T02:52:14.504990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5228v3","created_at":"2026-05-18T02:52:14.504990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5228","created_at":"2026-05-18T02:52:14.504990+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKKXNJVPXSXN","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKKXNJVPXSXNMPRV","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKKXNJVP","created_at":"2026-05-18T12:27:25.539911+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/VKKXNJVPXSXNMPRVUIKN2SG6K2","json":"https://pith.science/pith/VKKXNJVPXSXNMPRVUIKN2SG6K2.json","graph_json":"https://pith.science/api/pith-number/VKKXNJVPXSXNMPRVUIKN2SG6K2/graph.json","events_json":"https://pith.science/api/pith-number/VKKXNJVPXSXNMPRVUIKN2SG6K2/events.json","paper":"https://pith.science/paper/VKKXNJVP"},"agent_actions":{"view_html":"https://pith.science/pith/VKKXNJVPXSXNMPRVUIKN2SG6K2","download_json":"https://pith.science/pith/VKKXNJVPXSXNMPRVUIKN2SG6K2.json","view_paper":"https://pith.science/paper/VKKXNJVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5228&json=true","fetch_graph":"https://pith.science/api/pith-number/VKKXNJVPXSXNMPRVUIKN2SG6K2/graph.json","fetch_events":"https://pith.science/api/pith-number/VKKXNJVPXSXNMPRVUIKN2SG6K2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKKXNJVPXSXNMPRVUIKN2SG6K2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKKXNJVPXSXNMPRVUIKN2SG6K2/action/storage_attestation","attest_author":"https://pith.science/pith/VKKXNJVPXSXNMPRVUIKN2SG6K2/action/author_attestation","sign_citation":"https://pith.science/pith/VKKXNJVPXSXNMPRVUIKN2SG6K2/action/citation_signature","submit_replication":"https://pith.science/pith/VKKXNJVPXSXNMPRVUIKN2SG6K2/action/replication_record"}},"created_at":"2026-05-18T02:52:14.504990+00:00","updated_at":"2026-05-18T02:52:14.504990+00:00"}