{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N5N4HVAU27DPTCWU7FORKN6TAX","short_pith_number":"pith:N5N4HVAU","schema_version":"1.0","canonical_sha256":"6f5bc3d414d7c6f98ad4f95d1537d305d2b181d4acb1a918f424b0061c1c8d03","source":{"kind":"arxiv","id":"2410.20353","version":1},"attestation_state":"computed","paper":{"title":"Distributed Complexity of $P_k$-freeness: Decision and Certification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Masayuki Miyamoto","submitted_at":"2024-10-27T06:53:16Z","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"},"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":"2410.20353","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-10-27T06:53:16Z","cross_cats_sorted":[],"title_canon_sha256":"6c90baf196fcd8368be1b47dfda4ab43c939d6cc039064efec6fdda488773198","abstract_canon_sha256":"18e58bafd81fe3c1f5861720a3796c22c3bda95458c5d4f3f6825bc1c9082b5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:43.647526Z","signature_b64":"cbc3pElgqfcuK59raZTMNNxD3CKmIuW2GgXILixuhJJeyGRG2anFKUGrDGYTFLwKQ0xHDMpxYzgtWR2xyJ6WAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f5bc3d414d7c6f98ad4f95d1537d305d2b181d4acb1a918f424b0061c1c8d03","last_reissued_at":"2026-07-05T09:26:43.647076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:43.647076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Complexity of $P_k$-freeness: Decision and Certification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Masayuki Miyamoto","submitted_at":"2024-10-27T06:53:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20353","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.20353/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.20353","created_at":"2026-07-05T09:26:43.647137+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20353v1","created_at":"2026-07-05T09:26:43.647137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20353","created_at":"2026-07-05T09:26:43.647137+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5N4HVAU27DP","created_at":"2026-07-05T09:26:43.647137+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5N4HVAU27DPTCWU","created_at":"2026-07-05T09:26:43.647137+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5N4HVAU","created_at":"2026-07-05T09:26:43.647137+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20915","citing_title":"Complexity landscape for local certification","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX","json":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX.json","graph_json":"https://pith.science/api/pith-number/N5N4HVAU27DPTCWU7FORKN6TAX/graph.json","events_json":"https://pith.science/api/pith-number/N5N4HVAU27DPTCWU7FORKN6TAX/events.json","paper":"https://pith.science/paper/N5N4HVAU"},"agent_actions":{"view_html":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX","download_json":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX.json","view_paper":"https://pith.science/paper/N5N4HVAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20353&json=true","fetch_graph":"https://pith.science/api/pith-number/N5N4HVAU27DPTCWU7FORKN6TAX/graph.json","fetch_events":"https://pith.science/api/pith-number/N5N4HVAU27DPTCWU7FORKN6TAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX/action/storage_attestation","attest_author":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX/action/author_attestation","sign_citation":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX/action/citation_signature","submit_replication":"https://pith.science/pith/N5N4HVAU27DPTCWU7FORKN6TAX/action/replication_record"}},"created_at":"2026-07-05T09:26:43.647137+00:00","updated_at":"2026-07-05T09:26:43.647137+00:00"}