{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FUID2FEZUB6WFX3EJIR5F67XDP","short_pith_number":"pith:FUID2FEZ","schema_version":"1.0","canonical_sha256":"2d103d1499a07d62df644a23d2fbf71bc83792fd6aee2596a53addcd008735e3","source":{"kind":"arxiv","id":"1707.06126","version":4},"attestation_state":"computed","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})$ "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.06126","created_at":"2026-05-18T00:08:36.478177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06126v4","created_at":"2026-05-18T00:08:36.478177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06126","created_at":"2026-05-18T00:08:36.478177+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUID2FEZUB6W","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUID2FEZUB6WFX3E","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUID2FEZ","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP","json":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP.json","graph_json":"https://pith.science/api/pith-number/FUID2FEZUB6WFX3EJIR5F67XDP/graph.json","events_json":"https://pith.science/api/pith-number/FUID2FEZUB6WFX3EJIR5F67XDP/events.json","paper":"https://pith.science/paper/FUID2FEZ"},"agent_actions":{"view_html":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP","download_json":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP.json","view_paper":"https://pith.science/paper/FUID2FEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06126&json=true","fetch_graph":"https://pith.science/api/pith-number/FUID2FEZUB6WFX3EJIR5F67XDP/graph.json","fetch_events":"https://pith.science/api/pith-number/FUID2FEZUB6WFX3EJIR5F67XDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/action/storage_attestation","attest_author":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/action/author_attestation","sign_citation":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/action/citation_signature","submit_replication":"https://pith.science/pith/FUID2FEZUB6WFX3EJIR5F67XDP/action/replication_record"}},"created_at":"2026-05-18T00:08:36.478177+00:00","updated_at":"2026-05-18T00:08:36.478177+00:00"}