{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:W6GVMQ4RW5ECBUXXAXXJ5P63AK","short_pith_number":"pith:W6GVMQ4R","schema_version":"1.0","canonical_sha256":"b78d564391b74820d2f705ee9ebfdb029b83e22a83d5611aa8faea3376b4668b","source":{"kind":"arxiv","id":"1505.02299","version":1},"attestation_state":"computed","paper":{"title":"Half-arc-transitive graphs of arbitrary even valency greater than 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arjana \\v{Z}itnik, Marston D.E. Conder","submitted_at":"2015-05-09T18:12:02Z","abstract_excerpt":"A half-arc-transitive graph is a regular graph that is both vertex- and edge-transitive, but is not arc-transitive. If such a graph has finite valency, then its valency is even, and greater than $2$. In 1970, Bouwer proved that there exists a half-arc-transitive graph of every even valency greater than 2, by giving a construction for a family of graphs now known as $B(k,m,n)$, defined for every triple $(k,m,n)$ of integers greater than $1$ with $2^m \\equiv 1 \\mod n$. In each case, $B(k,m,n)$ is a $2k$-valent vertex- and edge-transitive graph of order $mn^{k-1}$, and Bouwer showed that $B(k,6,9"},"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":"1505.02299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T18:12:02Z","cross_cats_sorted":[],"title_canon_sha256":"e720c5ae34115dcecd4d0dcb57e45343b6dff1c516b292b01e3c80c059c3135b","abstract_canon_sha256":"44b10935be754db6867df6a8c8d86ab02e4508f2e455c0064eb26567c324daed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.278641Z","signature_b64":"meozxvD4RtzeIGwcZKtZiyR4Nvt9A78IZb2d4YhI1PQMasT3ArT0dmNFUBJn/yuN+zGsMVHbGKocxwBdf2/FAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b78d564391b74820d2f705ee9ebfdb029b83e22a83d5611aa8faea3376b4668b","last_reissued_at":"2026-05-18T02:16:19.277900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.277900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Half-arc-transitive graphs of arbitrary even valency greater than 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arjana \\v{Z}itnik, Marston D.E. Conder","submitted_at":"2015-05-09T18:12:02Z","abstract_excerpt":"A half-arc-transitive graph is a regular graph that is both vertex- and edge-transitive, but is not arc-transitive. If such a graph has finite valency, then its valency is even, and greater than $2$. In 1970, Bouwer proved that there exists a half-arc-transitive graph of every even valency greater than 2, by giving a construction for a family of graphs now known as $B(k,m,n)$, defined for every triple $(k,m,n)$ of integers greater than $1$ with $2^m \\equiv 1 \\mod n$. In each case, $B(k,m,n)$ is a $2k$-valent vertex- and edge-transitive graph of order $mn^{k-1}$, and Bouwer showed that $B(k,6,9"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02299","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":"1505.02299","created_at":"2026-05-18T02:16:19.278029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02299v1","created_at":"2026-05-18T02:16:19.278029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02299","created_at":"2026-05-18T02:16:19.278029+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6GVMQ4RW5EC","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6GVMQ4RW5ECBUXX","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6GVMQ4R","created_at":"2026-05-18T12:29:47.479230+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/W6GVMQ4RW5ECBUXXAXXJ5P63AK","json":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK.json","graph_json":"https://pith.science/api/pith-number/W6GVMQ4RW5ECBUXXAXXJ5P63AK/graph.json","events_json":"https://pith.science/api/pith-number/W6GVMQ4RW5ECBUXXAXXJ5P63AK/events.json","paper":"https://pith.science/paper/W6GVMQ4R"},"agent_actions":{"view_html":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK","download_json":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK.json","view_paper":"https://pith.science/paper/W6GVMQ4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02299&json=true","fetch_graph":"https://pith.science/api/pith-number/W6GVMQ4RW5ECBUXXAXXJ5P63AK/graph.json","fetch_events":"https://pith.science/api/pith-number/W6GVMQ4RW5ECBUXXAXXJ5P63AK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/action/storage_attestation","attest_author":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/action/author_attestation","sign_citation":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/action/citation_signature","submit_replication":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/action/replication_record"}},"created_at":"2026-05-18T02:16:19.278029+00:00","updated_at":"2026-05-18T02:16:19.278029+00:00"}