{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3G7BXDMKSSDXDG7VPGMVTDJIBW","short_pith_number":"pith:3G7BXDMK","canonical_record":{"source":{"id":"1312.2994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-10T23:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"73231d1b08d3670f65ca151bd093a5f83d995105700c554279780a8c90acbc1c","abstract_canon_sha256":"b3582e8a0b627bb9d15e382d6f84892f170019fa8fe9c1d0892e5d85420abcf1"},"schema_version":"1.0"},"canonical_sha256":"d9be1b8d8a9487719bf57999598d280d848e8a2172c1182b8fe88c135bccd84d","source":{"kind":"arxiv","id":"1312.2994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2994","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2994v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2994","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"3G7BXDMKSSDX","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3G7BXDMKSSDXDG7V","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3G7BXDMK","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3G7BXDMKSSDXDG7VPGMVTDJIBW","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-10T23:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"73231d1b08d3670f65ca151bd093a5f83d995105700c554279780a8c90acbc1c","abstract_canon_sha256":"b3582e8a0b627bb9d15e382d6f84892f170019fa8fe9c1d0892e5d85420abcf1"},"schema_version":"1.0"},"canonical_sha256":"d9be1b8d8a9487719bf57999598d280d848e8a2172c1182b8fe88c135bccd84d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:00.830425Z","signature_b64":"awE06YE/vgyp9+DLJCwP88Vhk7hvJYBcB8CBs9ZAamx+/sUGFOigdDH776g0UCzx4PO0fkZmeP2ELHQWyabmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9be1b8d8a9487719bf57999598d280d848e8a2172c1182b8fe88c135bccd84d","last_reissued_at":"2026-05-18T03:05:00.829723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:00.829723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2994","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-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8/P1+/HEGDeAbRloWIB3pxCFaP+bdi+3Ktznrz7k+DmaGJ3ChBelXXVqjBN5ouQ3bg5Bs8X4vP4y2rJ5AKKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:29:15.437256Z"},"content_sha256":"876f02970a13414476767d2ece608fa7c5dbfbb34c09f9a94c79af45179d2545","schema_version":"1.0","event_id":"sha256:876f02970a13414476767d2ece608fa7c5dbfbb34c09f9a94c79af45179d2545"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3G7BXDMKSSDXDG7VPGMVTDJIBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A counterexample to sparse removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Jacques Verstraete","submitted_at":"2013-12-10T23:12:45Z","abstract_excerpt":"The Tur\\'{a}n number of a graph $H$, denoted $\\mbox{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph with no subgraph isomorphic to $H$. Solymosi conjectured that if $H$ is any graph and $\\mbox{ex}(n,H) = O(n^{\\alpha})$ where $\\alpha > 1$, then any $n$-vertex graph with the property that each edge lies in exactly one copy of $H$ has $o(n^{\\alpha})$ edges. This can be viewed as conjecturing a possible extension of the removal lemma to sparse graphs, and is well-known to be true when $H$ is a non-bipartite graph, in particular when $H$ is a triangle, due to Ruzsa and Szemer\\'{e}d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2994","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-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKvVmpC2NCRi5VNDWn9BB3u60jAkzTF1+YFYRzRVMVbcfyXtc3jyohwJG3Hb+q1pA4znQsLPZivERXmfjBcqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:29:15.437620Z"},"content_sha256":"eb944006fa8c73c652af03ddcd880601d6f6a32dc9905be4ff38da8b73ea7971","schema_version":"1.0","event_id":"sha256:eb944006fa8c73c652af03ddcd880601d6f6a32dc9905be4ff38da8b73ea7971"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3G7BXDMKSSDXDG7VPGMVTDJIBW/bundle.json","state_url":"https://pith.science/pith/3G7BXDMKSSDXDG7VPGMVTDJIBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3G7BXDMKSSDXDG7VPGMVTDJIBW/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-28T07:29:15Z","links":{"resolver":"https://pith.science/pith/3G7BXDMKSSDXDG7VPGMVTDJIBW","bundle":"https://pith.science/pith/3G7BXDMKSSDXDG7VPGMVTDJIBW/bundle.json","state":"https://pith.science/pith/3G7BXDMKSSDXDG7VPGMVTDJIBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3G7BXDMKSSDXDG7VPGMVTDJIBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3G7BXDMKSSDXDG7VPGMVTDJIBW","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":"b3582e8a0b627bb9d15e382d6f84892f170019fa8fe9c1d0892e5d85420abcf1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-10T23:12:45Z","title_canon_sha256":"73231d1b08d3670f65ca151bd093a5f83d995105700c554279780a8c90acbc1c"},"schema_version":"1.0","source":{"id":"1312.2994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2994","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2994v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2994","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"3G7BXDMKSSDX","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3G7BXDMKSSDXDG7V","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3G7BXDMK","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:eb944006fa8c73c652af03ddcd880601d6f6a32dc9905be4ff38da8b73ea7971","target":"graph","created_at":"2026-05-18T03:05:00Z","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":"The Tur\\'{a}n number of a graph $H$, denoted $\\mbox{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph with no subgraph isomorphic to $H$. Solymosi conjectured that if $H$ is any graph and $\\mbox{ex}(n,H) = O(n^{\\alpha})$ where $\\alpha > 1$, then any $n$-vertex graph with the property that each edge lies in exactly one copy of $H$ has $o(n^{\\alpha})$ edges. This can be viewed as conjecturing a possible extension of the removal lemma to sparse graphs, and is well-known to be true when $H$ is a non-bipartite graph, in particular when $H$ is a triangle, due to Ruzsa and Szemer\\'{e}d","authors_text":"Craig Timmons, Jacques Verstraete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-10T23:12:45Z","title":"A counterexample to sparse removal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2994","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:876f02970a13414476767d2ece608fa7c5dbfbb34c09f9a94c79af45179d2545","target":"record","created_at":"2026-05-18T03:05:00Z","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":"b3582e8a0b627bb9d15e382d6f84892f170019fa8fe9c1d0892e5d85420abcf1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-10T23:12:45Z","title_canon_sha256":"73231d1b08d3670f65ca151bd093a5f83d995105700c554279780a8c90acbc1c"},"schema_version":"1.0","source":{"id":"1312.2994","kind":"arxiv","version":1}},"canonical_sha256":"d9be1b8d8a9487719bf57999598d280d848e8a2172c1182b8fe88c135bccd84d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9be1b8d8a9487719bf57999598d280d848e8a2172c1182b8fe88c135bccd84d","first_computed_at":"2026-05-18T03:05:00.829723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:00.829723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"awE06YE/vgyp9+DLJCwP88Vhk7hvJYBcB8CBs9ZAamx+/sUGFOigdDH776g0UCzx4PO0fkZmeP2ELHQWyabmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:00.830425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:876f02970a13414476767d2ece608fa7c5dbfbb34c09f9a94c79af45179d2545","sha256:eb944006fa8c73c652af03ddcd880601d6f6a32dc9905be4ff38da8b73ea7971"],"state_sha256":"8e2ab8ce17cdffa7bcb189a067153b6a92559ca7b00ae0315836cfbd6f8805db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqquVosnbvh3r3AL9veGOb5sbjUshL61uRA/AIdZOOVrdm4fWAVvHim9vLP1L8CsdYxTTrIBknQFVBOAd6ZICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:29:15.439681Z","bundle_sha256":"a0b16b5a731b31c2d6dab30a3854fdb48308173a07e0d0471bb16c98aa79f944"}}