{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:C7PHIXJUAKBLS7XNH3IOIKPPEG","short_pith_number":"pith:C7PHIXJU","canonical_record":{"source":{"id":"2605.29566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-28T08:17:10Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3c71e2d9c46a1fddd554a111ec6ce4b84c7c26e37e10aa4b7cb4c17ababd3808","abstract_canon_sha256":"da85a0c2cca25cb510a21cab64cf7e586dab1a6cbcf778218352dacf64b646d9"},"schema_version":"1.0"},"canonical_sha256":"17de745d340282b97eed3ed0e429ef219f3d743733951c1f0874e0aa851d3222","source":{"kind":"arxiv","id":"2605.29566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.29566","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.29566v1","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29566","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"C7PHIXJUAKBL","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"C7PHIXJUAKBLS7XN","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"C7PHIXJU","created_at":"2026-05-29T01:05:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:C7PHIXJUAKBLS7XNH3IOIKPPEG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.29566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-28T08:17:10Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3c71e2d9c46a1fddd554a111ec6ce4b84c7c26e37e10aa4b7cb4c17ababd3808","abstract_canon_sha256":"da85a0c2cca25cb510a21cab64cf7e586dab1a6cbcf778218352dacf64b646d9"},"schema_version":"1.0"},"canonical_sha256":"17de745d340282b97eed3ed0e429ef219f3d743733951c1f0874e0aa851d3222","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:47.753453Z","signature_b64":"1OmsZEj0wfyzOen6rtyExuBvGO8+P8mZ1kCRsOTlON0hPyXs/BPzAfhprtC5yCC6IS/b6qiZaMYA8/Jhpu/QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17de745d340282b97eed3ed0e429ef219f3d743733951c1f0874e0aa851d3222","last_reissued_at":"2026-05-29T01:05:47.752713Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:47.752713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.29566","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-29T01:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdDTApgKd4PG8Rs5kKGBfKlb/oWT6hUuAFcLHorXDKG0gWWCGk9rpc6ezZfFXFELpCBYmFcbcdGWCHFjMrNODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:08:58.958505Z"},"content_sha256":"d46e0a3b4da1fbe6a06eafb29a601708a6c25af5f87a364f71768b3bbc19bff3","schema_version":"1.0","event_id":"sha256:d46e0a3b4da1fbe6a06eafb29a601708a6c25af5f87a364f71768b3bbc19bff3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:C7PHIXJUAKBLS7XNH3IOIKPPEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling Directed Eulerian Tours in $\\widetilde O(m^{3/2})$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Nima Anari","submitted_at":"2026-05-28T08:17:10Z","abstract_excerpt":"We give a randomized algorithm that samples a nearly uniform Eulerian tour of a directed Eulerian multigraph with $m$ arcs in $\\widetilde O(m^{3/2})$ time. The guarantee is worst-case, applies to arbitrary directed Eulerian multigraphs, and breaks the $mn$-type arborescence-sampling barrier on sparse graphs.\n  The core case is a $2$-in/$2$-out graph. We introduce a new local Markov chain, the flip--repair walk: one step locally splits a tour into two circuits and then chooses uniformly among the local flips that repair the state to one tour. We prove that this walk mixes in nearly linear many "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29566","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.29566/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-05-29T01:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+jl49YtFWeVGglMuOrcsetJ0NRdfALiZP/ls8/bo1ur3AZ1Km5lUVkvUk+RSAJ3GlebLvNIsxIozqFqVcO6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:08:58.959382Z"},"content_sha256":"5e29e56902cc936ffb9f9cad252b8327d13f5d58e76af3ea218d4c1748385758","schema_version":"1.0","event_id":"sha256:5e29e56902cc936ffb9f9cad252b8327d13f5d58e76af3ea218d4c1748385758"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7PHIXJUAKBLS7XNH3IOIKPPEG/bundle.json","state_url":"https://pith.science/pith/C7PHIXJUAKBLS7XNH3IOIKPPEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7PHIXJUAKBLS7XNH3IOIKPPEG/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-06T08:08:58Z","links":{"resolver":"https://pith.science/pith/C7PHIXJUAKBLS7XNH3IOIKPPEG","bundle":"https://pith.science/pith/C7PHIXJUAKBLS7XNH3IOIKPPEG/bundle.json","state":"https://pith.science/pith/C7PHIXJUAKBLS7XNH3IOIKPPEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7PHIXJUAKBLS7XNH3IOIKPPEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:C7PHIXJUAKBLS7XNH3IOIKPPEG","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":"da85a0c2cca25cb510a21cab64cf7e586dab1a6cbcf778218352dacf64b646d9","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-28T08:17:10Z","title_canon_sha256":"3c71e2d9c46a1fddd554a111ec6ce4b84c7c26e37e10aa4b7cb4c17ababd3808"},"schema_version":"1.0","source":{"id":"2605.29566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.29566","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.29566v1","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29566","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"C7PHIXJUAKBL","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"C7PHIXJUAKBLS7XN","created_at":"2026-05-29T01:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"C7PHIXJU","created_at":"2026-05-29T01:05:47Z"}],"graph_snapshots":[{"event_id":"sha256:5e29e56902cc936ffb9f9cad252b8327d13f5d58e76af3ea218d4c1748385758","target":"graph","created_at":"2026-05-29T01:05:47Z","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/2605.29566/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a randomized algorithm that samples a nearly uniform Eulerian tour of a directed Eulerian multigraph with $m$ arcs in $\\widetilde O(m^{3/2})$ time. The guarantee is worst-case, applies to arbitrary directed Eulerian multigraphs, and breaks the $mn$-type arborescence-sampling barrier on sparse graphs.\n  The core case is a $2$-in/$2$-out graph. We introduce a new local Markov chain, the flip--repair walk: one step locally splits a tour into two circuits and then chooses uniformly among the local flips that repair the state to one tour. We prove that this walk mixes in nearly linear many ","authors_text":"Nima Anari","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-28T08:17:10Z","title":"Sampling Directed Eulerian Tours in $\\widetilde O(m^{3/2})$ Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29566","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:d46e0a3b4da1fbe6a06eafb29a601708a6c25af5f87a364f71768b3bbc19bff3","target":"record","created_at":"2026-05-29T01:05:47Z","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":"da85a0c2cca25cb510a21cab64cf7e586dab1a6cbcf778218352dacf64b646d9","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-28T08:17:10Z","title_canon_sha256":"3c71e2d9c46a1fddd554a111ec6ce4b84c7c26e37e10aa4b7cb4c17ababd3808"},"schema_version":"1.0","source":{"id":"2605.29566","kind":"arxiv","version":1}},"canonical_sha256":"17de745d340282b97eed3ed0e429ef219f3d743733951c1f0874e0aa851d3222","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17de745d340282b97eed3ed0e429ef219f3d743733951c1f0874e0aa851d3222","first_computed_at":"2026-05-29T01:05:47.752713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:47.752713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1OmsZEj0wfyzOen6rtyExuBvGO8+P8mZ1kCRsOTlON0hPyXs/BPzAfhprtC5yCC6IS/b6qiZaMYA8/Jhpu/QDw==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:47.753453Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.29566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d46e0a3b4da1fbe6a06eafb29a601708a6c25af5f87a364f71768b3bbc19bff3","sha256:5e29e56902cc936ffb9f9cad252b8327d13f5d58e76af3ea218d4c1748385758"],"state_sha256":"84b9edd943359f1628a8825888c03e8c43b6c9fca149203ed8ce8bcda3d1c1d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXiaP1kyATyzPG6JSpkqNKLudCEqO6WGcA/ct0/Sh48mNI3JniXSJazrF47tGc/oAsFg2+WIzOQlV5TXEq0kAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:08:58.962571Z","bundle_sha256":"e4d3eea9ece814b5a188f06f48097a91deeaf91d08882078e4f6c3da4359398e"}}