{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FSGO6NUFWL2MO6PUXJVAZNHVOX","short_pith_number":"pith:FSGO6NUF","schema_version":"1.0","canonical_sha256":"2c8cef3685b2f4c779f4ba6a0cb4f575f0b8ed10740aa8a2c324bfb4b84c6cc4","source":{"kind":"arxiv","id":"2502.00676","version":1},"attestation_state":"computed","paper":{"title":"Optimal local certification on graphs of bounded pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dan Alden Baterisna, Yi-Jun Chang","submitted_at":"2025-02-02T05:28:08Z","abstract_excerpt":"We present proof labeling schemes for graphs with bounded pathwidth that can decide any graph property expressible in monadic second-order (MSO) logic using $O(\\log n)$-bit vertex labels. Examples of such properties include planarity, Hamiltonicity, $k$-colorability, $H$-minor-freeness, admitting a perfect matching, and having a vertex cover of a given size.\n  Our proof labeling schemes improve upon a recent result by Fraigniaud, Montealegre, Rapaport, and Todinca (Algorithmica 2024), which achieved the same result for graphs of bounded treewidth but required $O(\\log^2 n)$-bit labels. Our impr"},"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":"2502.00676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-02-02T05:28:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2c17eb0bc3420e5678bfe4a0e44a97293479b1a65febc6f6dabbb3a5576e5f4d","abstract_canon_sha256":"fc25175319d4b9eb6b340b01e35895bbcc555f31df75afd0c37ce3c45c7d11b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:36.995629Z","signature_b64":"mU+dOelleWNxX6FF6skjnsMIuRLsbMjEghDULM15Wumdsxb20Jkd3uqhd5I5N9OjncLD+D3K0oNfsW74lQc7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c8cef3685b2f4c779f4ba6a0cb4f575f0b8ed10740aa8a2c324bfb4b84c6cc4","last_reissued_at":"2026-07-05T10:08:36.995203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:36.995203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal local certification on graphs of bounded pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dan Alden Baterisna, Yi-Jun Chang","submitted_at":"2025-02-02T05:28:08Z","abstract_excerpt":"We present proof labeling schemes for graphs with bounded pathwidth that can decide any graph property expressible in monadic second-order (MSO) logic using $O(\\log n)$-bit vertex labels. Examples of such properties include planarity, Hamiltonicity, $k$-colorability, $H$-minor-freeness, admitting a perfect matching, and having a vertex cover of a given size.\n  Our proof labeling schemes improve upon a recent result by Fraigniaud, Montealegre, Rapaport, and Todinca (Algorithmica 2024), which achieved the same result for graphs of bounded treewidth but required $O(\\log^2 n)$-bit labels. Our impr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00676","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/2502.00676/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":"2502.00676","created_at":"2026-07-05T10:08:36.995258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.00676v1","created_at":"2026-07-05T10:08:36.995258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00676","created_at":"2026-07-05T10:08:36.995258+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSGO6NUFWL2M","created_at":"2026-07-05T10:08:36.995258+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSGO6NUFWL2MO6PU","created_at":"2026-07-05T10:08:36.995258+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSGO6NUF","created_at":"2026-07-05T10:08:36.995258+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":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX","json":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX.json","graph_json":"https://pith.science/api/pith-number/FSGO6NUFWL2MO6PUXJVAZNHVOX/graph.json","events_json":"https://pith.science/api/pith-number/FSGO6NUFWL2MO6PUXJVAZNHVOX/events.json","paper":"https://pith.science/paper/FSGO6NUF"},"agent_actions":{"view_html":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX","download_json":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX.json","view_paper":"https://pith.science/paper/FSGO6NUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.00676&json=true","fetch_graph":"https://pith.science/api/pith-number/FSGO6NUFWL2MO6PUXJVAZNHVOX/graph.json","fetch_events":"https://pith.science/api/pith-number/FSGO6NUFWL2MO6PUXJVAZNHVOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/action/storage_attestation","attest_author":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/action/author_attestation","sign_citation":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/action/citation_signature","submit_replication":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/action/replication_record"}},"created_at":"2026-07-05T10:08:36.995258+00:00","updated_at":"2026-07-05T10:08:36.995258+00:00"}