{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W6GVMQ4RW5ECBUXXAXXJ5P63AK","short_pith_number":"pith:W6GVMQ4R","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"},"canonical_sha256":"b78d564391b74820d2f705ee9ebfdb029b83e22a83d5611aa8faea3376b4668b","source":{"kind":"arxiv","id":"1505.02299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02299","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02299v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02299","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"W6GVMQ4RW5EC","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W6GVMQ4RW5ECBUXX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W6GVMQ4R","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W6GVMQ4RW5ECBUXXAXXJ5P63AK","target":"record","payload":{"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"},"canonical_sha256":"b78d564391b74820d2f705ee9ebfdb029b83e22a83d5611aa8faea3376b4668b","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"},"source_kind":"arxiv","source_id":"1505.02299","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFw2YfUF37yoc+YUlWucea/HfVf8OhEDzocD8B69HKY5HCztjwCMojQDun1wfPyoWQnvMBDT+vFqSMOJet4/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:05:56.988645Z"},"content_sha256":"50fd20ce0ab9950967eb7ff3fbd9619ab4d2a2fc08654e7ff2f37bb646809fa9","schema_version":"1.0","event_id":"sha256:50fd20ce0ab9950967eb7ff3fbd9619ab4d2a2fc08654e7ff2f37bb646809fa9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W6GVMQ4RW5ECBUXXAXXJ5P63AK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDm2pABlzQamSHP38hRAZVj8bwkiBUPD52x5Am4SYIORBk/JZey/wdIB4VvzcAJSsfjb+FrApMoOHH3QWTlXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:05:56.988992Z"},"content_sha256":"5b76a2b7908e678a6ff39ef0d66a587f963ed662278e68b118e3822e4384f13b","schema_version":"1.0","event_id":"sha256:5b76a2b7908e678a6ff39ef0d66a587f963ed662278e68b118e3822e4384f13b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/bundle.json","state_url":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T03:05:56Z","links":{"resolver":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK","bundle":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/bundle.json","state":"https://pith.science/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6GVMQ4RW5ECBUXXAXXJ5P63AK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W6GVMQ4RW5ECBUXXAXXJ5P63AK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"44b10935be754db6867df6a8c8d86ab02e4508f2e455c0064eb26567c324daed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T18:12:02Z","title_canon_sha256":"e720c5ae34115dcecd4d0dcb57e45343b6dff1c516b292b01e3c80c059c3135b"},"schema_version":"1.0","source":{"id":"1505.02299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02299","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02299v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02299","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"W6GVMQ4RW5EC","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W6GVMQ4RW5ECBUXX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W6GVMQ4R","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:5b76a2b7908e678a6ff39ef0d66a587f963ed662278e68b118e3822e4384f13b","target":"graph","created_at":"2026-05-18T02:16:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Arjana \\v{Z}itnik, Marston D.E. Conder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T18:12:02Z","title":"Half-arc-transitive graphs of arbitrary even valency greater than 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02299","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:50fd20ce0ab9950967eb7ff3fbd9619ab4d2a2fc08654e7ff2f37bb646809fa9","target":"record","created_at":"2026-05-18T02:16:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"44b10935be754db6867df6a8c8d86ab02e4508f2e455c0064eb26567c324daed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T18:12:02Z","title_canon_sha256":"e720c5ae34115dcecd4d0dcb57e45343b6dff1c516b292b01e3c80c059c3135b"},"schema_version":"1.0","source":{"id":"1505.02299","kind":"arxiv","version":1}},"canonical_sha256":"b78d564391b74820d2f705ee9ebfdb029b83e22a83d5611aa8faea3376b4668b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b78d564391b74820d2f705ee9ebfdb029b83e22a83d5611aa8faea3376b4668b","first_computed_at":"2026-05-18T02:16:19.277900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.277900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"meozxvD4RtzeIGwcZKtZiyR4Nvt9A78IZb2d4YhI1PQMasT3ArT0dmNFUBJn/yuN+zGsMVHbGKocxwBdf2/FAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.278641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50fd20ce0ab9950967eb7ff3fbd9619ab4d2a2fc08654e7ff2f37bb646809fa9","sha256:5b76a2b7908e678a6ff39ef0d66a587f963ed662278e68b118e3822e4384f13b"],"state_sha256":"90bb51b1e39c3a28f3a15806368f0f0e8606de720ada6aaa5b1c224d3943f8f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7d1O2qqboCbC8GNkmgBY0Mgtyz7v3VzYkxxkh3tpytqnqkBhaINn87G9rorNFAzkMns/dRro1wSgqDSEuZkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:05:56.991030Z","bundle_sha256":"4471df3ebd6cc24f788e7b209116e7bab673788fe219511f5355c17f87330504"}}