{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7Q7CUCZGHO2LBLGDFVPHAYHUOR","short_pith_number":"pith:7Q7CUCZG","canonical_record":{"source":{"id":"1709.08159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T07:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"db4c66a5eb307958ba300cb8a3a19fe3bdf7d320328020bc2d127c1d02614d69","abstract_canon_sha256":"8cf8d45dcfd4589323e470f4b74c6e7986dcb343f6a2d6e3f4aaee42771f8cc7"},"schema_version":"1.0"},"canonical_sha256":"fc3e2a0b263bb4b0acc32d5e7060f474420c13e29388ffbf8108c3c5fcf6ca7d","source":{"kind":"arxiv","id":"1709.08159","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7Q7CUCZGHO2LBLGDFVPHAYHUOR","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T07:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"db4c66a5eb307958ba300cb8a3a19fe3bdf7d320328020bc2d127c1d02614d69","abstract_canon_sha256":"8cf8d45dcfd4589323e470f4b74c6e7986dcb343f6a2d6e3f4aaee42771f8cc7"},"schema_version":"1.0"},"canonical_sha256":"fc3e2a0b263bb4b0acc32d5e7060f474420c13e29388ffbf8108c3c5fcf6ca7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:27.821466Z","signature_b64":"fwwkVOCwv5DUlUsALZVfwfwIX4k9Y5Mu9zF0myjXJ0jGF4dPR+wjcieja/0MmkKky+SQ3Z82z8hbbIN+04IXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc3e2a0b263bb4b0acc32d5e7060f474420c13e29388ffbf8108c3c5fcf6ca7d","last_reissued_at":"2026-05-18T00:34:27.820994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:27.820994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08159","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:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccJYjR0uh5GsgUct0pY3Rq0nSIDh80VTJ1P+kl2syAKiDDrlLSjwgYh/lNr2WFuLIh0aLJUnVE0AGiDtkU2yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:13:04.351565Z"},"content_sha256":"51ac0985b45c687f1f1cb46e3f11207398dbd87c3fcc8806f003c75f0011ff5b","schema_version":"1.0","event_id":"sha256:51ac0985b45c687f1f1cb46e3f11207398dbd87c3fcc8806f003c75f0011ff5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7Q7CUCZGHO2LBLGDFVPHAYHUOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Removal without Efficient Regularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Lior Gishboliner","submitted_at":"2017-09-24T07:46:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08159","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:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ue2Udc5IlWcV5Yh0fEaitOkcXmm2YywgKH0kb7CHPXTNExVoZeUb1ciiqEJUhn/AWj6zVwymDCk8Z3h+xH/KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:13:04.351911Z"},"content_sha256":"c6c08fcd0ce652b27b2a912a22e64fbb06b9d30ba3998e5b5da82633733085b4","schema_version":"1.0","event_id":"sha256:c6c08fcd0ce652b27b2a912a22e64fbb06b9d30ba3998e5b5da82633733085b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Q7CUCZGHO2LBLGDFVPHAYHUOR/bundle.json","state_url":"https://pith.science/pith/7Q7CUCZGHO2LBLGDFVPHAYHUOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Q7CUCZGHO2LBLGDFVPHAYHUOR/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-06-03T18:13:04Z","links":{"resolver":"https://pith.science/pith/7Q7CUCZGHO2LBLGDFVPHAYHUOR","bundle":"https://pith.science/pith/7Q7CUCZGHO2LBLGDFVPHAYHUOR/bundle.json","state":"https://pith.science/pith/7Q7CUCZGHO2LBLGDFVPHAYHUOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Q7CUCZGHO2LBLGDFVPHAYHUOR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xk4lQJ1vqlsyPDWg5T7BM6AIbVzOO1G8a7py1Q6m6e+VkcsqiCXgdNhfoAVLTKxxeT29em+nCvcx8rfSk1ZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:13:04.353827Z","bundle_sha256":"628452f4b7f1d50dcceca03da13302a6d569d3ed0e122d38ddf77aea4dc85598"}}