{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OZA2NZAE3WKLOLD67GJ33VJPT3","short_pith_number":"pith:OZA2NZAE","canonical_record":{"source":{"id":"1201.5707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-27T06:27:56Z","cross_cats_sorted":[],"title_canon_sha256":"7b7eff696f64f1688f4c25655fc0272786646b9c3680ca47da1e609d3362ad56","abstract_canon_sha256":"f407b834949843040192c3cd7063573608bb94936c0042ce387c4a2eb90f053a"},"schema_version":"1.0"},"canonical_sha256":"7641a6e404dd94b72c7ef993bdd52f9ec225603f5a5271b9992265e1305af224","source":{"kind":"arxiv","id":"1201.5707","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5707","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5707v2","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5707","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"OZA2NZAE3WKL","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OZA2NZAE3WKLOLD6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OZA2NZAE","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OZA2NZAE3WKLOLD67GJ33VJPT3","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-27T06:27:56Z","cross_cats_sorted":[],"title_canon_sha256":"7b7eff696f64f1688f4c25655fc0272786646b9c3680ca47da1e609d3362ad56","abstract_canon_sha256":"f407b834949843040192c3cd7063573608bb94936c0042ce387c4a2eb90f053a"},"schema_version":"1.0"},"canonical_sha256":"7641a6e404dd94b72c7ef993bdd52f9ec225603f5a5271b9992265e1305af224","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:21.066248Z","signature_b64":"qCcIqXv8+okrezpkZYppQlQrPQrV7kCHA4PBGokX4tVlDXVBRojJXugRrwSS78v2x+vQq0FlUiNRmsbshAXuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7641a6e404dd94b72c7ef993bdd52f9ec225603f5a5271b9992265e1305af224","last_reissued_at":"2026-05-18T03:07:21.065796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:21.065796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5707","source_version":2,"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-18T03:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cYaL7bE0fsft4pC6FST5+WOy33CXbV5QLzQE9V/SdLZKbo2XyOEa0js36BfYhFNcLzuQE9KaJQQgOkwIRLdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:35:42.000383Z"},"content_sha256":"81873a96217f8aa1d60bf6cd2d614a80aa584b171a3e80059a8c59ae3831185c","schema_version":"1.0","event_id":"sha256:81873a96217f8aa1d60bf6cd2d614a80aa584b171a3e80059a8c59ae3831185c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OZA2NZAE3WKLOLD67GJ33VJPT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonicity of 3-arc graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guangjun Xu, Sanming Zhou","submitted_at":"2012-01-27T06:27:56Z","abstract_excerpt":"An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy$ are adjacent if and only if $(v,u,x,y)$ is a 3-arc of $G$. In this paper we prove that any connected 3-arc graph is Hamiltonian, and all iterative 3-arc graphs of any connected graph of minimum degree at least three are Hamiltonian. As a consequence we obtain that if a vertex-transitive graph is isomorphic to the 3-arc graph of a connected arc-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5707","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"},"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-18T03:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnAjNFfUcJBK9SeAikAFYLVyv1PhKQjDjAs5iDT4eXPGw+L2JRtuSR+OZ1DLGFZ29KZKLGkLRezLON2clMwICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:35:42.001278Z"},"content_sha256":"f1ac8e8636ae441b16fc597aa2c91e06042670f7c3f16f83a825eed0360f2d6f","schema_version":"1.0","event_id":"sha256:f1ac8e8636ae441b16fc597aa2c91e06042670f7c3f16f83a825eed0360f2d6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZA2NZAE3WKLOLD67GJ33VJPT3/bundle.json","state_url":"https://pith.science/pith/OZA2NZAE3WKLOLD67GJ33VJPT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZA2NZAE3WKLOLD67GJ33VJPT3/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-05-29T20:35:42Z","links":{"resolver":"https://pith.science/pith/OZA2NZAE3WKLOLD67GJ33VJPT3","bundle":"https://pith.science/pith/OZA2NZAE3WKLOLD67GJ33VJPT3/bundle.json","state":"https://pith.science/pith/OZA2NZAE3WKLOLD67GJ33VJPT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZA2NZAE3WKLOLD67GJ33VJPT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OZA2NZAE3WKLOLD67GJ33VJPT3","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":"f407b834949843040192c3cd7063573608bb94936c0042ce387c4a2eb90f053a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-27T06:27:56Z","title_canon_sha256":"7b7eff696f64f1688f4c25655fc0272786646b9c3680ca47da1e609d3362ad56"},"schema_version":"1.0","source":{"id":"1201.5707","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5707","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5707v2","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5707","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"OZA2NZAE3WKL","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OZA2NZAE3WKLOLD6","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OZA2NZAE","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:f1ac8e8636ae441b16fc597aa2c91e06042670f7c3f16f83a825eed0360f2d6f","target":"graph","created_at":"2026-05-18T03:07:21Z","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":"An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy$ are adjacent if and only if $(v,u,x,y)$ is a 3-arc of $G$. In this paper we prove that any connected 3-arc graph is Hamiltonian, and all iterative 3-arc graphs of any connected graph of minimum degree at least three are Hamiltonian. As a consequence we obtain that if a vertex-transitive graph is isomorphic to the 3-arc graph of a connected arc-","authors_text":"Guangjun Xu, Sanming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-27T06:27:56Z","title":"Hamiltonicity of 3-arc graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5707","kind":"arxiv","version":2},"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:81873a96217f8aa1d60bf6cd2d614a80aa584b171a3e80059a8c59ae3831185c","target":"record","created_at":"2026-05-18T03:07:21Z","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":"f407b834949843040192c3cd7063573608bb94936c0042ce387c4a2eb90f053a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-27T06:27:56Z","title_canon_sha256":"7b7eff696f64f1688f4c25655fc0272786646b9c3680ca47da1e609d3362ad56"},"schema_version":"1.0","source":{"id":"1201.5707","kind":"arxiv","version":2}},"canonical_sha256":"7641a6e404dd94b72c7ef993bdd52f9ec225603f5a5271b9992265e1305af224","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7641a6e404dd94b72c7ef993bdd52f9ec225603f5a5271b9992265e1305af224","first_computed_at":"2026-05-18T03:07:21.065796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:21.065796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qCcIqXv8+okrezpkZYppQlQrPQrV7kCHA4PBGokX4tVlDXVBRojJXugRrwSS78v2x+vQq0FlUiNRmsbshAXuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:21.066248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5707","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81873a96217f8aa1d60bf6cd2d614a80aa584b171a3e80059a8c59ae3831185c","sha256:f1ac8e8636ae441b16fc597aa2c91e06042670f7c3f16f83a825eed0360f2d6f"],"state_sha256":"d3d485133a52f802b4ab1d69652fbfa347ee99edd189f7646f8b7675f40094c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91SvWh9l5iuMzl0L4W7OMPg/WeYYGjVnlKsnZlf33xELdHPJ7DY1gV0IhqnvRDi9Xaw9u4xZDcXIyqh34v24AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T20:35:42.003966Z","bundle_sha256":"714b15e0d5cc65dc76c37da0b8fa63e4a56f97e4fbdcc488770e58a6f561842e"}}