{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XU5DCITBTZARG7L6R3DLU3SCNA","short_pith_number":"pith:XU5DCITB","schema_version":"1.0","canonical_sha256":"bd3a3122619e41137d7e8ec6ba6e426833c55f1c73d28fb6b1f4a7bcb40f5f88","source":{"kind":"arxiv","id":"1710.05317","version":1},"attestation_state":"computed","paper":{"title":"The Removal Lemma for Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Jacob Fox, Lior Gishboliner, Raphael Yuster","submitted_at":"2017-10-15T11:27:17Z","abstract_excerpt":"Suppose one needs to change the direction of at least $\\epsilon n^2$ edges of an $n$-vertex tournament $T$, in order to make it $H$-free. A standard application of the regularity method shows that in this case $T$ contains at least $f^*_H(\\epsilon)n^h$ copies of $H$, where $f^*_H$ is some tower-type function. It has long been observed that many graph/digraph problems become easier when assuming that the host graph is a tournament. It is thus natural to ask if the removal lemma becomes easier if we assume that the digraph $G$ is a tournament.\n  Our main result here is a precise characterization"},"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":"1710.05317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-15T11:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"da3eccb20d0a579f578dc72c8d878f3f1b2adb7a5d734df38b0ee30b80431e45","abstract_canon_sha256":"3884f1f81684f7f32f965a4b4384e8509629b5e591391a17afa1195d3314f7a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:51.541799Z","signature_b64":"v//z5MZO14HMRbsFvd5F94S7AipE2xL6N+HH3VJbl6gx+deK++uJEUFdehs4oJwNdP0jX12GRflcVcaQ7L/FAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd3a3122619e41137d7e8ec6ba6e426833c55f1c73d28fb6b1f4a7bcb40f5f88","last_reissued_at":"2026-05-18T00:32:51.541194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:51.541194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Removal Lemma for Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Jacob Fox, Lior Gishboliner, Raphael Yuster","submitted_at":"2017-10-15T11:27:17Z","abstract_excerpt":"Suppose one needs to change the direction of at least $\\epsilon n^2$ edges of an $n$-vertex tournament $T$, in order to make it $H$-free. A standard application of the regularity method shows that in this case $T$ contains at least $f^*_H(\\epsilon)n^h$ copies of $H$, where $f^*_H$ is some tower-type function. It has long been observed that many graph/digraph problems become easier when assuming that the host graph is a tournament. It is thus natural to ask if the removal lemma becomes easier if we assume that the digraph $G$ is a tournament.\n  Our main result here is a precise characterization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05317","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":"1710.05317","created_at":"2026-05-18T00:32:51.541289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05317v1","created_at":"2026-05-18T00:32:51.541289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05317","created_at":"2026-05-18T00:32:51.541289+00:00"},{"alias_kind":"pith_short_12","alias_value":"XU5DCITBTZAR","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XU5DCITBTZARG7L6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XU5DCITB","created_at":"2026-05-18T12:31:56.362134+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/XU5DCITBTZARG7L6R3DLU3SCNA","json":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA.json","graph_json":"https://pith.science/api/pith-number/XU5DCITBTZARG7L6R3DLU3SCNA/graph.json","events_json":"https://pith.science/api/pith-number/XU5DCITBTZARG7L6R3DLU3SCNA/events.json","paper":"https://pith.science/paper/XU5DCITB"},"agent_actions":{"view_html":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA","download_json":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA.json","view_paper":"https://pith.science/paper/XU5DCITB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05317&json=true","fetch_graph":"https://pith.science/api/pith-number/XU5DCITBTZARG7L6R3DLU3SCNA/graph.json","fetch_events":"https://pith.science/api/pith-number/XU5DCITBTZARG7L6R3DLU3SCNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/action/storage_attestation","attest_author":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/action/author_attestation","sign_citation":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/action/citation_signature","submit_replication":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/action/replication_record"}},"created_at":"2026-05-18T00:32:51.541289+00:00","updated_at":"2026-05-18T00:32:51.541289+00:00"}