{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:DS6ZOEL5DMGANHUQBTZEQUDGZL","short_pith_number":"pith:DS6ZOEL5","schema_version":"1.0","canonical_sha256":"1cbd97117d1b0c069e900cf2485066cad97967f868a9e6c5e4403f009d410d93","source":{"kind":"arxiv","id":"math/0507519","version":1},"attestation_state":"computed","paper":{"title":"n-localization property","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Andrzej Roslanowski","submitted_at":"2005-07-25T22:28:32Z","abstract_excerpt":"Let n be an integer greater than 1. A tree T is an n-ary tree provided that every node in T has at most n immediate successors. A forcing notion P has the n-localization property if every function from omega to omega in an extension via P is an omega-branch in an n-ary tree from the ground model.\n  In the present paper we are interested in getting the n-localization property for countable support iterations."},"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/0507519","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"2005-07-25T22:28:32Z","cross_cats_sorted":[],"title_canon_sha256":"c4403de6f101014791537fe83d87d7708553c0acb5a055aac2f9f6df344cf902","abstract_canon_sha256":"b63f205ac9b6d74065fd09cbbb533e3e2e39c0d668ea5898cea8bb6ca54fdff4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:19.390496Z","signature_b64":"EDkwsQt2RUpJ45WSoDqY3hw2CdGzADNpgbChxXR8sgi/qYIz5/F6qiwPiyPxGb8fDGzo18XYmmpN5XxLPx0uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cbd97117d1b0c069e900cf2485066cad97967f868a9e6c5e4403f009d410d93","last_reissued_at":"2026-05-18T03:37:19.390060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:19.390060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"n-localization property","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Andrzej Roslanowski","submitted_at":"2005-07-25T22:28:32Z","abstract_excerpt":"Let n be an integer greater than 1. A tree T is an n-ary tree provided that every node in T has at most n immediate successors. A forcing notion P has the n-localization property if every function from omega to omega in an extension via P is an omega-branch in an n-ary tree from the ground model.\n  In the present paper we are interested in getting the n-localization property for countable support iterations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0507519","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/0507519","created_at":"2026-05-18T03:37:19.390122+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0507519v1","created_at":"2026-05-18T03:37:19.390122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0507519","created_at":"2026-05-18T03:37:19.390122+00:00"},{"alias_kind":"pith_short_12","alias_value":"DS6ZOEL5DMGA","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"DS6ZOEL5DMGANHUQ","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"DS6ZOEL5","created_at":"2026-05-18T12:25:53.335082+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/DS6ZOEL5DMGANHUQBTZEQUDGZL","json":"https://pith.science/pith/DS6ZOEL5DMGANHUQBTZEQUDGZL.json","graph_json":"https://pith.science/api/pith-number/DS6ZOEL5DMGANHUQBTZEQUDGZL/graph.json","events_json":"https://pith.science/api/pith-number/DS6ZOEL5DMGANHUQBTZEQUDGZL/events.json","paper":"https://pith.science/paper/DS6ZOEL5"},"agent_actions":{"view_html":"https://pith.science/pith/DS6ZOEL5DMGANHUQBTZEQUDGZL","download_json":"https://pith.science/pith/DS6ZOEL5DMGANHUQBTZEQUDGZL.json","view_paper":"https://pith.science/paper/DS6ZOEL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0507519&json=true","fetch_graph":"https://pith.science/api/pith-number/DS6ZOEL5DMGANHUQBTZEQUDGZL/graph.json","fetch_events":"https://pith.science/api/pith-number/DS6ZOEL5DMGANHUQBTZEQUDGZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DS6ZOEL5DMGANHUQBTZEQUDGZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DS6ZOEL5DMGANHUQBTZEQUDGZL/action/storage_attestation","attest_author":"https://pith.science/pith/DS6ZOEL5DMGANHUQBTZEQUDGZL/action/author_attestation","sign_citation":"https://pith.science/pith/DS6ZOEL5DMGANHUQBTZEQUDGZL/action/citation_signature","submit_replication":"https://pith.science/pith/DS6ZOEL5DMGANHUQBTZEQUDGZL/action/replication_record"}},"created_at":"2026-05-18T03:37:19.390122+00:00","updated_at":"2026-05-18T03:37:19.390122+00:00"}