{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KOWG52J32WIWJISBANN6QXHGQW","short_pith_number":"pith:KOWG52J3","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"},"canonical_sha256":"53ac6ee93bd59164a241035be85ce685ae294abe68a2c9876c85cb2f15071e54","source":{"kind":"arxiv","id":"1605.03719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03719","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03719v1","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03719","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"KOWG52J32WIW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KOWG52J32WIWJISB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KOWG52J3","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KOWG52J32WIWJISBANN6QXHGQW","target":"record","payload":{"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"},"canonical_sha256":"53ac6ee93bd59164a241035be85ce685ae294abe68a2c9876c85cb2f15071e54","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"},"source_kind":"arxiv","source_id":"1605.03719","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-18T01:14:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"48ANnv0wG5/6DtfCUguoOou1ZPtz2AvFZdi1qmpDTcdEJJy2kfe9LRPeB8N9LzTcXp9qaeFsszs8KPNvFgb+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:37:54.262310Z"},"content_sha256":"b5c994ca19d3227296072aa70420a74903dfd16597cfaf4160e9cccf8931974d","schema_version":"1.0","event_id":"sha256:b5c994ca19d3227296072aa70420a74903dfd16597cfaf4160e9cccf8931974d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KOWG52J32WIWJISBANN6QXHGQW","target":"graph","payload":{"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"},"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-18T01:14:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxNuNyDvx0xOo/Eo04QwEH/rGi/+mFuepFJWNPTAky05xWMWCIR2yy/e4MyKCL+cWsYNfulzqGC0r63Rsla3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:37:54.262671Z"},"content_sha256":"9a2482e400f1b33299786f04880139d7b323985128d10fdae3ac82e1c76e5dba","schema_version":"1.0","event_id":"sha256:9a2482e400f1b33299786f04880139d7b323985128d10fdae3ac82e1c76e5dba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/bundle.json","state_url":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOWG52J32WIWJISBANN6QXHGQW/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-28T04:37:54Z","links":{"resolver":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW","bundle":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/bundle.json","state":"https://pith.science/pith/KOWG52J32WIWJISBANN6QXHGQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOWG52J32WIWJISBANN6QXHGQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KOWG52J32WIWJISBANN6QXHGQW","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":"ce269451e133f6f2f3e076036d791a8696c029c4adaad09a5d626b13b4830857","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-12T08:15:54Z","title_canon_sha256":"4eca503e08adf70435d6241e209c6b6ce46d3a630a6b1c40ea4f5d66f56e53ab"},"schema_version":"1.0","source":{"id":"1605.03719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03719","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03719v1","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03719","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"KOWG52J32WIW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KOWG52J32WIWJISB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KOWG52J3","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:9a2482e400f1b33299786f04880139d7b323985128d10fdae3ac82e1c76e5dba","target":"graph","created_at":"2026-05-18T01:14:59Z","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 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","authors_text":"Ioan Todinca, Ivan Rapaport, Pierre Fraigniaud, Ville Salo","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-12T08:15:54Z","title":"Distributed Testing of Excluded Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03719","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:b5c994ca19d3227296072aa70420a74903dfd16597cfaf4160e9cccf8931974d","target":"record","created_at":"2026-05-18T01:14:59Z","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":"ce269451e133f6f2f3e076036d791a8696c029c4adaad09a5d626b13b4830857","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-12T08:15:54Z","title_canon_sha256":"4eca503e08adf70435d6241e209c6b6ce46d3a630a6b1c40ea4f5d66f56e53ab"},"schema_version":"1.0","source":{"id":"1605.03719","kind":"arxiv","version":1}},"canonical_sha256":"53ac6ee93bd59164a241035be85ce685ae294abe68a2c9876c85cb2f15071e54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53ac6ee93bd59164a241035be85ce685ae294abe68a2c9876c85cb2f15071e54","first_computed_at":"2026-05-18T01:14:59.656576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:59.656576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sG1EbZCsHyK2LGRhWyaccElgOHstMf+LPazQwD5wv71GlGIV2LVCFw8Gs1QRX/qI6ODECfnQPTQttAwe1FxMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:59.657117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5c994ca19d3227296072aa70420a74903dfd16597cfaf4160e9cccf8931974d","sha256:9a2482e400f1b33299786f04880139d7b323985128d10fdae3ac82e1c76e5dba"],"state_sha256":"26db696aa77292f9c81c74eb1372c8959a987d8033a0a5986f53d2a3ea7ea62f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfmWnVrUXb/J/p2LLED3W26TbPq6hdjAp2ouTPa35UMPBMzH9/d8tYtbPX0XnXYlEGIIL0fqujx+HLGlqf3VAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:37:54.265115Z","bundle_sha256":"54a28d1b6dc92a135fbaaaf077e0cf312a997f9c541768c9547be04795281514"}}