{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RAQSLKGFWLE4MLMINSKTBOZVZG","short_pith_number":"pith:RAQSLKGF","schema_version":"1.0","canonical_sha256":"882125a8c5b2c9c62d886c9530bb35c9beca84ae2b5ae778c21edfd2b9fddc19","source":{"kind":"arxiv","id":"1202.2156","version":1},"attestation_state":"computed","paper":{"title":"The number of Euler tours of a random directed graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Mary Cryan, P\\'aid\\'i Creed","submitted_at":"2012-02-10T00:18:35Z","abstract_excerpt":"In this paper we obtain the expectation and variance of the number of Euler tours of a random Eulerian directed graph with fixed out-degree sequence. We use this to obtain the asymptotic distribution of the number of Euler tours of a random $d$-in/$d$-out graph and prove a concentration result. We are then able to show that a very simple approach for uniform sampling or approximately counting Euler tours yields algorithms running in expected polynomial time for almost every $d$-in/$d$-out graph. We make use of the BEST theorem of de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte, which shows "},"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":"1202.2156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-10T00:18:35Z","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"title_canon_sha256":"9acfe89ac35cba50b76d6455f759540430644d3237a1528f5395107d3cbd68e4","abstract_canon_sha256":"202e457e4d59d81155a5a921559e55391999dd14dc184e6fd84255debe885f2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.979829Z","signature_b64":"oxI6Pr7md1r2y+VIKFj0b36GBQ2P9PZFXPl8kgNy/MurUygiF9+tOGY9z55ONRySgPpeNySlq/TrJI9E/kzWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"882125a8c5b2c9c62d886c9530bb35c9beca84ae2b5ae778c21edfd2b9fddc19","last_reissued_at":"2026-05-18T02:21:17.979261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.979261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of Euler tours of a random directed graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.DM","authors_text":"Mary Cryan, P\\'aid\\'i Creed","submitted_at":"2012-02-10T00:18:35Z","abstract_excerpt":"In this paper we obtain the expectation and variance of the number of Euler tours of a random Eulerian directed graph with fixed out-degree sequence. We use this to obtain the asymptotic distribution of the number of Euler tours of a random $d$-in/$d$-out graph and prove a concentration result. We are then able to show that a very simple approach for uniform sampling or approximately counting Euler tours yields algorithms running in expected polynomial time for almost every $d$-in/$d$-out graph. We make use of the BEST theorem of de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte, which shows "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2156","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":"1202.2156","created_at":"2026-05-18T02:21:17.979358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2156v1","created_at":"2026-05-18T02:21:17.979358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2156","created_at":"2026-05-18T02:21:17.979358+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAQSLKGFWLE4","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAQSLKGFWLE4MLMI","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAQSLKGF","created_at":"2026-05-18T12:27:20.899486+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/RAQSLKGFWLE4MLMINSKTBOZVZG","json":"https://pith.science/pith/RAQSLKGFWLE4MLMINSKTBOZVZG.json","graph_json":"https://pith.science/api/pith-number/RAQSLKGFWLE4MLMINSKTBOZVZG/graph.json","events_json":"https://pith.science/api/pith-number/RAQSLKGFWLE4MLMINSKTBOZVZG/events.json","paper":"https://pith.science/paper/RAQSLKGF"},"agent_actions":{"view_html":"https://pith.science/pith/RAQSLKGFWLE4MLMINSKTBOZVZG","download_json":"https://pith.science/pith/RAQSLKGFWLE4MLMINSKTBOZVZG.json","view_paper":"https://pith.science/paper/RAQSLKGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2156&json=true","fetch_graph":"https://pith.science/api/pith-number/RAQSLKGFWLE4MLMINSKTBOZVZG/graph.json","fetch_events":"https://pith.science/api/pith-number/RAQSLKGFWLE4MLMINSKTBOZVZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAQSLKGFWLE4MLMINSKTBOZVZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAQSLKGFWLE4MLMINSKTBOZVZG/action/storage_attestation","attest_author":"https://pith.science/pith/RAQSLKGFWLE4MLMINSKTBOZVZG/action/author_attestation","sign_citation":"https://pith.science/pith/RAQSLKGFWLE4MLMINSKTBOZVZG/action/citation_signature","submit_replication":"https://pith.science/pith/RAQSLKGFWLE4MLMINSKTBOZVZG/action/replication_record"}},"created_at":"2026-05-18T02:21:17.979358+00:00","updated_at":"2026-05-18T02:21:17.979358+00:00"}