{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:N5N4HVAU27DPTCWU7FORKN6TAX","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":"18e58bafd81fe3c1f5861720a3796c22c3bda95458c5d4f3f6825bc1c9082b5d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-27T06:53:16Z","title_canon_sha256":"6c90baf196fcd8368be1b47dfda4ab43c939d6cc039064efec6fdda488773198"},"schema_version":"1.0","source":{"id":"2410.20353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.20353","created_at":"2026-07-05T09:26:43Z"},{"alias_kind":"arxiv_version","alias_value":"2410.20353v1","created_at":"2026-07-05T09:26:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20353","created_at":"2026-07-05T09:26:43Z"},{"alias_kind":"pith_short_12","alias_value":"N5N4HVAU27DP","created_at":"2026-07-05T09:26:43Z"},{"alias_kind":"pith_short_16","alias_value":"N5N4HVAU27DPTCWU","created_at":"2026-07-05T09:26:43Z"},{"alias_kind":"pith_short_8","alias_value":"N5N4HVAU","created_at":"2026-07-05T09:26:43Z"}],"graph_snapshots":[{"event_id":"sha256:81fab0cbfdb23e974410b49b9bea57159073bf2df4558411db49746873045abb","target":"graph","created_at":"2026-07-05T09:26:43Z","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/2410.20353/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The class of graphs that do not contain a path on $k$ nodes as an induced subgraph ($P_k$-free graphs) has rich applications in the theory of graph algorithms. This paper explores the problem of deciding $P_k$-freeness from the viewpoint of distributed computing.\n  For specific small values of $k$, we present the \\textit{first} $\\mathsf{CONGEST}$ algorithms specified for $P_k$-freeness, utilizing structural properties of $P_k$-free graphs in a novel way. Specifically, we show that $P_k$-freeness can be decided in $\\tilde{O}(1)$ rounds for $k=4$ in the $\\mathsf{broadcast\\;CONGEST}$ model, and i","authors_text":"Masayuki Miyamoto","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-27T06:53:16Z","title":"Distributed Complexity of $P_k$-freeness: Decision and Certification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20353","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:57e8125221c5e47123779ef81127022ddb26f54ee0acfde81b16ba12598aa4d2","target":"record","created_at":"2026-07-05T09:26:43Z","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":"18e58bafd81fe3c1f5861720a3796c22c3bda95458c5d4f3f6825bc1c9082b5d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-27T06:53:16Z","title_canon_sha256":"6c90baf196fcd8368be1b47dfda4ab43c939d6cc039064efec6fdda488773198"},"schema_version":"1.0","source":{"id":"2410.20353","kind":"arxiv","version":1}},"canonical_sha256":"6f5bc3d414d7c6f98ad4f95d1537d305d2b181d4acb1a918f424b0061c1c8d03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f5bc3d414d7c6f98ad4f95d1537d305d2b181d4acb1a918f424b0061c1c8d03","first_computed_at":"2026-07-05T09:26:43.647076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:26:43.647076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cbc3pElgqfcuK59raZTMNNxD3CKmIuW2GgXILixuhJJeyGRG2anFKUGrDGYTFLwKQ0xHDMpxYzgtWR2xyJ6WAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:26:43.647526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.20353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57e8125221c5e47123779ef81127022ddb26f54ee0acfde81b16ba12598aa4d2","sha256:81fab0cbfdb23e974410b49b9bea57159073bf2df4558411db49746873045abb"],"state_sha256":"d69736030f837935a9e806a9b81c1c5f417cba6a2fde7e6e9fe8b26c0b07f087"}