{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FP3RICOZ44KLV35FO4UMGW2O2B","short_pith_number":"pith:FP3RICOZ","schema_version":"1.0","canonical_sha256":"2bf71409d9e714baefa57728c35b4ed060421c2b1ffcfccdb6a45ce24443c0b7","source":{"kind":"arxiv","id":"1509.06237","version":1},"attestation_state":"computed","paper":{"title":"Multi-Eulerian tours of directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lionel Levine, Matthew Farrell","submitted_at":"2015-09-21T14:24:10Z","abstract_excerpt":"Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times whenever tail(e)=tail(f). This definition leads to a simple generalization of the BEST Theorem. We then show that the minimal length of a multi-Eulerian tour is bounded in terms of the Pham index, a measure of 'Eulerianness'."},"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":"1509.06237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-21T14:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"21971531309c106edc137ec2f00def61f9917f12a8229f580e2bef795d32b951","abstract_canon_sha256":"89cc83e0517f169cd08dd51c5aabe0a12e5a66a795ac8df626a0abe7bf63f2a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:35.514836Z","signature_b64":"VuykZZhJLMqTtlkQ0R3QCBOZP58DVaz833bze0fYjgQTR52Ina3iJTXCntzwV3za/8VrfAxOR8J2vF4vRvnJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bf71409d9e714baefa57728c35b4ed060421c2b1ffcfccdb6a45ce24443c0b7","last_reissued_at":"2026-05-18T01:32:35.514465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:35.514465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Eulerian tours of directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lionel Levine, Matthew Farrell","submitted_at":"2015-09-21T14:24:10Z","abstract_excerpt":"Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times whenever tail(e)=tail(f). This definition leads to a simple generalization of the BEST Theorem. We then show that the minimal length of a multi-Eulerian tour is bounded in terms of the Pham index, a measure of 'Eulerianness'."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06237","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":"1509.06237","created_at":"2026-05-18T01:32:35.514525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06237v1","created_at":"2026-05-18T01:32:35.514525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06237","created_at":"2026-05-18T01:32:35.514525+00:00"},{"alias_kind":"pith_short_12","alias_value":"FP3RICOZ44KL","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FP3RICOZ44KLV35F","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FP3RICOZ","created_at":"2026-05-18T12:29:19.899920+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/FP3RICOZ44KLV35FO4UMGW2O2B","json":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B.json","graph_json":"https://pith.science/api/pith-number/FP3RICOZ44KLV35FO4UMGW2O2B/graph.json","events_json":"https://pith.science/api/pith-number/FP3RICOZ44KLV35FO4UMGW2O2B/events.json","paper":"https://pith.science/paper/FP3RICOZ"},"agent_actions":{"view_html":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B","download_json":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B.json","view_paper":"https://pith.science/paper/FP3RICOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06237&json=true","fetch_graph":"https://pith.science/api/pith-number/FP3RICOZ44KLV35FO4UMGW2O2B/graph.json","fetch_events":"https://pith.science/api/pith-number/FP3RICOZ44KLV35FO4UMGW2O2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/action/storage_attestation","attest_author":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/action/author_attestation","sign_citation":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/action/citation_signature","submit_replication":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/action/replication_record"}},"created_at":"2026-05-18T01:32:35.514525+00:00","updated_at":"2026-05-18T01:32:35.514525+00:00"}