{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CP543DMHP3SNJ4QPYIFA7GEG4M","short_pith_number":"pith:CP543DMH","schema_version":"1.0","canonical_sha256":"13fbcd8d877ee4d4f20fc20a0f9886e300ca08743eda98028382a20778d543a0","source":{"kind":"arxiv","id":"2309.15473","version":2},"attestation_state":"computed","paper":{"title":"Cumulant expansion for counting Eulerian orientations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Mikhail Isaev, Rui-Ray Zhang","submitted_at":"2023-09-27T08:13:37Z","abstract_excerpt":"An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type models'' in statistical physics and is known to be hard for general graphs. For all graphs with good expansion properties and degrees larger than $\\log^{8} n$, we derive an asymptotic expansion for this count that approximates it to precision $O(n^{-c})$ for arbitrary large $c$, where $n$ is the number of vertices. The proof relies on a new tail bound for th"},"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":"2309.15473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-27T08:13:37Z","cross_cats_sorted":[],"title_canon_sha256":"5ec36266f44b86bb097c6116cf1595e8c524f03210a995960441d6e32e77f6f5","abstract_canon_sha256":"52958ce7e65c6ed9e413ee4acea0313ad0d0e0de2becd560db70ffa391322bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:08.398175Z","signature_b64":"WQnBisSIOvhO8zlkmo8I+egu8U7lk/eHluz1dWzKlpjCN1RZiIWQUJGSiRqC9hYb20YYatBhNUpjXtr2YkziCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13fbcd8d877ee4d4f20fc20a0f9886e300ca08743eda98028382a20778d543a0","last_reissued_at":"2026-07-05T09:52:08.397692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:08.397692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cumulant expansion for counting Eulerian orientations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Mikhail Isaev, Rui-Ray Zhang","submitted_at":"2023-09-27T08:13:37Z","abstract_excerpt":"An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type models'' in statistical physics and is known to be hard for general graphs. For all graphs with good expansion properties and degrees larger than $\\log^{8} n$, we derive an asymptotic expansion for this count that approximates it to precision $O(n^{-c})$ for arbitrary large $c$, where $n$ is the number of vertices. The proof relies on a new tail bound for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15473","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/2309.15473/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.15473","created_at":"2026-07-05T09:52:08.397750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15473v2","created_at":"2026-07-05T09:52:08.397750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15473","created_at":"2026-07-05T09:52:08.397750+00:00"},{"alias_kind":"pith_short_12","alias_value":"CP543DMHP3SN","created_at":"2026-07-05T09:52:08.397750+00:00"},{"alias_kind":"pith_short_16","alias_value":"CP543DMHP3SNJ4QP","created_at":"2026-07-05T09:52:08.397750+00:00"},{"alias_kind":"pith_short_8","alias_value":"CP543DMH","created_at":"2026-07-05T09:52:08.397750+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/CP543DMHP3SNJ4QPYIFA7GEG4M","json":"https://pith.science/pith/CP543DMHP3SNJ4QPYIFA7GEG4M.json","graph_json":"https://pith.science/api/pith-number/CP543DMHP3SNJ4QPYIFA7GEG4M/graph.json","events_json":"https://pith.science/api/pith-number/CP543DMHP3SNJ4QPYIFA7GEG4M/events.json","paper":"https://pith.science/paper/CP543DMH"},"agent_actions":{"view_html":"https://pith.science/pith/CP543DMHP3SNJ4QPYIFA7GEG4M","download_json":"https://pith.science/pith/CP543DMHP3SNJ4QPYIFA7GEG4M.json","view_paper":"https://pith.science/paper/CP543DMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15473&json=true","fetch_graph":"https://pith.science/api/pith-number/CP543DMHP3SNJ4QPYIFA7GEG4M/graph.json","fetch_events":"https://pith.science/api/pith-number/CP543DMHP3SNJ4QPYIFA7GEG4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CP543DMHP3SNJ4QPYIFA7GEG4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CP543DMHP3SNJ4QPYIFA7GEG4M/action/storage_attestation","attest_author":"https://pith.science/pith/CP543DMHP3SNJ4QPYIFA7GEG4M/action/author_attestation","sign_citation":"https://pith.science/pith/CP543DMHP3SNJ4QPYIFA7GEG4M/action/citation_signature","submit_replication":"https://pith.science/pith/CP543DMHP3SNJ4QPYIFA7GEG4M/action/replication_record"}},"created_at":"2026-07-05T09:52:08.397750+00:00","updated_at":"2026-07-05T09:52:08.397750+00:00"}