{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PLJDQE22KUC3UG4TZEZXZMZFPS","short_pith_number":"pith:PLJDQE22","schema_version":"1.0","canonical_sha256":"7ad238135a5505ba1b93c9337cb3257c931d44464b191e00ef2e08792457998e","source":{"kind":"arxiv","id":"2409.18012","version":1},"attestation_state":"computed","paper":{"title":"Number of Eulerian orientations for Benjamini--Schramm convergent graph sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ferenc Bencs, M\\'arton Borb\\'enyi, P\\'eter Csikv\\'ari","submitted_at":"2024-09-26T16:20:25Z","abstract_excerpt":"For a graph $G$ let $\\varepsilon(G)$ denote the number of Eulerian orientations, and $v(G)$ denote the number of vertices of $G$. We show that if $(G_n)_n$ is a sequence of Eulerian graphs that are convergent in Benjamini--Schramm sense, then $\\lim\\limits_{n\\to \\infty}\\frac{1}{v(G_n)}\\ln \\varepsilon(G_n)$ is convergent."},"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":"2409.18012","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-26T16:20:25Z","cross_cats_sorted":[],"title_canon_sha256":"4f60694276e39437cb0d366664a99385eacd247a5a38446441a08a277d6e9987","abstract_canon_sha256":"09faf59f70814f3bf8caf72197d89873d63c4a9dae9a6f420a1621f7dec1e5dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:19.089883Z","signature_b64":"g7ImXQpQi8jJj9PW8RGtphAyvGRv2AqPocS8HVJTrDLKAnnaOV3LYYy6datCVDoZKIyvTs+pb68Bc/M+T513Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ad238135a5505ba1b93c9337cb3257c931d44464b191e00ef2e08792457998e","last_reissued_at":"2026-07-05T09:12:19.089467Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:19.089467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Number of Eulerian orientations for Benjamini--Schramm convergent graph sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ferenc Bencs, M\\'arton Borb\\'enyi, P\\'eter Csikv\\'ari","submitted_at":"2024-09-26T16:20:25Z","abstract_excerpt":"For a graph $G$ let $\\varepsilon(G)$ denote the number of Eulerian orientations, and $v(G)$ denote the number of vertices of $G$. We show that if $(G_n)_n$ is a sequence of Eulerian graphs that are convergent in Benjamini--Schramm sense, then $\\lim\\limits_{n\\to \\infty}\\frac{1}{v(G_n)}\\ln \\varepsilon(G_n)$ is convergent."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.18012","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/2409.18012/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":"2409.18012","created_at":"2026-07-05T09:12:19.089526+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.18012v1","created_at":"2026-07-05T09:12:19.089526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.18012","created_at":"2026-07-05T09:12:19.089526+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLJDQE22KUC3","created_at":"2026-07-05T09:12:19.089526+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLJDQE22KUC3UG4T","created_at":"2026-07-05T09:12:19.089526+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLJDQE22","created_at":"2026-07-05T09:12:19.089526+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.12693","citing_title":"Counting degree-constrained orientations","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS","json":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS.json","graph_json":"https://pith.science/api/pith-number/PLJDQE22KUC3UG4TZEZXZMZFPS/graph.json","events_json":"https://pith.science/api/pith-number/PLJDQE22KUC3UG4TZEZXZMZFPS/events.json","paper":"https://pith.science/paper/PLJDQE22"},"agent_actions":{"view_html":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS","download_json":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS.json","view_paper":"https://pith.science/paper/PLJDQE22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.18012&json=true","fetch_graph":"https://pith.science/api/pith-number/PLJDQE22KUC3UG4TZEZXZMZFPS/graph.json","fetch_events":"https://pith.science/api/pith-number/PLJDQE22KUC3UG4TZEZXZMZFPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS/action/storage_attestation","attest_author":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS/action/author_attestation","sign_citation":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS/action/citation_signature","submit_replication":"https://pith.science/pith/PLJDQE22KUC3UG4TZEZXZMZFPS/action/replication_record"}},"created_at":"2026-07-05T09:12:19.089526+00:00","updated_at":"2026-07-05T09:12:19.089526+00:00"}