{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1993:UUVC4HX5QHV5S3Q2V76LL247PP","short_pith_number":"pith:UUVC4HX5","schema_version":"1.0","canonical_sha256":"a52a2e1efd81ebd96e1aaffcb5eb9f7beca96fbf60cf9fb45132e79365c9ef44","source":{"kind":"arxiv","id":"math/9301209","version":1},"attestation_state":"computed","paper":{"title":"Borel partitions of infinite subtrees of a perfect tree","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alain Louveau, Boban Veli\\v{c}kovi\\'c, Saharon Shelah","submitted_at":"1993-01-15T00:00:00Z","abstract_excerpt":"A theorem of Galvin asserts that if the unordered pairs of reals are partitioned into finitely many Borel classes then there is a perfect set P such that all pairs from P lie in the same class. The generalization to n-tuples for n >= 3 is false. Let us identify the reals with 2^omega ordered by the lexicographical ordering and define for distinct x,y in 2^omega, D(x,y) to be the least n such that x(n) not= y(n). Let the type of an increasing n-tuple {x_0, ... x_{n-1}}_< be the ordering <^* on {0, ...,n-2} defined by i<^*j iff D(x_i,x_{i+1})< D(x_j,x_{j+1}). Galvin proved that for any Borel col"},"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":"math/9301209","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"1993-01-15T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"ea37261527356fa26ecc2e637470b6b32456eb8c18312930c29bb4e9464b68e6","abstract_canon_sha256":"047fe888b383cc31616a2fb208a2cfc62e4c146fd5c38ba18e2b70878c12064b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:52.379158Z","signature_b64":"V7TQEa7jx3MN2/NGnrx+5a24+lomAkqyez5tX5frsxLQz0Xru78T4LTpbNcUTD6zQPAmVDjkavo7IQCuMDSoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a52a2e1efd81ebd96e1aaffcb5eb9f7beca96fbf60cf9fb45132e79365c9ef44","last_reissued_at":"2026-05-18T01:05:52.378613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:52.378613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Borel partitions of infinite subtrees of a perfect tree","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alain Louveau, Boban Veli\\v{c}kovi\\'c, Saharon Shelah","submitted_at":"1993-01-15T00:00:00Z","abstract_excerpt":"A theorem of Galvin asserts that if the unordered pairs of reals are partitioned into finitely many Borel classes then there is a perfect set P such that all pairs from P lie in the same class. The generalization to n-tuples for n >= 3 is false. Let us identify the reals with 2^omega ordered by the lexicographical ordering and define for distinct x,y in 2^omega, D(x,y) to be the least n such that x(n) not= y(n). Let the type of an increasing n-tuple {x_0, ... x_{n-1}}_< be the ordering <^* on {0, ...,n-2} defined by i<^*j iff D(x_i,x_{i+1})< D(x_j,x_{j+1}). Galvin proved that for any Borel col"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9301209","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":"math/9301209","created_at":"2026-05-18T01:05:52.378702+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9301209v1","created_at":"2026-05-18T01:05:52.378702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9301209","created_at":"2026-05-18T01:05:52.378702+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUVC4HX5QHV5","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUVC4HX5QHV5S3Q2","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUVC4HX5","created_at":"2026-05-18T12:25:47.102015+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/UUVC4HX5QHV5S3Q2V76LL247PP","json":"https://pith.science/pith/UUVC4HX5QHV5S3Q2V76LL247PP.json","graph_json":"https://pith.science/api/pith-number/UUVC4HX5QHV5S3Q2V76LL247PP/graph.json","events_json":"https://pith.science/api/pith-number/UUVC4HX5QHV5S3Q2V76LL247PP/events.json","paper":"https://pith.science/paper/UUVC4HX5"},"agent_actions":{"view_html":"https://pith.science/pith/UUVC4HX5QHV5S3Q2V76LL247PP","download_json":"https://pith.science/pith/UUVC4HX5QHV5S3Q2V76LL247PP.json","view_paper":"https://pith.science/paper/UUVC4HX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9301209&json=true","fetch_graph":"https://pith.science/api/pith-number/UUVC4HX5QHV5S3Q2V76LL247PP/graph.json","fetch_events":"https://pith.science/api/pith-number/UUVC4HX5QHV5S3Q2V76LL247PP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUVC4HX5QHV5S3Q2V76LL247PP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUVC4HX5QHV5S3Q2V76LL247PP/action/storage_attestation","attest_author":"https://pith.science/pith/UUVC4HX5QHV5S3Q2V76LL247PP/action/author_attestation","sign_citation":"https://pith.science/pith/UUVC4HX5QHV5S3Q2V76LL247PP/action/citation_signature","submit_replication":"https://pith.science/pith/UUVC4HX5QHV5S3Q2V76LL247PP/action/replication_record"}},"created_at":"2026-05-18T01:05:52.378702+00:00","updated_at":"2026-05-18T01:05:52.378702+00:00"}