{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:D2U5QHUYERRCJDUDDXHUXPPWXS","short_pith_number":"pith:D2U5QHUY","schema_version":"1.0","canonical_sha256":"1ea9d81e982462248e831dcf4bbdf6bc8e6ba0dbf871a3893179171d6c7d5cff","source":{"kind":"arxiv","id":"1110.2945","version":2},"attestation_state":"computed","paper":{"title":"Highly arc-transitive digraphs -- counterexamples and structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Matt DeVos, Robert \\v{S}\\'amal","submitted_at":"2011-10-13T13:56:40Z","abstract_excerpt":"We resolve two problems of [Cameron, Praeger, and Wormald -- Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal reachability relation. Second, we provide constructions of 2-ended highly arc transitive digraphs where each `building block' is a finite bipartite graph that is not a disjoint union of complete bipartite graphs. This was conjectured impossible in the above paper. We also describe the structure of 2-ended highly arc transitive digraphs in more generality, altho"},"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":"1110.2945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T13:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"b15fa0d6f6d6230e6e7b1547a0bcf128145b8d3dc51dba94c88818e09cb25b06","abstract_canon_sha256":"5674c46718d85909659fdefd076b71891c1aca62ae7292fa0bcc22c1d6375f11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:46.102400Z","signature_b64":"YtU75ndENrVdSsBWBmbP0nNqB0imu3FpofUN2Z60ycuagg/SfvOhZ3J5iIjNT2tRogMyKXS15dxjFyb9DY60Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea9d81e982462248e831dcf4bbdf6bc8e6ba0dbf871a3893179171d6c7d5cff","last_reissued_at":"2026-05-18T03:10:46.101761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:46.101761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Highly arc-transitive digraphs -- counterexamples and structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Matt DeVos, Robert \\v{S}\\'amal","submitted_at":"2011-10-13T13:56:40Z","abstract_excerpt":"We resolve two problems of [Cameron, Praeger, and Wormald -- Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal reachability relation. Second, we provide constructions of 2-ended highly arc transitive digraphs where each `building block' is a finite bipartite graph that is not a disjoint union of complete bipartite graphs. This was conjectured impossible in the above paper. We also describe the structure of 2-ended highly arc transitive digraphs in more generality, altho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2945","kind":"arxiv","version":2},"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":"1110.2945","created_at":"2026-05-18T03:10:46.101857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2945v2","created_at":"2026-05-18T03:10:46.101857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2945","created_at":"2026-05-18T03:10:46.101857+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2U5QHUYERRC","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2U5QHUYERRCJDUD","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2U5QHUY","created_at":"2026-05-18T12:26:26.731475+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/D2U5QHUYERRCJDUDDXHUXPPWXS","json":"https://pith.science/pith/D2U5QHUYERRCJDUDDXHUXPPWXS.json","graph_json":"https://pith.science/api/pith-number/D2U5QHUYERRCJDUDDXHUXPPWXS/graph.json","events_json":"https://pith.science/api/pith-number/D2U5QHUYERRCJDUDDXHUXPPWXS/events.json","paper":"https://pith.science/paper/D2U5QHUY"},"agent_actions":{"view_html":"https://pith.science/pith/D2U5QHUYERRCJDUDDXHUXPPWXS","download_json":"https://pith.science/pith/D2U5QHUYERRCJDUDDXHUXPPWXS.json","view_paper":"https://pith.science/paper/D2U5QHUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2945&json=true","fetch_graph":"https://pith.science/api/pith-number/D2U5QHUYERRCJDUDDXHUXPPWXS/graph.json","fetch_events":"https://pith.science/api/pith-number/D2U5QHUYERRCJDUDDXHUXPPWXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2U5QHUYERRCJDUDDXHUXPPWXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2U5QHUYERRCJDUDDXHUXPPWXS/action/storage_attestation","attest_author":"https://pith.science/pith/D2U5QHUYERRCJDUDDXHUXPPWXS/action/author_attestation","sign_citation":"https://pith.science/pith/D2U5QHUYERRCJDUDDXHUXPPWXS/action/citation_signature","submit_replication":"https://pith.science/pith/D2U5QHUYERRCJDUDDXHUXPPWXS/action/replication_record"}},"created_at":"2026-05-18T03:10:46.101857+00:00","updated_at":"2026-05-18T03:10:46.101857+00:00"}