{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G6GWNTWPSJKUQPITI3NIHY3LQF","short_pith_number":"pith:G6GWNTWP","schema_version":"1.0","canonical_sha256":"378d66cecf9255483d1346da83e36b815fb5fc40da81be039e0ec118816f771e","source":{"kind":"arxiv","id":"1407.3496","version":3},"attestation_state":"computed","paper":{"title":"Bratteli diagrams where random orders are imperfect","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Anthony Quas, Jeannette Janssen, Reem Yassawi","submitted_at":"2014-07-13T17:45:13Z","abstract_excerpt":"For the simple Bratteli diagrams B where there is a single edge connecting any two vertices in consecutive levels, we show that a random order has uncountably many infinite paths if and only if the growth rate of the level-n vertex sets is super-linear. This gives us the dichotomy: a random order on a slowly growing Bratteli diagram admits a homeomorphism, while a random order on a quickly growing Bratteli diagram does not. We also show that for a large family of infinite rank Bratteli diagrams, a random order on B does not admit a continuous Vershik map."},"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":"1407.3496","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2014-07-13T17:45:13Z","cross_cats_sorted":[],"title_canon_sha256":"2e3abdd7dd666a96ce27183a7568089b2931123be944f9d356f8f4bb4798bd0d","abstract_canon_sha256":"e2f08886b860b31a9e1fb62d8fd0ceafb3c6c4d83978c7cbfed2df5eb61bda2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:38.202973Z","signature_b64":"8QbsfMgHKYf3EIR42uOrG0JbLKvGxQSJS0OmCEiaTjAB0FW2XLdPglroRqsihNORWciOD9WWgP4iBzSOwQhuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"378d66cecf9255483d1346da83e36b815fb5fc40da81be039e0ec118816f771e","last_reissued_at":"2026-05-18T01:12:38.202573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:38.202573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bratteli diagrams where random orders are imperfect","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Anthony Quas, Jeannette Janssen, Reem Yassawi","submitted_at":"2014-07-13T17:45:13Z","abstract_excerpt":"For the simple Bratteli diagrams B where there is a single edge connecting any two vertices in consecutive levels, we show that a random order has uncountably many infinite paths if and only if the growth rate of the level-n vertex sets is super-linear. This gives us the dichotomy: a random order on a slowly growing Bratteli diagram admits a homeomorphism, while a random order on a quickly growing Bratteli diagram does not. We also show that for a large family of infinite rank Bratteli diagrams, a random order on B does not admit a continuous Vershik map."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3496","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":"1407.3496","created_at":"2026-05-18T01:12:38.202638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3496v3","created_at":"2026-05-18T01:12:38.202638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3496","created_at":"2026-05-18T01:12:38.202638+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6GWNTWPSJKU","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6GWNTWPSJKUQPIT","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6GWNTWP","created_at":"2026-05-18T12:28:28.263976+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/G6GWNTWPSJKUQPITI3NIHY3LQF","json":"https://pith.science/pith/G6GWNTWPSJKUQPITI3NIHY3LQF.json","graph_json":"https://pith.science/api/pith-number/G6GWNTWPSJKUQPITI3NIHY3LQF/graph.json","events_json":"https://pith.science/api/pith-number/G6GWNTWPSJKUQPITI3NIHY3LQF/events.json","paper":"https://pith.science/paper/G6GWNTWP"},"agent_actions":{"view_html":"https://pith.science/pith/G6GWNTWPSJKUQPITI3NIHY3LQF","download_json":"https://pith.science/pith/G6GWNTWPSJKUQPITI3NIHY3LQF.json","view_paper":"https://pith.science/paper/G6GWNTWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3496&json=true","fetch_graph":"https://pith.science/api/pith-number/G6GWNTWPSJKUQPITI3NIHY3LQF/graph.json","fetch_events":"https://pith.science/api/pith-number/G6GWNTWPSJKUQPITI3NIHY3LQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6GWNTWPSJKUQPITI3NIHY3LQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6GWNTWPSJKUQPITI3NIHY3LQF/action/storage_attestation","attest_author":"https://pith.science/pith/G6GWNTWPSJKUQPITI3NIHY3LQF/action/author_attestation","sign_citation":"https://pith.science/pith/G6GWNTWPSJKUQPITI3NIHY3LQF/action/citation_signature","submit_replication":"https://pith.science/pith/G6GWNTWPSJKUQPITI3NIHY3LQF/action/replication_record"}},"created_at":"2026-05-18T01:12:38.202638+00:00","updated_at":"2026-05-18T01:12:38.202638+00:00"}