{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LLWKFK6LU4OJ5P5VTXTK2YNQ3M","short_pith_number":"pith:LLWKFK6L","schema_version":"1.0","canonical_sha256":"5aeca2abcba71c9ebfb59de6ad61b0db279f3e8cb1465550d94b45f52626e752","source":{"kind":"arxiv","id":"2104.10734","version":3},"attestation_state":"computed","paper":{"title":"Digraphs with exactly one Eulerian tour","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antoine Labelle, Luz Grisales, Rodrigo Posada, Stoyan Dimitrov","submitted_at":"2021-04-21T19:37:00Z","abstract_excerpt":"We give two combinatorial proofs of the fact that the number of loopless digraphs on the vertex set $[n]$ with no isolated vertices and with exactly one Eulerian tour up to a cyclic shift is $\\frac{1}{2}(n-1)!C_{n}$, where $C_{n}$ denotes the $n$-th Catalan number. We construct a bijection with a set of labeled rooted plane trees and with a set of valid parenthesis arrangements."},"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":"2104.10734","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-21T19:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"b9ea198a5eeb50b916f6a47d1637279a306bff0263996c96a5cc3d6b64a2af4b","abstract_canon_sha256":"a0ec81824026735c25fdcf2a29923c4a66ac772c1af4b965f9e9792684830f46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:45.904692Z","signature_b64":"olHyaw/Yoxibnq8LA4/sKM7ooh6qafBWV2PcqhpN05coO4KyqnNzHi3QTlrLWzclM/t0ExW5EJaSeAPnQtYmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aeca2abcba71c9ebfb59de6ad61b0db279f3e8cb1465550d94b45f52626e752","last_reissued_at":"2026-07-05T02:37:45.904205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:45.904205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Digraphs with exactly one Eulerian tour","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antoine Labelle, Luz Grisales, Rodrigo Posada, Stoyan Dimitrov","submitted_at":"2021-04-21T19:37:00Z","abstract_excerpt":"We give two combinatorial proofs of the fact that the number of loopless digraphs on the vertex set $[n]$ with no isolated vertices and with exactly one Eulerian tour up to a cyclic shift is $\\frac{1}{2}(n-1)!C_{n}$, where $C_{n}$ denotes the $n$-th Catalan number. We construct a bijection with a set of labeled rooted plane trees and with a set of valid parenthesis arrangements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.10734","kind":"arxiv","version":3},"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/2104.10734/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":"2104.10734","created_at":"2026-07-05T02:37:45.904262+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.10734v3","created_at":"2026-07-05T02:37:45.904262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.10734","created_at":"2026-07-05T02:37:45.904262+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLWKFK6LU4OJ","created_at":"2026-07-05T02:37:45.904262+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLWKFK6LU4OJ5P5V","created_at":"2026-07-05T02:37:45.904262+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLWKFK6L","created_at":"2026-07-05T02:37:45.904262+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/LLWKFK6LU4OJ5P5VTXTK2YNQ3M","json":"https://pith.science/pith/LLWKFK6LU4OJ5P5VTXTK2YNQ3M.json","graph_json":"https://pith.science/api/pith-number/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/graph.json","events_json":"https://pith.science/api/pith-number/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/events.json","paper":"https://pith.science/paper/LLWKFK6L"},"agent_actions":{"view_html":"https://pith.science/pith/LLWKFK6LU4OJ5P5VTXTK2YNQ3M","download_json":"https://pith.science/pith/LLWKFK6LU4OJ5P5VTXTK2YNQ3M.json","view_paper":"https://pith.science/paper/LLWKFK6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.10734&json=true","fetch_graph":"https://pith.science/api/pith-number/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/graph.json","fetch_events":"https://pith.science/api/pith-number/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/action/storage_attestation","attest_author":"https://pith.science/pith/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/action/author_attestation","sign_citation":"https://pith.science/pith/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/action/citation_signature","submit_replication":"https://pith.science/pith/LLWKFK6LU4OJ5P5VTXTK2YNQ3M/action/replication_record"}},"created_at":"2026-07-05T02:37:45.904262+00:00","updated_at":"2026-07-05T02:37:45.904262+00:00"}