{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:53PSJL5OK4T4ZF7C4NLJVTKOUM","short_pith_number":"pith:53PSJL5O","schema_version":"1.0","canonical_sha256":"eedf24afae5727cc97e2e3569acd4ea3381e7f18c513fcac7b277bfabcc45015","source":{"kind":"arxiv","id":"1907.00853","version":1},"attestation_state":"computed","paper":{"title":"Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Yeo, Hugues Depres, J{\\o}rgen Bang-Jensen","submitted_at":"2019-07-01T15:20:03Z","abstract_excerpt":"A digraph is {\\bf eulerian} if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. A digraph is {\\bf semicomplete} if it has no pair of non-adjacent vertices. A {\\bf tournament} is a semicomplete digraph without directed cycles of length 2. Fraise and Thomassen \\cite{fraisseGC3} proved that every $(k+1)$-strong tournament has a hamiltonian cycle which avoids any prescribed set of $k$ arcs. In \\cite{bangsupereuler} the authors demonstrated that a number of results concerning vertex-c"},"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":"1907.00853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-01T15:20:03Z","cross_cats_sorted":[],"title_canon_sha256":"e9a79df63ef550f4c9ff245de249497efcb09070808d141849056dc7b6790bce","abstract_canon_sha256":"31ba49af6cbecae0ac695648a5be728662bacb5f4f832b87886c3da60484333f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:47.873880Z","signature_b64":"GhhfSx1GQuSlxVbQvbXoKuRtgWK4gaIk5pQOllx8voZcTTlszrVGU8u2ltHoIFsisnhKhZQbM6DTE5h9nAvMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eedf24afae5727cc97e2e3569acd4ea3381e7f18c513fcac7b277bfabcc45015","last_reissued_at":"2026-05-17T23:41:47.873146Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:47.873146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Yeo, Hugues Depres, J{\\o}rgen Bang-Jensen","submitted_at":"2019-07-01T15:20:03Z","abstract_excerpt":"A digraph is {\\bf eulerian} if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. A digraph is {\\bf semicomplete} if it has no pair of non-adjacent vertices. A {\\bf tournament} is a semicomplete digraph without directed cycles of length 2. Fraise and Thomassen \\cite{fraisseGC3} proved that every $(k+1)$-strong tournament has a hamiltonian cycle which avoids any prescribed set of $k$ arcs. In \\cite{bangsupereuler} the authors demonstrated that a number of results concerning vertex-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00853","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":"1907.00853","created_at":"2026-05-17T23:41:47.873309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00853v1","created_at":"2026-05-17T23:41:47.873309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00853","created_at":"2026-05-17T23:41:47.873309+00:00"},{"alias_kind":"pith_short_12","alias_value":"53PSJL5OK4T4","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"53PSJL5OK4T4ZF7C","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"53PSJL5O","created_at":"2026-05-18T12:33:10.108867+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/53PSJL5OK4T4ZF7C4NLJVTKOUM","json":"https://pith.science/pith/53PSJL5OK4T4ZF7C4NLJVTKOUM.json","graph_json":"https://pith.science/api/pith-number/53PSJL5OK4T4ZF7C4NLJVTKOUM/graph.json","events_json":"https://pith.science/api/pith-number/53PSJL5OK4T4ZF7C4NLJVTKOUM/events.json","paper":"https://pith.science/paper/53PSJL5O"},"agent_actions":{"view_html":"https://pith.science/pith/53PSJL5OK4T4ZF7C4NLJVTKOUM","download_json":"https://pith.science/pith/53PSJL5OK4T4ZF7C4NLJVTKOUM.json","view_paper":"https://pith.science/paper/53PSJL5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00853&json=true","fetch_graph":"https://pith.science/api/pith-number/53PSJL5OK4T4ZF7C4NLJVTKOUM/graph.json","fetch_events":"https://pith.science/api/pith-number/53PSJL5OK4T4ZF7C4NLJVTKOUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53PSJL5OK4T4ZF7C4NLJVTKOUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53PSJL5OK4T4ZF7C4NLJVTKOUM/action/storage_attestation","attest_author":"https://pith.science/pith/53PSJL5OK4T4ZF7C4NLJVTKOUM/action/author_attestation","sign_citation":"https://pith.science/pith/53PSJL5OK4T4ZF7C4NLJVTKOUM/action/citation_signature","submit_replication":"https://pith.science/pith/53PSJL5OK4T4ZF7C4NLJVTKOUM/action/replication_record"}},"created_at":"2026-05-17T23:41:47.873309+00:00","updated_at":"2026-05-17T23:41:47.873309+00:00"}