{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KOWG52J32WIWJISBANN6QXHGQW","short_pith_number":"pith:KOWG52J3","schema_version":"1.0","canonical_sha256":"53ac6ee93bd59164a241035be85ce685ae294abe68a2c9876c85cb2f15071e54","source":{"kind":"arxiv","id":"1605.03719","version":1},"attestation_state":"computed","paper":{"title":"Distributed Testing of Excluded Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ioan Todinca, Ivan Rapaport, Pierre Fraigniaud, Ville Salo","submitted_at":"2016-05-12T08:15:54Z","abstract_excerpt":"We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a constant number of rounds, where the constant depends on how far the input graph is from being triangle-free. We show that, for every connected 4-node graph H, testing whether a graph is H-free can be done in a constant number of rounds too. The constant also depends on how far the input graph is from being H-free, and the dependence is identical to the one in the case of testing triangles. Hence, in particular, testing"},"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":"1605.03719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-12T08:15:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4eca503e08adf70435d6241e209c6b6ce46d3a630a6b1c40ea4f5d66f56e53ab","abstract_canon_sha256":"ce269451e133f6f2f3e076036d791a8696c029c4adaad09a5d626b13b4830857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:59.657117Z","signature_b64":"sG1EbZCsHyK2LGRhWyaccElgOHstMf+LPazQwD5wv71GlGIV2LVCFw8Gs1QRX/qI6ODECfnQPTQttAwe1FxMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53ac6ee93bd59164a241035be85ce685ae294abe68a2c9876c85cb2f15071e54","last_reissued_at":"2026-05-18T01:14:59.656576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:59.656576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Testing of Excluded Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ioan Todinca, Ivan Rapaport, Pierre Fraigniaud, Ville Salo","submitted_at":"2016-05-12T08:15:54Z","abstract_excerpt":"We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a constant number of rounds, where the constant depends on how far the input graph is from being triangle-free. We show that, for every connected 4-node graph H, testing whether a graph is H-free can be done in a constant number of rounds too. The constant also depends on how far the input graph is from being H-free, and the dependence is identical to the one in the case of testing triangles. Hence, in particular, testing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03719","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.03719","created_at":"2026-05-18T01:14:59.656646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03719v1","created_at":"2026-05-18T01:14:59.656646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03719","created_at":"2026-05-18T01:14:59.656646+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOWG52J32WIW","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOWG52J32WIWJISB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOWG52J3","created_at":"2026-05-18T12:30:25.849896+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/KOWG52J32WIWJISBANN6QXHGQW","json":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW.json","graph_json":"https://pith.science/api/pith-number/KOWG52J32WIWJISBANN6QXHGQW/graph.json","events_json":"https://pith.science/api/pith-number/KOWG52J32WIWJISBANN6QXHGQW/events.json","paper":"https://pith.science/paper/KOWG52J3"},"agent_actions":{"view_html":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW","download_json":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW.json","view_paper":"https://pith.science/paper/KOWG52J3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03719&json=true","fetch_graph":"https://pith.science/api/pith-number/KOWG52J32WIWJISBANN6QXHGQW/graph.json","fetch_events":"https://pith.science/api/pith-number/KOWG52J32WIWJISBANN6QXHGQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/action/storage_attestation","attest_author":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/action/author_attestation","sign_citation":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/action/citation_signature","submit_replication":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/action/replication_record"}},"created_at":"2026-05-18T01:14:59.656646+00:00","updated_at":"2026-05-18T01:14:59.656646+00:00"}