{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7Q7CUCZGHO2LBLGDFVPHAYHUOR","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":"8cf8d45dcfd4589323e470f4b74c6e7986dcb343f6a2d6e3f4aaee42771f8cc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T07:46:16Z","title_canon_sha256":"db4c66a5eb307958ba300cb8a3a19fe3bdf7d320328020bc2d127c1d02614d69"},"schema_version":"1.0","source":{"id":"1709.08159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08159","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08159v1","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08159","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"7Q7CUCZGHO2L","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7Q7CUCZGHO2LBLGD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7Q7CUCZG","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:c6c08fcd0ce652b27b2a912a22e64fbb06b9d30ba3998e5b5da82633733085b4","target":"graph","created_at":"2026-05-18T00:34:27Z","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":"Obtaining an efficient bound for the triangle removal lemma is one of the most outstanding open problems of extremal combinatorics. Perhaps the main bottleneck for achieving this goal is that triangle-free graphs can be highly unstructured. For example, triangle-free graphs might have only regular partitions (in the sense of Szemer\\'edi) of tower-type size. And indeed, essentially all the graph properties ${\\cal P}$ for which removal lemmas with reasonable bounds were obtained, are such that every graph satisfying ${\\cal P}$ has a small regular partition. So in some sense, a barrier for obtain","authors_text":"Asaf Shapira, Lior Gishboliner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T07:46:16Z","title":"Efficient Removal without Efficient Regularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08159","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:51ac0985b45c687f1f1cb46e3f11207398dbd87c3fcc8806f003c75f0011ff5b","target":"record","created_at":"2026-05-18T00:34:27Z","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":"8cf8d45dcfd4589323e470f4b74c6e7986dcb343f6a2d6e3f4aaee42771f8cc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T07:46:16Z","title_canon_sha256":"db4c66a5eb307958ba300cb8a3a19fe3bdf7d320328020bc2d127c1d02614d69"},"schema_version":"1.0","source":{"id":"1709.08159","kind":"arxiv","version":1}},"canonical_sha256":"fc3e2a0b263bb4b0acc32d5e7060f474420c13e29388ffbf8108c3c5fcf6ca7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc3e2a0b263bb4b0acc32d5e7060f474420c13e29388ffbf8108c3c5fcf6ca7d","first_computed_at":"2026-05-18T00:34:27.820994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:27.820994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fwwkVOCwv5DUlUsALZVfwfwIX4k9Y5Mu9zF0myjXJ0jGF4dPR+wjcieja/0MmkKky+SQ3Z82z8hbbIN+04IXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:27.821466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51ac0985b45c687f1f1cb46e3f11207398dbd87c3fcc8806f003c75f0011ff5b","sha256:c6c08fcd0ce652b27b2a912a22e64fbb06b9d30ba3998e5b5da82633733085b4"],"state_sha256":"3450bffce703411493de7e180edd0fed3f08fa6f54a43212d50b45d04642468a"}