{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UVEEXRY34NA4LVYY2XRETYEWYE","short_pith_number":"pith:UVEEXRY3","canonical_record":{"source":{"id":"2209.08079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-16T17:44:23Z","cross_cats_sorted":[],"title_canon_sha256":"6a297d1f3192d5e69dd0ea7a3d5a0bd6d9401335b18b1a86da8e7c991cb40717","abstract_canon_sha256":"d6612c0fb770b661829e8e80bd1f44d3f9052ff08010fdef5e0537d13b893c1a"},"schema_version":"1.0"},"canonical_sha256":"a5484bc71be341c5d718d5e249e096c106a63039fb5c4024de3d30dcf35c32ef","source":{"kind":"arxiv","id":"2209.08079","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.08079","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"2209.08079v2","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08079","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"UVEEXRY34NA4","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"pith_short_16","alias_value":"UVEEXRY34NA4LVYY","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"pith_short_8","alias_value":"UVEEXRY3","created_at":"2026-07-05T05:50:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UVEEXRY34NA4LVYY2XRETYEWYE","target":"record","payload":{"canonical_record":{"source":{"id":"2209.08079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-16T17:44:23Z","cross_cats_sorted":[],"title_canon_sha256":"6a297d1f3192d5e69dd0ea7a3d5a0bd6d9401335b18b1a86da8e7c991cb40717","abstract_canon_sha256":"d6612c0fb770b661829e8e80bd1f44d3f9052ff08010fdef5e0537d13b893c1a"},"schema_version":"1.0"},"canonical_sha256":"a5484bc71be341c5d718d5e249e096c106a63039fb5c4024de3d30dcf35c32ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:50:08.422116Z","signature_b64":"+owfO9lF6mIlb6ex8iNwMDqL0e4EY9qRrgSOpYgSk8nXjs//91S/XZrAEK3tMdSfdoxhUXgGkiu6QDE24q1wAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5484bc71be341c5d718d5e249e096c106a63039fb5c4024de3d30dcf35c32ef","last_reissued_at":"2026-07-05T05:50:08.421705Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:50:08.421705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.08079","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-07-05T05:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SvqhLNJYtM8Y+H3Ghmaw7Hvlb58554Wug5+roCbXEFo+/fyPnyQDAJ8Rn4XWp+8vUVpj08vaVeij97iqZ7HVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:51:49.931847Z"},"content_sha256":"aca9f6d4df8455d9269de88f3f0394943acf288b054b5cfbf03bc43e70104498","schema_version":"1.0","event_id":"sha256:aca9f6d4df8455d9269de88f3f0394943acf288b054b5cfbf03bc43e70104498"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UVEEXRY34NA4LVYY2XRETYEWYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Last New Vertex Visited by a Random Walk in a Directed Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Calum Buchanan, Paul Horn, Puck Rombach","submitted_at":"2022-09-16T17:44:23Z","abstract_excerpt":"Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with equal probability to any neighbor of its current vertex, and ends when it has visited every vertex. We call such a random walk a random cover tour. It is well known that cycles and complete graphs have the property that a random cover tour starting at any vertex is equally likely to end at any other vertex. Ronald Graham asked whether there are any other graphs with this property. In 1993, L\\'aszlo Lov\\'asz and Peter Winkler showed that cycles and complete graphs are the only undirected graphs w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08079","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.08079/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQr9ZTlF8bsrmfligPyZMCKr42Jwjf1JmsSkm4xwo+wshHY/TtzfYkEiH23BCyAhO8SNLCQqTcLB1kCS8H+/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:51:49.932221Z"},"content_sha256":"6e6c06863e8550ac858607d49e15b4dcc628759b9c24eb4b89c98a949570d3a3","schema_version":"1.0","event_id":"sha256:6e6c06863e8550ac858607d49e15b4dcc628759b9c24eb4b89c98a949570d3a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVEEXRY34NA4LVYY2XRETYEWYE/bundle.json","state_url":"https://pith.science/pith/UVEEXRY34NA4LVYY2XRETYEWYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVEEXRY34NA4LVYY2XRETYEWYE/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-07-07T04:51:49Z","links":{"resolver":"https://pith.science/pith/UVEEXRY34NA4LVYY2XRETYEWYE","bundle":"https://pith.science/pith/UVEEXRY34NA4LVYY2XRETYEWYE/bundle.json","state":"https://pith.science/pith/UVEEXRY34NA4LVYY2XRETYEWYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVEEXRY34NA4LVYY2XRETYEWYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UVEEXRY34NA4LVYY2XRETYEWYE","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":"d6612c0fb770b661829e8e80bd1f44d3f9052ff08010fdef5e0537d13b893c1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-16T17:44:23Z","title_canon_sha256":"6a297d1f3192d5e69dd0ea7a3d5a0bd6d9401335b18b1a86da8e7c991cb40717"},"schema_version":"1.0","source":{"id":"2209.08079","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.08079","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"2209.08079v2","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08079","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"UVEEXRY34NA4","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"pith_short_16","alias_value":"UVEEXRY34NA4LVYY","created_at":"2026-07-05T05:50:08Z"},{"alias_kind":"pith_short_8","alias_value":"UVEEXRY3","created_at":"2026-07-05T05:50:08Z"}],"graph_snapshots":[{"event_id":"sha256:6e6c06863e8550ac858607d49e15b4dcc628759b9c24eb4b89c98a949570d3a3","target":"graph","created_at":"2026-07-05T05:50:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.08079/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with equal probability to any neighbor of its current vertex, and ends when it has visited every vertex. We call such a random walk a random cover tour. It is well known that cycles and complete graphs have the property that a random cover tour starting at any vertex is equally likely to end at any other vertex. Ronald Graham asked whether there are any other graphs with this property. In 1993, L\\'aszlo Lov\\'asz and Peter Winkler showed that cycles and complete graphs are the only undirected graphs w","authors_text":"Calum Buchanan, Paul Horn, Puck Rombach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-16T17:44:23Z","title":"On the Last New Vertex Visited by a Random Walk in a Directed Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08079","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:aca9f6d4df8455d9269de88f3f0394943acf288b054b5cfbf03bc43e70104498","target":"record","created_at":"2026-07-05T05:50:08Z","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":"d6612c0fb770b661829e8e80bd1f44d3f9052ff08010fdef5e0537d13b893c1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-16T17:44:23Z","title_canon_sha256":"6a297d1f3192d5e69dd0ea7a3d5a0bd6d9401335b18b1a86da8e7c991cb40717"},"schema_version":"1.0","source":{"id":"2209.08079","kind":"arxiv","version":2}},"canonical_sha256":"a5484bc71be341c5d718d5e249e096c106a63039fb5c4024de3d30dcf35c32ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5484bc71be341c5d718d5e249e096c106a63039fb5c4024de3d30dcf35c32ef","first_computed_at":"2026-07-05T05:50:08.421705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:50:08.421705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+owfO9lF6mIlb6ex8iNwMDqL0e4EY9qRrgSOpYgSk8nXjs//91S/XZrAEK3tMdSfdoxhUXgGkiu6QDE24q1wAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:50:08.422116Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.08079","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aca9f6d4df8455d9269de88f3f0394943acf288b054b5cfbf03bc43e70104498","sha256:6e6c06863e8550ac858607d49e15b4dcc628759b9c24eb4b89c98a949570d3a3"],"state_sha256":"7a9c76f0179a8a33b72909bc2ad0345af3bd45382ef7d4f9b176328ebbb0aedf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmTHrOjGSkclRcIlA6zxUw8zsjeLHUF+EIgU3Fyz6SLjs78Ihr50YdfjV6mnnExWBv0+3QOXayDpan9HcZiADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:51:49.934451Z","bundle_sha256":"23ba3c9421f8a99b05a71d5ecf6d664ce3d63852bb086a595e7ecbcd989eceff"}}