{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XU5DCITBTZARG7L6R3DLU3SCNA","short_pith_number":"pith:XU5DCITB","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"},"canonical_sha256":"bd3a3122619e41137d7e8ec6ba6e426833c55f1c73d28fb6b1f4a7bcb40f5f88","source":{"kind":"arxiv","id":"1710.05317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05317","created_at":"2026-05-18T00:32:51Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05317v1","created_at":"2026-05-18T00:32:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05317","created_at":"2026-05-18T00:32:51Z"},{"alias_kind":"pith_short_12","alias_value":"XU5DCITBTZAR","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XU5DCITBTZARG7L6","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XU5DCITB","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XU5DCITBTZARG7L6R3DLU3SCNA","target":"record","payload":{"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"},"canonical_sha256":"bd3a3122619e41137d7e8ec6ba6e426833c55f1c73d28fb6b1f4a7bcb40f5f88","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"},"source_kind":"arxiv","source_id":"1710.05317","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-18T00:32:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"arztj3mSF0gnBauEcKNa1XFQl0+hr7EHAJ1zjJMxanwA0ePwGsnF6xP87I0BNKz7kimOeoIsuM8332FXIdBwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:54:16.500267Z"},"content_sha256":"abbe4e282808fde65b8da134a857160ac2808d012413bd16e6be9752a8bfb376","schema_version":"1.0","event_id":"sha256:abbe4e282808fde65b8da134a857160ac2808d012413bd16e6be9752a8bfb376"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XU5DCITBTZARG7L6R3DLU3SCNA","target":"graph","payload":{"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"},"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-18T00:32:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfRYTZ9dkDTk5LJDIKUgTgha9ViFB1U9ikubifos9Ulehe/6zdQO6QW6tFZxcHLmM5dnyf1shK0H/Eq3IUS8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:54:16.500952Z"},"content_sha256":"963d29998d01b7756edb4b7886aabb2766b0424329b4ba65fe2ea0aab01efb50","schema_version":"1.0","event_id":"sha256:963d29998d01b7756edb4b7886aabb2766b0424329b4ba65fe2ea0aab01efb50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/bundle.json","state_url":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XU5DCITBTZARG7L6R3DLU3SCNA/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-18T16:54:16Z","links":{"resolver":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA","bundle":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/bundle.json","state":"https://pith.science/pith/XU5DCITBTZARG7L6R3DLU3SCNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XU5DCITBTZARG7L6R3DLU3SCNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XU5DCITBTZARG7L6R3DLU3SCNA","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":"3884f1f81684f7f32f965a4b4384e8509629b5e591391a17afa1195d3314f7a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-15T11:27:17Z","title_canon_sha256":"da3eccb20d0a579f578dc72c8d878f3f1b2adb7a5d734df38b0ee30b80431e45"},"schema_version":"1.0","source":{"id":"1710.05317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05317","created_at":"2026-05-18T00:32:51Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05317v1","created_at":"2026-05-18T00:32:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05317","created_at":"2026-05-18T00:32:51Z"},{"alias_kind":"pith_short_12","alias_value":"XU5DCITBTZAR","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XU5DCITBTZARG7L6","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XU5DCITB","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:963d29998d01b7756edb4b7886aabb2766b0424329b4ba65fe2ea0aab01efb50","target":"graph","created_at":"2026-05-18T00:32:51Z","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":"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","authors_text":"Asaf Shapira, Jacob Fox, Lior Gishboliner, Raphael Yuster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-15T11:27:17Z","title":"The Removal Lemma for Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05317","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:abbe4e282808fde65b8da134a857160ac2808d012413bd16e6be9752a8bfb376","target":"record","created_at":"2026-05-18T00:32:51Z","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":"3884f1f81684f7f32f965a4b4384e8509629b5e591391a17afa1195d3314f7a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-15T11:27:17Z","title_canon_sha256":"da3eccb20d0a579f578dc72c8d878f3f1b2adb7a5d734df38b0ee30b80431e45"},"schema_version":"1.0","source":{"id":"1710.05317","kind":"arxiv","version":1}},"canonical_sha256":"bd3a3122619e41137d7e8ec6ba6e426833c55f1c73d28fb6b1f4a7bcb40f5f88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd3a3122619e41137d7e8ec6ba6e426833c55f1c73d28fb6b1f4a7bcb40f5f88","first_computed_at":"2026-05-18T00:32:51.541194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:51.541194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v//z5MZO14HMRbsFvd5F94S7AipE2xL6N+HH3VJbl6gx+deK++uJEUFdehs4oJwNdP0jX12GRflcVcaQ7L/FAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:51.541799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abbe4e282808fde65b8da134a857160ac2808d012413bd16e6be9752a8bfb376","sha256:963d29998d01b7756edb4b7886aabb2766b0424329b4ba65fe2ea0aab01efb50"],"state_sha256":"cf982d2b51e02aa74a9d51f7022a98712cda0481b809fd40a5850fa536ccb1f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kc/x5HiRjKAnZJL4dZUKmaDNKxuTXIa+xD8sYOqSEsf5vhsIcHNR1KFrILkF+p9UAFP5X9JVccdedJwr/NtQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T16:54:16.502942Z","bundle_sha256":"ea5a2c9507d0baa513cd6f1ea247bd656f5c351eac20e6d99924578b8ecd5cd6"}}