{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7LNYWK35SYLNNBXKFBWZU42B37","short_pith_number":"pith:7LNYWK35","schema_version":"1.0","canonical_sha256":"fadb8b2b7d9616d686ea286d9a7341dfedb96ec7b386b93ad85194cbe760e489","source":{"kind":"arxiv","id":"2511.19208","version":3},"attestation_state":"computed","paper":{"title":"Leader Election via Unique Sink Orientation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"J\\'er\\'emie Chalopin, Maria Kokkou","submitted_at":"2025-11-24T15:17:32Z","abstract_excerpt":"A Locally Checkable Labeling (LCL) is a distributed constraint satisfaction problem defined on a bounded-degree graph that relates a finite set of input labels to a finite set of output labels through a finite set of locally checkable constraints. In this work we define labels and local constraints that encode solutions to two classical problems: leader election and spanning tree construction. It is known that leader election cannot be expressed as an LCL in arbitrary graphs using constant-size labels. In fact, it is known that there does not exist a finite set of labels and local constraints "},"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":"2511.19208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-11-24T15:17:32Z","cross_cats_sorted":[],"title_canon_sha256":"dc7613aac28bcf557ce43491f5336a7e86887f5443dd2c7a73c46efee44cb3b8","abstract_canon_sha256":"e5c496dd2e9014dd072c1d81cd604392ac1e5c4afe7f5f7504d0a19b15c791b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:07.608833Z","signature_b64":"GuQMeNGaPgcNVo+8rB52QZjw1sO0gjNx1aF1HeY5yjhSCT57Da5WLLSv6H5ZH4ulbzccQU/bZxTEsAuygeULAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fadb8b2b7d9616d686ea286d9a7341dfedb96ec7b386b93ad85194cbe760e489","last_reissued_at":"2026-06-03T01:05:07.608340Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:07.608340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leader Election via Unique Sink Orientation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"J\\'er\\'emie Chalopin, Maria Kokkou","submitted_at":"2025-11-24T15:17:32Z","abstract_excerpt":"A Locally Checkable Labeling (LCL) is a distributed constraint satisfaction problem defined on a bounded-degree graph that relates a finite set of input labels to a finite set of output labels through a finite set of locally checkable constraints. In this work we define labels and local constraints that encode solutions to two classical problems: leader election and spanning tree construction. It is known that leader election cannot be expressed as an LCL in arbitrary graphs using constant-size labels. In fact, it is known that there does not exist a finite set of labels and local constraints "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.19208","kind":"arxiv","version":3},"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/2511.19208/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":"2511.19208","created_at":"2026-06-03T01:05:07.608400+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.19208v3","created_at":"2026-06-03T01:05:07.608400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.19208","created_at":"2026-06-03T01:05:07.608400+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LNYWK35SYLN","created_at":"2026-06-03T01:05:07.608400+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LNYWK35SYLNNBXK","created_at":"2026-06-03T01:05:07.608400+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LNYWK35","created_at":"2026-06-03T01:05:07.608400+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/7LNYWK35SYLNNBXKFBWZU42B37","json":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37.json","graph_json":"https://pith.science/api/pith-number/7LNYWK35SYLNNBXKFBWZU42B37/graph.json","events_json":"https://pith.science/api/pith-number/7LNYWK35SYLNNBXKFBWZU42B37/events.json","paper":"https://pith.science/paper/7LNYWK35"},"agent_actions":{"view_html":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37","download_json":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37.json","view_paper":"https://pith.science/paper/7LNYWK35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.19208&json=true","fetch_graph":"https://pith.science/api/pith-number/7LNYWK35SYLNNBXKFBWZU42B37/graph.json","fetch_events":"https://pith.science/api/pith-number/7LNYWK35SYLNNBXKFBWZU42B37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/action/storage_attestation","attest_author":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/action/author_attestation","sign_citation":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/action/citation_signature","submit_replication":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/action/replication_record"}},"created_at":"2026-06-03T01:05:07.608400+00:00","updated_at":"2026-06-03T01:05:07.608400+00:00"}