{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PHSBG6GH7ISBIH5N7C52FZDD65","short_pith_number":"pith:PHSBG6GH","schema_version":"1.0","canonical_sha256":"79e41378c7fa24141fadf8bba2e463f778625c5ac04dbaa2a3e83df0494eafc9","source":{"kind":"arxiv","id":"1708.02441","version":1},"attestation_state":"computed","paper":{"title":"Cycle reversions and dichromatic number in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Daniel T. Soukup, Paul Ellis","submitted_at":"2017-08-08T10:38:18Z","abstract_excerpt":"We show that if $D$ is a tournament of arbitrary size then $D$ has finite strong components after reversing a locally finite sequence of cycles. In turn, we prove that any tournament can be covered by two acyclic sets after reversing a locally finite sequence of cycles. This provides a partial solution to a conjecture of S. Thomass\\'e."},"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":"1708.02441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T10:38:18Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"53f30f59287b9d7d203927127f5ef9e5c29dabc299b114ee7baf75c1322532f1","abstract_canon_sha256":"8ea6fba053b0c1911d99b0f7a00be60c69a1b83ca1a665141f68e2e08441a976"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:24.251115Z","signature_b64":"scAZrOtIA1R8Llz2UjYqrdKuV9UZzQ+tB5omQLsvHg4ZaxvlPkPQTGEEVG+U9kiQx06C0rERkgWbPzNEe1s7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e41378c7fa24141fadf8bba2e463f778625c5ac04dbaa2a3e83df0494eafc9","last_reissued_at":"2026-05-18T00:38:24.250475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:24.250475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle reversions and dichromatic number in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Daniel T. Soukup, Paul Ellis","submitted_at":"2017-08-08T10:38:18Z","abstract_excerpt":"We show that if $D$ is a tournament of arbitrary size then $D$ has finite strong components after reversing a locally finite sequence of cycles. In turn, we prove that any tournament can be covered by two acyclic sets after reversing a locally finite sequence of cycles. This provides a partial solution to a conjecture of S. Thomass\\'e."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02441","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":"1708.02441","created_at":"2026-05-18T00:38:24.250567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02441v1","created_at":"2026-05-18T00:38:24.250567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02441","created_at":"2026-05-18T00:38:24.250567+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHSBG6GH7ISB","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHSBG6GH7ISBIH5N","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHSBG6GH","created_at":"2026-05-18T12:31:37.085036+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/PHSBG6GH7ISBIH5N7C52FZDD65","json":"https://pith.science/pith/PHSBG6GH7ISBIH5N7C52FZDD65.json","graph_json":"https://pith.science/api/pith-number/PHSBG6GH7ISBIH5N7C52FZDD65/graph.json","events_json":"https://pith.science/api/pith-number/PHSBG6GH7ISBIH5N7C52FZDD65/events.json","paper":"https://pith.science/paper/PHSBG6GH"},"agent_actions":{"view_html":"https://pith.science/pith/PHSBG6GH7ISBIH5N7C52FZDD65","download_json":"https://pith.science/pith/PHSBG6GH7ISBIH5N7C52FZDD65.json","view_paper":"https://pith.science/paper/PHSBG6GH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02441&json=true","fetch_graph":"https://pith.science/api/pith-number/PHSBG6GH7ISBIH5N7C52FZDD65/graph.json","fetch_events":"https://pith.science/api/pith-number/PHSBG6GH7ISBIH5N7C52FZDD65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHSBG6GH7ISBIH5N7C52FZDD65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHSBG6GH7ISBIH5N7C52FZDD65/action/storage_attestation","attest_author":"https://pith.science/pith/PHSBG6GH7ISBIH5N7C52FZDD65/action/author_attestation","sign_citation":"https://pith.science/pith/PHSBG6GH7ISBIH5N7C52FZDD65/action/citation_signature","submit_replication":"https://pith.science/pith/PHSBG6GH7ISBIH5N7C52FZDD65/action/replication_record"}},"created_at":"2026-05-18T00:38:24.250567+00:00","updated_at":"2026-05-18T00:38:24.250567+00:00"}