{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FSGO6NUFWL2MO6PUXJVAZNHVOX","short_pith_number":"pith:FSGO6NUF","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"},"canonical_sha256":"2c8cef3685b2f4c779f4ba6a0cb4f575f0b8ed10740aa8a2c324bfb4b84c6cc4","source":{"kind":"arxiv","id":"2502.00676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00676","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00676v1","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00676","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"FSGO6NUFWL2M","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"pith_short_16","alias_value":"FSGO6NUFWL2MO6PU","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"pith_short_8","alias_value":"FSGO6NUF","created_at":"2026-07-05T10:08:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FSGO6NUFWL2MO6PUXJVAZNHVOX","target":"record","payload":{"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"},"canonical_sha256":"2c8cef3685b2f4c779f4ba6a0cb4f575f0b8ed10740aa8a2c324bfb4b84c6cc4","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"},"source_kind":"arxiv","source_id":"2502.00676","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-07-05T10:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcudAfVH9wHMLt2aQLzl1mjnQz2yCY0/Tk0JHkTrB3VhpbDgOKSppNKpxG8/GsoUvzWNKJ0DeM831VdzTjReDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:55:20.544780Z"},"content_sha256":"dbc924e5c5d28756d3c43a78b415f3fdee6d1d1fa780f5be616a2fffec37fb34","schema_version":"1.0","event_id":"sha256:dbc924e5c5d28756d3c43a78b415f3fdee6d1d1fa780f5be616a2fffec37fb34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FSGO6NUFWL2MO6PUXJVAZNHVOX","target":"graph","payload":{"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"},"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-07-05T10:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdFTvlUwBczjPwMNl2PTR0FjVIIdGo9JRdBJEzwLDAmLiBmeHI/7C48gpoNPxmFLPEVTqzKgL5Z3QGScj9ZNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:55:20.545303Z"},"content_sha256":"b5f4a262a4aa4fd46c1e4f79fa4b65522d95417f38e88b9266e2a185d3d93634","schema_version":"1.0","event_id":"sha256:b5f4a262a4aa4fd46c1e4f79fa4b65522d95417f38e88b9266e2a185d3d93634"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/bundle.json","state_url":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/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-08-09T05:55:20Z","links":{"resolver":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX","bundle":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/bundle.json","state":"https://pith.science/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSGO6NUFWL2MO6PUXJVAZNHVOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FSGO6NUFWL2MO6PUXJVAZNHVOX","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":"fc25175319d4b9eb6b340b01e35895bbcc555f31df75afd0c37ce3c45c7d11b8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-02-02T05:28:08Z","title_canon_sha256":"2c17eb0bc3420e5678bfe4a0e44a97293479b1a65febc6f6dabbb3a5576e5f4d"},"schema_version":"1.0","source":{"id":"2502.00676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00676","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00676v1","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00676","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"FSGO6NUFWL2M","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"pith_short_16","alias_value":"FSGO6NUFWL2MO6PU","created_at":"2026-07-05T10:08:36Z"},{"alias_kind":"pith_short_8","alias_value":"FSGO6NUF","created_at":"2026-07-05T10:08:36Z"}],"graph_snapshots":[{"event_id":"sha256:b5f4a262a4aa4fd46c1e4f79fa4b65522d95417f38e88b9266e2a185d3d93634","target":"graph","created_at":"2026-07-05T10:08:36Z","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/2502.00676/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dan Alden Baterisna, Yi-Jun Chang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-02-02T05:28:08Z","title":"Optimal local certification on graphs of bounded pathwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00676","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:dbc924e5c5d28756d3c43a78b415f3fdee6d1d1fa780f5be616a2fffec37fb34","target":"record","created_at":"2026-07-05T10:08:36Z","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":"fc25175319d4b9eb6b340b01e35895bbcc555f31df75afd0c37ce3c45c7d11b8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-02-02T05:28:08Z","title_canon_sha256":"2c17eb0bc3420e5678bfe4a0e44a97293479b1a65febc6f6dabbb3a5576e5f4d"},"schema_version":"1.0","source":{"id":"2502.00676","kind":"arxiv","version":1}},"canonical_sha256":"2c8cef3685b2f4c779f4ba6a0cb4f575f0b8ed10740aa8a2c324bfb4b84c6cc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c8cef3685b2f4c779f4ba6a0cb4f575f0b8ed10740aa8a2c324bfb4b84c6cc4","first_computed_at":"2026-07-05T10:08:36.995203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:36.995203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mU+dOelleWNxX6FF6skjnsMIuRLsbMjEghDULM15Wumdsxb20Jkd3uqhd5I5N9OjncLD+D3K0oNfsW74lQc7DA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:36.995629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbc924e5c5d28756d3c43a78b415f3fdee6d1d1fa780f5be616a2fffec37fb34","sha256:b5f4a262a4aa4fd46c1e4f79fa4b65522d95417f38e88b9266e2a185d3d93634"],"state_sha256":"53c5d12d8b17480cacf47f3e3bab9485d4bba5447f175cf8429244e795888425"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iywv0T/t6DNhEmw4dYIMedJ/fxKWqd1jkaft2T7M/Jz0+w7Ujkl3JFHoD9duJdgYAbQRyzuiWwL5KZYwnPQfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T05:55:20.551113Z","bundle_sha256":"0c0058858c05b6c026fae2422bbd1ef4511ed16aac6db03e9a8156f3c459c95f"}}