{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:QRRBCVZU7YPUK36O46N3IBYWKM","short_pith_number":"pith:QRRBCVZU","canonical_record":{"source":{"id":"0801.2797","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2008-01-18T00:34:36Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"29ca9807587cbb4bd5ca181732e36bc5e976e9ac269fec592a1e5c81b443694a","abstract_canon_sha256":"ef54c15dd2a6822bad9b1633ebee087e2c28ba434c8903a415765db0b711fe34"},"schema_version":"1.0"},"canonical_sha256":"8462115734fe1f456fcee79bb40716530798c9d252969141d192e1850361b2a7","source":{"kind":"arxiv","id":"0801.2797","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.2797","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"0801.2797v2","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.2797","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"QRRBCVZU7YPU","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"pith_short_16","alias_value":"QRRBCVZU7YPUK36O","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"pith_short_8","alias_value":"QRRBCVZU","created_at":"2026-07-04T15:09:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:QRRBCVZU7YPUK36O46N3IBYWKM","target":"record","payload":{"canonical_record":{"source":{"id":"0801.2797","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2008-01-18T00:34:36Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"29ca9807587cbb4bd5ca181732e36bc5e976e9ac269fec592a1e5c81b443694a","abstract_canon_sha256":"ef54c15dd2a6822bad9b1633ebee087e2c28ba434c8903a415765db0b711fe34"},"schema_version":"1.0"},"canonical_sha256":"8462115734fe1f456fcee79bb40716530798c9d252969141d192e1850361b2a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:09:24.181053Z","signature_b64":"o87tynxeYS1a2DmjM7d9Hv0KUnKg4EnZaz3wnQCQ6XJUXz/Jm5W8NPqldDYYzmWyWZI5JKqrEUeFlt3agNwyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8462115734fe1f456fcee79bb40716530798c9d252969141d192e1850361b2a7","last_reissued_at":"2026-07-04T15:09:24.180721Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:09:24.180721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0801.2797","source_version":2,"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-07-04T15:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YA4oyWgK2cnAweUXGcAw7C/ZBgFCquVsSvoDQMdsBXaGWp1QnKBmjJrupyrBtnc8ZU1/vSmkU9UQdR+TEjKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:38:31.419374Z"},"content_sha256":"94e1ac7c6bfe9ec058c314680d8452a4b6c32ee0a51030dc09c116cdae87036b","schema_version":"1.0","event_id":"sha256:94e1ac7c6bfe9ec058c314680d8452a4b6c32ee0a51030dc09c116cdae87036b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:QRRBCVZU7YPUK36O46N3IBYWKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Every Minor-Closed Property of Sparse Graphs is Testable","license":"","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Itai Benjamini, Oded Schramm","submitted_at":"2008-01-18T00:34:36Z","abstract_excerpt":"Suppose $G$ is a graph with degrees bounded by $d$, and one needs to remove more than $\\epsilon n$ of its edges in order to make it planar. We show that in this case the statistics of local neighborhoods around vertices of $G$ is far from the statistics of local neighborhoods around vertices of any planar graph $G'$ with the same degree bound. In fact, a similar result is proved for any minor-closed property of bounded degree graphs.\n  As an immediate corollary of the above result we infer that many well studied graph properties, like being planar, outer-planar, series-parallel, bounded genus,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.2797","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0801.2797/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hD8OlRPr43ueiLBI+pyNx1A/p0i6XHmlMQNg72SGE4dgfr59rPIDd3j9ePXkb69CP2JZb8lppe6ni+IoEYkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:38:31.420161Z"},"content_sha256":"3c52ef31b6bdec705e59961c93f513ca2e7073f91f2fe960f00fe2707843fcb1","schema_version":"1.0","event_id":"sha256:3c52ef31b6bdec705e59961c93f513ca2e7073f91f2fe960f00fe2707843fcb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRRBCVZU7YPUK36O46N3IBYWKM/bundle.json","state_url":"https://pith.science/pith/QRRBCVZU7YPUK36O46N3IBYWKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRRBCVZU7YPUK36O46N3IBYWKM/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-08-11T07:38:31Z","links":{"resolver":"https://pith.science/pith/QRRBCVZU7YPUK36O46N3IBYWKM","bundle":"https://pith.science/pith/QRRBCVZU7YPUK36O46N3IBYWKM/bundle.json","state":"https://pith.science/pith/QRRBCVZU7YPUK36O46N3IBYWKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRRBCVZU7YPUK36O46N3IBYWKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:QRRBCVZU7YPUK36O46N3IBYWKM","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":"ef54c15dd2a6822bad9b1633ebee087e2c28ba434c8903a415765db0b711fe34","cross_cats_sorted":["math.PR"],"license":"","primary_cat":"math.CO","submitted_at":"2008-01-18T00:34:36Z","title_canon_sha256":"29ca9807587cbb4bd5ca181732e36bc5e976e9ac269fec592a1e5c81b443694a"},"schema_version":"1.0","source":{"id":"0801.2797","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.2797","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"0801.2797v2","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.2797","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"QRRBCVZU7YPU","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"pith_short_16","alias_value":"QRRBCVZU7YPUK36O","created_at":"2026-07-04T15:09:24Z"},{"alias_kind":"pith_short_8","alias_value":"QRRBCVZU","created_at":"2026-07-04T15:09:24Z"}],"graph_snapshots":[{"event_id":"sha256:3c52ef31b6bdec705e59961c93f513ca2e7073f91f2fe960f00fe2707843fcb1","target":"graph","created_at":"2026-07-04T15:09:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0801.2797/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Suppose $G$ is a graph with degrees bounded by $d$, and one needs to remove more than $\\epsilon n$ of its edges in order to make it planar. We show that in this case the statistics of local neighborhoods around vertices of $G$ is far from the statistics of local neighborhoods around vertices of any planar graph $G'$ with the same degree bound. In fact, a similar result is proved for any minor-closed property of bounded degree graphs.\n  As an immediate corollary of the above result we infer that many well studied graph properties, like being planar, outer-planar, series-parallel, bounded genus,","authors_text":"Asaf Shapira, Itai Benjamini, Oded Schramm","cross_cats":["math.PR"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2008-01-18T00:34:36Z","title":"Every Minor-Closed Property of Sparse Graphs is Testable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.2797","kind":"arxiv","version":2},"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:94e1ac7c6bfe9ec058c314680d8452a4b6c32ee0a51030dc09c116cdae87036b","target":"record","created_at":"2026-07-04T15:09:24Z","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":"ef54c15dd2a6822bad9b1633ebee087e2c28ba434c8903a415765db0b711fe34","cross_cats_sorted":["math.PR"],"license":"","primary_cat":"math.CO","submitted_at":"2008-01-18T00:34:36Z","title_canon_sha256":"29ca9807587cbb4bd5ca181732e36bc5e976e9ac269fec592a1e5c81b443694a"},"schema_version":"1.0","source":{"id":"0801.2797","kind":"arxiv","version":2}},"canonical_sha256":"8462115734fe1f456fcee79bb40716530798c9d252969141d192e1850361b2a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8462115734fe1f456fcee79bb40716530798c9d252969141d192e1850361b2a7","first_computed_at":"2026-07-04T15:09:24.180721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:09:24.180721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o87tynxeYS1a2DmjM7d9Hv0KUnKg4EnZaz3wnQCQ6XJUXz/Jm5W8NPqldDYYzmWyWZI5JKqrEUeFlt3agNwyCA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:09:24.181053Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.2797","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94e1ac7c6bfe9ec058c314680d8452a4b6c32ee0a51030dc09c116cdae87036b","sha256:3c52ef31b6bdec705e59961c93f513ca2e7073f91f2fe960f00fe2707843fcb1"],"state_sha256":"eb98f66311999ea4116d7b445e10fc0ae6668f3962fa70b3b2a0517d6f135877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LalRoE2aFYwI1GNzYURPYBn5qYmQEf7WuqkWt8YzbWXNcoZhwJESh2PxsJvNH/THZ1s5uCcNh4H54+9QlTIwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T07:38:31.427354Z","bundle_sha256":"aa6c3a77d48bcec627b4fdf178351e2bc1158292aedb9addfb5a330842f2f0d9"}}