{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XR643PSVOZYTDAVKLLZWVFLKON","short_pith_number":"pith:XR643PSV","schema_version":"1.0","canonical_sha256":"bc7dcdbe5576713182aa5af36a956a7365fade84305c197c08565408bf9242df","source":{"kind":"arxiv","id":"1301.3484","version":3},"attestation_state":"computed","paper":{"title":"Asymptotic dimension, decomposition complexity, and Haver's property C","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.MG","authors_text":"Alexander Dranishnikov, Michael Zarichnyi","submitted_at":"2013-01-15T20:47:35Z","abstract_excerpt":"The notion of the decomposition complexity was introduced in \\cite{GTY} using a game theoretical approach. We introduce a notion of straight decomposition complexity and compare it with the original as well with the asymptotic property C. Then we define a game theoretical analog of Haver's property C in the classical dimension theory and compare it with the original."},"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":"1301.3484","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-01-15T20:47:35Z","cross_cats_sorted":["math.GN"],"title_canon_sha256":"d23a5027f6ed93bf717b6893554b1e4bda73cc2faa83c717619894b32af9f025","abstract_canon_sha256":"b7610af8a429550a7fc22a0d8a3814980a4a42a27415d1cd18f30e7897e271b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:21.469131Z","signature_b64":"RkEr77xQsS9ZQiWHysyeDwh/sNFmKAAikW2W+vsp/nXDdcKxdx7QBqKDUDb1RN/qM4qg8jefHmiEp/a5OK4ODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7dcdbe5576713182aa5af36a956a7365fade84305c197c08565408bf9242df","last_reissued_at":"2026-05-18T00:47:21.468532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:21.468532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic dimension, decomposition complexity, and Haver's property C","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.MG","authors_text":"Alexander Dranishnikov, Michael Zarichnyi","submitted_at":"2013-01-15T20:47:35Z","abstract_excerpt":"The notion of the decomposition complexity was introduced in \\cite{GTY} using a game theoretical approach. We introduce a notion of straight decomposition complexity and compare it with the original as well with the asymptotic property C. Then we define a game theoretical analog of Haver's property C in the classical dimension theory and compare it with the original."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3484","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":"1301.3484","created_at":"2026-05-18T00:47:21.468626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3484v3","created_at":"2026-05-18T00:47:21.468626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3484","created_at":"2026-05-18T00:47:21.468626+00:00"},{"alias_kind":"pith_short_12","alias_value":"XR643PSVOZYT","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XR643PSVOZYTDAVK","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XR643PSV","created_at":"2026-05-18T12:28:06.772260+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/XR643PSVOZYTDAVKLLZWVFLKON","json":"https://pith.science/pith/XR643PSVOZYTDAVKLLZWVFLKON.json","graph_json":"https://pith.science/api/pith-number/XR643PSVOZYTDAVKLLZWVFLKON/graph.json","events_json":"https://pith.science/api/pith-number/XR643PSVOZYTDAVKLLZWVFLKON/events.json","paper":"https://pith.science/paper/XR643PSV"},"agent_actions":{"view_html":"https://pith.science/pith/XR643PSVOZYTDAVKLLZWVFLKON","download_json":"https://pith.science/pith/XR643PSVOZYTDAVKLLZWVFLKON.json","view_paper":"https://pith.science/paper/XR643PSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3484&json=true","fetch_graph":"https://pith.science/api/pith-number/XR643PSVOZYTDAVKLLZWVFLKON/graph.json","fetch_events":"https://pith.science/api/pith-number/XR643PSVOZYTDAVKLLZWVFLKON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XR643PSVOZYTDAVKLLZWVFLKON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XR643PSVOZYTDAVKLLZWVFLKON/action/storage_attestation","attest_author":"https://pith.science/pith/XR643PSVOZYTDAVKLLZWVFLKON/action/author_attestation","sign_citation":"https://pith.science/pith/XR643PSVOZYTDAVKLLZWVFLKON/action/citation_signature","submit_replication":"https://pith.science/pith/XR643PSVOZYTDAVKLLZWVFLKON/action/replication_record"}},"created_at":"2026-05-18T00:47:21.468626+00:00","updated_at":"2026-05-18T00:47:21.468626+00:00"}