{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X24FR74OJ7KWEWZPS5K5SGT3CR","short_pith_number":"pith:X24FR74O","canonical_record":{"source":{"id":"1905.11019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-27T07:43:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0235623d55684a0236bdefe38ee8128a7d6d4c2022f53a53b49238a1f283dc4d","abstract_canon_sha256":"ea2159b4a471f74aedf22aeb6e3d029163e18275a0fdf6b34e0a26d94af80f38"},"schema_version":"1.0"},"canonical_sha256":"beb858ff8e4fd5625b2f9755d91a7b145f1cd2aecf142cd25897e7ba8c6f2ab3","source":{"kind":"arxiv","id":"1905.11019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11019","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11019v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11019","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"X24FR74OJ7KW","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X24FR74OJ7KWEWZP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X24FR74O","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X24FR74OJ7KWEWZPS5K5SGT3CR","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-27T07:43:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0235623d55684a0236bdefe38ee8128a7d6d4c2022f53a53b49238a1f283dc4d","abstract_canon_sha256":"ea2159b4a471f74aedf22aeb6e3d029163e18275a0fdf6b34e0a26d94af80f38"},"schema_version":"1.0"},"canonical_sha256":"beb858ff8e4fd5625b2f9755d91a7b145f1cd2aecf142cd25897e7ba8c6f2ab3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.137974Z","signature_b64":"w1m3cei5y6dz2XQ5DDJjUhV5HVloEROq6Y+oHD+cj7aUpHGXN7OKYhpcR1YB6Nyi+W7FOvVznXq8KgCUu2rFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beb858ff8e4fd5625b2f9755d91a7b145f1cd2aecf142cd25897e7ba8c6f2ab3","last_reissued_at":"2026-05-17T23:45:03.136093Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.136093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11019","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-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQjZufBaFjuFgC4qb81dtQk4uskqfoRkY+CCc8rFhv/DsW2+eTFsOpnTT1ym+ICJ8bAndcu3n8WGN6RVyA7uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:33:35.437777Z"},"content_sha256":"9a60f323ef58bf2c6381429c433e6876d4123dc44b05caba3a565261d96bed22","schema_version":"1.0","event_id":"sha256:9a60f323ef58bf2c6381429c433e6876d4123dc44b05caba3a565261d96bed22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X24FR74OJ7KWEWZPS5K5SGT3CR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning eulerian subdigraphs in semicomplete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anders Yeeo, Fr\\'ed\\'eric Havet, J{\\o}rgen Bang-Jensen","submitted_at":"2019-05-27T07:43:16Z","abstract_excerpt":"A digraph is eulerian if it is connected and every vertex has its in-degree equal to its out-degree.\n  Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle.\n  In this paper, we first characterize the pairs $(D,a)$ of a semicomplete digraph $D$ and an arc $a$ such that $D$ has a spanning eulerian subdigraph containing $a$. In particular, we show that if $D$ is $2$-arc-strong, then every arc is contained in a spanning eulerian subdigraph.\n  We then characterize the pairs $(D,a)$ of a semicomplete digraph $D$ and an arc $a$ such that $D$ has a spanning eulerian "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11019","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-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWtaOn0Y7k/dFfxsuge6zrMZJUoArzdHdRRYcErxheD+TNMYjGLWTUioWunzyItw9ICNDB6h1HUkdHbUCj4zCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:33:35.438118Z"},"content_sha256":"bbbc75f367aaf1230d034304f2bb0bfdd67793c1cd3852754c7cf94b16d2c23c","schema_version":"1.0","event_id":"sha256:bbbc75f367aaf1230d034304f2bb0bfdd67793c1cd3852754c7cf94b16d2c23c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X24FR74OJ7KWEWZPS5K5SGT3CR/bundle.json","state_url":"https://pith.science/pith/X24FR74OJ7KWEWZPS5K5SGT3CR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X24FR74OJ7KWEWZPS5K5SGT3CR/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-06-02T13:33:35Z","links":{"resolver":"https://pith.science/pith/X24FR74OJ7KWEWZPS5K5SGT3CR","bundle":"https://pith.science/pith/X24FR74OJ7KWEWZPS5K5SGT3CR/bundle.json","state":"https://pith.science/pith/X24FR74OJ7KWEWZPS5K5SGT3CR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X24FR74OJ7KWEWZPS5K5SGT3CR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X24FR74OJ7KWEWZPS5K5SGT3CR","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":"ea2159b4a471f74aedf22aeb6e3d029163e18275a0fdf6b34e0a26d94af80f38","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-27T07:43:16Z","title_canon_sha256":"0235623d55684a0236bdefe38ee8128a7d6d4c2022f53a53b49238a1f283dc4d"},"schema_version":"1.0","source":{"id":"1905.11019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11019","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11019v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11019","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"X24FR74OJ7KW","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X24FR74OJ7KWEWZP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X24FR74O","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:bbbc75f367aaf1230d034304f2bb0bfdd67793c1cd3852754c7cf94b16d2c23c","target":"graph","created_at":"2026-05-17T23:45:03Z","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":"A digraph is eulerian if it is connected and every vertex has its in-degree equal to its out-degree.\n  Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle.\n  In this paper, we first characterize the pairs $(D,a)$ of a semicomplete digraph $D$ and an arc $a$ such that $D$ has a spanning eulerian subdigraph containing $a$. In particular, we show that if $D$ is $2$-arc-strong, then every arc is contained in a spanning eulerian subdigraph.\n  We then characterize the pairs $(D,a)$ of a semicomplete digraph $D$ and an arc $a$ such that $D$ has a spanning eulerian ","authors_text":"Anders Yeeo, Fr\\'ed\\'eric Havet, J{\\o}rgen Bang-Jensen","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-27T07:43:16Z","title":"Spanning eulerian subdigraphs in semicomplete digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11019","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:9a60f323ef58bf2c6381429c433e6876d4123dc44b05caba3a565261d96bed22","target":"record","created_at":"2026-05-17T23:45:03Z","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":"ea2159b4a471f74aedf22aeb6e3d029163e18275a0fdf6b34e0a26d94af80f38","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-27T07:43:16Z","title_canon_sha256":"0235623d55684a0236bdefe38ee8128a7d6d4c2022f53a53b49238a1f283dc4d"},"schema_version":"1.0","source":{"id":"1905.11019","kind":"arxiv","version":1}},"canonical_sha256":"beb858ff8e4fd5625b2f9755d91a7b145f1cd2aecf142cd25897e7ba8c6f2ab3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"beb858ff8e4fd5625b2f9755d91a7b145f1cd2aecf142cd25897e7ba8c6f2ab3","first_computed_at":"2026-05-17T23:45:03.136093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.136093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w1m3cei5y6dz2XQ5DDJjUhV5HVloEROq6Y+oHD+cj7aUpHGXN7OKYhpcR1YB6Nyi+W7FOvVznXq8KgCUu2rFCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.137974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a60f323ef58bf2c6381429c433e6876d4123dc44b05caba3a565261d96bed22","sha256:bbbc75f367aaf1230d034304f2bb0bfdd67793c1cd3852754c7cf94b16d2c23c"],"state_sha256":"19954b0bb9388eb01725c425f8e3492485b8af8ad6db1300d6cf375f46dc076f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akFuHaneIytXm+7YQthv5Gt5Up9DXjCLcCJe9CGHNSLtE12/ZzgyB5IhgrhCrGc9S7WWf6uTMs/9mig41Mv7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:33:35.439992Z","bundle_sha256":"a7db3330444cc97895282c2225c90495f5824c57af0906e3841e3e724a4e1908"}}