{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FUID2FEZUB6WFX3EJIR5F67XDP","short_pith_number":"pith:FUID2FEZ","canonical_record":{"source":{"id":"1707.06126","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-19T14:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"c3485216e4cb494acd2d21424a9dc98dd31326647b95ece01dbaad501f909cc7","abstract_canon_sha256":"c1e9effb6fcc20bd9b7d492ed48bf1b61f1d1f1f2fc140a4a0692bfd11031f54"},"schema_version":"1.0"},"canonical_sha256":"2d103d1499a07d62df644a23d2fbf71bc83792fd6aee2596a53addcd008735e3","source":{"kind":"arxiv","id":"1707.06126","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06126","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06126v4","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06126","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"FUID2FEZUB6W","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FUID2FEZUB6WFX3E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FUID2FEZ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FUID2FEZUB6WFX3EJIR5F67XDP","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06126","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-19T14:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"c3485216e4cb494acd2d21424a9dc98dd31326647b95ece01dbaad501f909cc7","abstract_canon_sha256":"c1e9effb6fcc20bd9b7d492ed48bf1b61f1d1f1f2fc140a4a0692bfd11031f54"},"schema_version":"1.0"},"canonical_sha256":"2d103d1499a07d62df644a23d2fbf71bc83792fd6aee2596a53addcd008735e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:36.478776Z","signature_b64":"90zVeNmce424r5GW+qJYegCGLYRJcu+h8C4pFufc6bIWPfA1i5+SIviW3Ln0G+F2f+KP2Vex4UVwnpVWdy8vDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d103d1499a07d62df644a23d2fbf71bc83792fd6aee2596a53addcd008735e3","last_reissued_at":"2026-05-18T00:08:36.478081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:36.478081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06126","source_version":4,"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:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hd1Ji5h5zeI/y381Jbm8KRYyUnBPNkYg66fOcew9dLc7vYFMXd424IIXASyVWwgs1tO8H4GBeFlcukT81QPgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:44:33.835597Z"},"content_sha256":"5ccf1a11b5bea638aaa5c3d487912f0ecb84129ad83a70f8dc7c2aa5e19ddf94","schema_version":"1.0","event_id":"sha256:5ccf1a11b5bea638aaa5c3d487912f0ecb84129ad83a70f8dc7c2aa5e19ddf94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FUID2FEZUB6WFX3EJIR5F67XDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hendrik Fichtenberger, Maximilian W\\\"otzel, Reut Levi, Yadu Vasudev","submitted_at":"2017-07-19T14:44:55Z","abstract_excerpt":"We consider one-sided error property testing of $\\mathcal{F}$-minor freeness in bounded-degree graphs for any finite family of graphs $\\mathcal{F}$ that contains a minor of $K_{2,k}$, the $k$-circus graph, or the $(k\\times 2)$-grid for any $k\\in\\mathbb{N}$. This includes, for instance, testing whether a graph is outerplanar or a cactus graph. The query complexity of our algorithm in terms of the number of vertices in the graph, $n$, is $\\tilde{O}(n^{2/3} / \\epsilon^5)$. Czumaj et~al.\\ showed that cycle-freeness and $C_k$-minor freeness can be tested with query complexity $\\tilde{O}(\\sqrt{n})$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06126","kind":"arxiv","version":4},"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:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lWEBEz4kMQpokg+I+n/LUiMpGr/gHQWs6aUzw5wOPnJ6WydcgXqgl8WGYXc5BX3KW4K9vF7haL7Qskc9ay4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:44:33.836172Z"},"content_sha256":"de1cb0b53fe1be79871a528e8d2e43b1ead0ffc13d583dff9b7c72a866ab1e34","schema_version":"1.0","event_id":"sha256:de1cb0b53fe1be79871a528e8d2e43b1ead0ffc13d583dff9b7c72a866ab1e34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/bundle.json","state_url":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUID2FEZUB6WFX3EJIR5F67XDP/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-27T05:44:33Z","links":{"resolver":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP","bundle":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/bundle.json","state":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUID2FEZUB6WFX3EJIR5F67XDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FUID2FEZUB6WFX3EJIR5F67XDP","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":"c1e9effb6fcc20bd9b7d492ed48bf1b61f1d1f1f2fc140a4a0692bfd11031f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-19T14:44:55Z","title_canon_sha256":"c3485216e4cb494acd2d21424a9dc98dd31326647b95ece01dbaad501f909cc7"},"schema_version":"1.0","source":{"id":"1707.06126","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06126","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06126v4","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06126","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"FUID2FEZUB6W","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FUID2FEZUB6WFX3E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FUID2FEZ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:de1cb0b53fe1be79871a528e8d2e43b1ead0ffc13d583dff9b7c72a866ab1e34","target":"graph","created_at":"2026-05-18T00:08:36Z","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":"We consider one-sided error property testing of $\\mathcal{F}$-minor freeness in bounded-degree graphs for any finite family of graphs $\\mathcal{F}$ that contains a minor of $K_{2,k}$, the $k$-circus graph, or the $(k\\times 2)$-grid for any $k\\in\\mathbb{N}$. This includes, for instance, testing whether a graph is outerplanar or a cactus graph. The query complexity of our algorithm in terms of the number of vertices in the graph, $n$, is $\\tilde{O}(n^{2/3} / \\epsilon^5)$. Czumaj et~al.\\ showed that cycle-freeness and $C_k$-minor freeness can be tested with query complexity $\\tilde{O}(\\sqrt{n})$ ","authors_text":"Hendrik Fichtenberger, Maximilian W\\\"otzel, Reut Levi, Yadu Vasudev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-19T14:44:55Z","title":"A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06126","kind":"arxiv","version":4},"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:5ccf1a11b5bea638aaa5c3d487912f0ecb84129ad83a70f8dc7c2aa5e19ddf94","target":"record","created_at":"2026-05-18T00:08:36Z","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":"c1e9effb6fcc20bd9b7d492ed48bf1b61f1d1f1f2fc140a4a0692bfd11031f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-19T14:44:55Z","title_canon_sha256":"c3485216e4cb494acd2d21424a9dc98dd31326647b95ece01dbaad501f909cc7"},"schema_version":"1.0","source":{"id":"1707.06126","kind":"arxiv","version":4}},"canonical_sha256":"2d103d1499a07d62df644a23d2fbf71bc83792fd6aee2596a53addcd008735e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d103d1499a07d62df644a23d2fbf71bc83792fd6aee2596a53addcd008735e3","first_computed_at":"2026-05-18T00:08:36.478081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:36.478081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"90zVeNmce424r5GW+qJYegCGLYRJcu+h8C4pFufc6bIWPfA1i5+SIviW3Ln0G+F2f+KP2Vex4UVwnpVWdy8vDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:36.478776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06126","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ccf1a11b5bea638aaa5c3d487912f0ecb84129ad83a70f8dc7c2aa5e19ddf94","sha256:de1cb0b53fe1be79871a528e8d2e43b1ead0ffc13d583dff9b7c72a866ab1e34"],"state_sha256":"f9730c96e12f71536cab2c712b51fbf30a06a56ca001a87c8ba54d88e7d6963e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"717rcPRd/ZRh4shVPoVBbNkF6zeJi2tfiyWDmduNLEJFKod19+HxRAoZmFNbq9nUxy/7sAB9hCB/WHo1PFdNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:44:33.839623Z","bundle_sha256":"61a313cb42bdd17108c19d22143d2e5cd0e9eeaaa2e5c8e3989dc8dcb90aa6d5"}}