{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FP3RICOZ44KLV35FO4UMGW2O2B","short_pith_number":"pith:FP3RICOZ","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"},"canonical_sha256":"2bf71409d9e714baefa57728c35b4ed060421c2b1ffcfccdb6a45ce24443c0b7","source":{"kind":"arxiv","id":"1509.06237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06237","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06237v1","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06237","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"FP3RICOZ44KL","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FP3RICOZ44KLV35F","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FP3RICOZ","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FP3RICOZ44KLV35FO4UMGW2O2B","target":"record","payload":{"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"},"canonical_sha256":"2bf71409d9e714baefa57728c35b4ed060421c2b1ffcfccdb6a45ce24443c0b7","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"},"source_kind":"arxiv","source_id":"1509.06237","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kUiewE+GCFVfhFg68HuOGdyEnEzl3JVANxxxj17ltqPnv2bxPeHBALbi5a4jaa2MukCnkdZD98GBpu34S7a4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:13:11.208051Z"},"content_sha256":"db547498639c29650fb4dd8de4d358952f42553583eebcfccae0fd6fc1789915","schema_version":"1.0","event_id":"sha256:db547498639c29650fb4dd8de4d358952f42553583eebcfccae0fd6fc1789915"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FP3RICOZ44KLV35FO4UMGW2O2B","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8X+JdAS3xaqEetieJ8MAT7poUDDVMsDaHuFAYkvi0QckqgyPIc7ETc0/GJ4GUb+GKuh/SgjtatLse4Rx4IqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:13:11.208409Z"},"content_sha256":"c876d39a4fd529bcd729abf415df6746c9bec2ad5e438d8f4564183d8e453faa","schema_version":"1.0","event_id":"sha256:c876d39a4fd529bcd729abf415df6746c9bec2ad5e438d8f4564183d8e453faa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/bundle.json","state_url":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FP3RICOZ44KLV35FO4UMGW2O2B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T09:13:11Z","links":{"resolver":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B","bundle":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/bundle.json","state":"https://pith.science/pith/FP3RICOZ44KLV35FO4UMGW2O2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FP3RICOZ44KLV35FO4UMGW2O2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FP3RICOZ44KLV35FO4UMGW2O2B","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"89cc83e0517f169cd08dd51c5aabe0a12e5a66a795ac8df626a0abe7bf63f2a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-21T14:24:10Z","title_canon_sha256":"21971531309c106edc137ec2f00def61f9917f12a8229f580e2bef795d32b951"},"schema_version":"1.0","source":{"id":"1509.06237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06237","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06237v1","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06237","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"FP3RICOZ44KL","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FP3RICOZ44KLV35F","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FP3RICOZ","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:c876d39a4fd529bcd729abf415df6746c9bec2ad5e438d8f4564183d8e453faa","target":"graph","created_at":"2026-05-18T01:32:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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'.","authors_text":"Lionel Levine, Matthew Farrell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-21T14:24:10Z","title":"Multi-Eulerian tours of directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06237","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:db547498639c29650fb4dd8de4d358952f42553583eebcfccae0fd6fc1789915","target":"record","created_at":"2026-05-18T01:32:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"89cc83e0517f169cd08dd51c5aabe0a12e5a66a795ac8df626a0abe7bf63f2a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-21T14:24:10Z","title_canon_sha256":"21971531309c106edc137ec2f00def61f9917f12a8229f580e2bef795d32b951"},"schema_version":"1.0","source":{"id":"1509.06237","kind":"arxiv","version":1}},"canonical_sha256":"2bf71409d9e714baefa57728c35b4ed060421c2b1ffcfccdb6a45ce24443c0b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bf71409d9e714baefa57728c35b4ed060421c2b1ffcfccdb6a45ce24443c0b7","first_computed_at":"2026-05-18T01:32:35.514465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:35.514465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VuykZZhJLMqTtlkQ0R3QCBOZP58DVaz833bze0fYjgQTR52Ina3iJTXCntzwV3za/8VrfAxOR8J2vF4vRvnJBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:35.514836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db547498639c29650fb4dd8de4d358952f42553583eebcfccae0fd6fc1789915","sha256:c876d39a4fd529bcd729abf415df6746c9bec2ad5e438d8f4564183d8e453faa"],"state_sha256":"3fba85fc15901807cf450f4e044a485f768a510fbcce81523f46b28fdf2b3347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yh3++oeUemdyxBFL+M38M83z2181P0M1BntCizX7GEtB/OvebAcnehTuVziX1miy9fcTFA2CZVjuEGjQg9EcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:13:11.210388Z","bundle_sha256":"437d5495cfbe530a96b125129afac2696faf4eb7930607a1a8866076ca3f5ace"}}