{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2CLUNWMW46ODCBGY4H4GFEAQNA","short_pith_number":"pith:2CLUNWMW","schema_version":"1.0","canonical_sha256":"d09746d996e79c3104d8e1f8629010681ba3e92c92980f574fd4935269a8ab85","source":{"kind":"arxiv","id":"2505.20915","version":1},"attestation_state":"computed","paper":{"title":"Complexity landscape for local certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Laurent Feuilloley, Nicolas Bousquet, S\\'ebastien Zeitoun","submitted_at":"2025-05-27T09:08:00Z","abstract_excerpt":"An impressive recent line of work has charted the complexity landscape of distributed graph algorithms. For many settings, it has been determined which time complexities exist, and which do not (in the sense that no local problem could have an optimal algorithm with that complexity). In this paper, we initiate the study of the landscape for space complexity of distributed graph algorithms. More precisely, we focus on the local certification setting, where a prover assigns certificates to nodes to certify a property, and where the space complexity is measured by the size of the certificates.\n  "},"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":"2505.20915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-27T09:08:00Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"07a7c05e380fef7892472082236716720df41b59aad89c01a89b160954cd2be1","abstract_canon_sha256":"fd0eec4b46f86f73945b2a10d89ffd455ccc26d199f13520ae0186e7239a2fce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:20.921559Z","signature_b64":"ymZRmsf0WLFI9vR5NQYmG6SxERVMN7VT94IKLGEZreI8Wyc3cdTUGXBZeRHo8jPuLvRo05nhUNcp8kSRyhWPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d09746d996e79c3104d8e1f8629010681ba3e92c92980f574fd4935269a8ab85","last_reissued_at":"2026-07-05T11:10:20.921098Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:20.921098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity landscape for local certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Laurent Feuilloley, Nicolas Bousquet, S\\'ebastien Zeitoun","submitted_at":"2025-05-27T09:08:00Z","abstract_excerpt":"An impressive recent line of work has charted the complexity landscape of distributed graph algorithms. For many settings, it has been determined which time complexities exist, and which do not (in the sense that no local problem could have an optimal algorithm with that complexity). In this paper, we initiate the study of the landscape for space complexity of distributed graph algorithms. More precisely, we focus on the local certification setting, where a prover assigns certificates to nodes to certify a property, and where the space complexity is measured by the size of the certificates.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20915","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/2505.20915/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":"2505.20915","created_at":"2026-07-05T11:10:20.921154+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.20915v1","created_at":"2026-07-05T11:10:20.921154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20915","created_at":"2026-07-05T11:10:20.921154+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CLUNWMW46OD","created_at":"2026-07-05T11:10:20.921154+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CLUNWMW46ODCBGY","created_at":"2026-07-05T11:10:20.921154+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CLUNWMW","created_at":"2026-07-05T11:10:20.921154+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/2CLUNWMW46ODCBGY4H4GFEAQNA","json":"https://pith.science/pith/2CLUNWMW46ODCBGY4H4GFEAQNA.json","graph_json":"https://pith.science/api/pith-number/2CLUNWMW46ODCBGY4H4GFEAQNA/graph.json","events_json":"https://pith.science/api/pith-number/2CLUNWMW46ODCBGY4H4GFEAQNA/events.json","paper":"https://pith.science/paper/2CLUNWMW"},"agent_actions":{"view_html":"https://pith.science/pith/2CLUNWMW46ODCBGY4H4GFEAQNA","download_json":"https://pith.science/pith/2CLUNWMW46ODCBGY4H4GFEAQNA.json","view_paper":"https://pith.science/paper/2CLUNWMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.20915&json=true","fetch_graph":"https://pith.science/api/pith-number/2CLUNWMW46ODCBGY4H4GFEAQNA/graph.json","fetch_events":"https://pith.science/api/pith-number/2CLUNWMW46ODCBGY4H4GFEAQNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CLUNWMW46ODCBGY4H4GFEAQNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CLUNWMW46ODCBGY4H4GFEAQNA/action/storage_attestation","attest_author":"https://pith.science/pith/2CLUNWMW46ODCBGY4H4GFEAQNA/action/author_attestation","sign_citation":"https://pith.science/pith/2CLUNWMW46ODCBGY4H4GFEAQNA/action/citation_signature","submit_replication":"https://pith.science/pith/2CLUNWMW46ODCBGY4H4GFEAQNA/action/replication_record"}},"created_at":"2026-07-05T11:10:20.921154+00:00","updated_at":"2026-07-05T11:10:20.921154+00:00"}