{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WHZWYULWYYLA244XYXVXFL3GJH","short_pith_number":"pith:WHZWYULW","schema_version":"1.0","canonical_sha256":"b1f36c5176c6160d7397c5eb72af6649c872467cccfa99be44473b256602e6f8","source":{"kind":"arxiv","id":"2607.13677","version":1},"attestation_state":"computed","paper":{"title":"Local Certification of Vertex and Edge Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Meng-Tsung Tsai, Yi-Jun Chang, Yi-Xuan Lee","submitted_at":"2026-07-15T10:18:36Z","abstract_excerpt":"Local certification is a framework for verifying global graph properties using only local information. In this model, a prover assigns short labels, called certificates, to the vertices of a graph. Each vertex then exchanges certificates with its neighbors and performs a purely local check to determine whether the graph satisfies the desired property. This line of research has led to efficient certification schemes for a broad range of graph classes, including minor-closed families, topological graph classes, and graphs defined by forbidden subgraphs.\n  In this paper, we study the local certif"},"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":"2607.13677","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-15T10:18:36Z","cross_cats_sorted":[],"title_canon_sha256":"8a09eb2a14c67b79ddb16339d20ca96345076bf023e3950d45a251eee99d188a","abstract_canon_sha256":"24069c3a43c82d2a26f863920a3bdc35da6b77fd27cd1111153035260d8656b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:23:00.280613Z","signature_b64":"ddOwjX1oqtZAvsmlPYoXEVY+4G0petAKJt/4/vxNwzEah527cJpL7cQCYcaJ8R3qfODMnuQBYF0W14ACEyawDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1f36c5176c6160d7397c5eb72af6649c872467cccfa99be44473b256602e6f8","last_reissued_at":"2026-07-16T01:23:00.279751Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:23:00.279751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Certification of Vertex and Edge Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Meng-Tsung Tsai, Yi-Jun Chang, Yi-Xuan Lee","submitted_at":"2026-07-15T10:18:36Z","abstract_excerpt":"Local certification is a framework for verifying global graph properties using only local information. In this model, a prover assigns short labels, called certificates, to the vertices of a graph. Each vertex then exchanges certificates with its neighbors and performs a purely local check to determine whether the graph satisfies the desired property. This line of research has led to efficient certification schemes for a broad range of graph classes, including minor-closed families, topological graph classes, and graphs defined by forbidden subgraphs.\n  In this paper, we study the local certif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13677","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/2607.13677/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":"2607.13677","created_at":"2026-07-16T01:23:00.280192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.13677v1","created_at":"2026-07-16T01:23:00.280192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13677","created_at":"2026-07-16T01:23:00.280192+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHZWYULWYYLA","created_at":"2026-07-16T01:23:00.280192+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHZWYULWYYLA244X","created_at":"2026-07-16T01:23:00.280192+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHZWYULW","created_at":"2026-07-16T01:23:00.280192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH","json":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH.json","graph_json":"https://pith.science/api/pith-number/WHZWYULWYYLA244XYXVXFL3GJH/graph.json","events_json":"https://pith.science/api/pith-number/WHZWYULWYYLA244XYXVXFL3GJH/events.json","paper":"https://pith.science/paper/WHZWYULW"},"agent_actions":{"view_html":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH","download_json":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH.json","view_paper":"https://pith.science/paper/WHZWYULW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.13677&json=true","fetch_graph":"https://pith.science/api/pith-number/WHZWYULWYYLA244XYXVXFL3GJH/graph.json","fetch_events":"https://pith.science/api/pith-number/WHZWYULWYYLA244XYXVXFL3GJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH/action/storage_attestation","attest_author":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH/action/author_attestation","sign_citation":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH/action/citation_signature","submit_replication":"https://pith.science/pith/WHZWYULWYYLA244XYXVXFL3GJH/action/replication_record"}},"created_at":"2026-07-16T01:23:00.280192+00:00","updated_at":"2026-07-16T01:23:00.280192+00:00"}