{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7LNYWK35SYLNNBXKFBWZU42B37","short_pith_number":"pith:7LNYWK35","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"},"canonical_sha256":"fadb8b2b7d9616d686ea286d9a7341dfedb96ec7b386b93ad85194cbe760e489","source":{"kind":"arxiv","id":"2511.19208","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.19208","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2511.19208v3","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.19208","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"7LNYWK35SYLN","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"7LNYWK35SYLNNBXK","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"7LNYWK35","created_at":"2026-06-03T01:05:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7LNYWK35SYLNNBXKFBWZU42B37","target":"record","payload":{"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"},"canonical_sha256":"fadb8b2b7d9616d686ea286d9a7341dfedb96ec7b386b93ad85194cbe760e489","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"},"source_kind":"arxiv","source_id":"2511.19208","source_version":3,"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-06-03T01:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oS6uLlfF4GX3dxdxdbK30ZGlWeRb7tS2Q2XL5+AS2BGkWzVUqtO7DRW24G3cLtWpwW08CHq/DgcFrIA43qGXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:27:23.733110Z"},"content_sha256":"53afef3d43817c0e2c0237e9d96ab8c1ba1ada7cb99adc939af817d81fc243d9","schema_version":"1.0","event_id":"sha256:53afef3d43817c0e2c0237e9d96ab8c1ba1ada7cb99adc939af817d81fc243d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7LNYWK35SYLNNBXKFBWZU42B37","target":"graph","payload":{"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"},"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-06-03T01:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrZPmQ+sDyJ+graADjfvp/U2gKgdfy7mWttZflWf6mEwF0ZXPDCeytfXhzNlgpztOhDJS/kKV4i0JCoaoa8jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:27:23.733530Z"},"content_sha256":"2cd5b3701069e3f3fccb742483b96a2573a19fb06c514eda71d8354dc4dee75e","schema_version":"1.0","event_id":"sha256:2cd5b3701069e3f3fccb742483b96a2573a19fb06c514eda71d8354dc4dee75e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/bundle.json","state_url":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LNYWK35SYLNNBXKFBWZU42B37/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-06-12T06:27:23Z","links":{"resolver":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37","bundle":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/bundle.json","state":"https://pith.science/pith/7LNYWK35SYLNNBXKFBWZU42B37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LNYWK35SYLNNBXKFBWZU42B37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7LNYWK35SYLNNBXKFBWZU42B37","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":"e5c496dd2e9014dd072c1d81cd604392ac1e5c4afe7f5f7504d0a19b15c791b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-11-24T15:17:32Z","title_canon_sha256":"dc7613aac28bcf557ce43491f5336a7e86887f5443dd2c7a73c46efee44cb3b8"},"schema_version":"1.0","source":{"id":"2511.19208","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.19208","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2511.19208v3","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.19208","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"7LNYWK35SYLN","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"7LNYWK35SYLNNBXK","created_at":"2026-06-03T01:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"7LNYWK35","created_at":"2026-06-03T01:05:07Z"}],"graph_snapshots":[{"event_id":"sha256:2cd5b3701069e3f3fccb742483b96a2573a19fb06c514eda71d8354dc4dee75e","target":"graph","created_at":"2026-06-03T01:05:07Z","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/2511.19208/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"J\\'er\\'emie Chalopin, Maria Kokkou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-11-24T15:17:32Z","title":"Leader Election via Unique Sink Orientation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.19208","kind":"arxiv","version":3},"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:53afef3d43817c0e2c0237e9d96ab8c1ba1ada7cb99adc939af817d81fc243d9","target":"record","created_at":"2026-06-03T01:05:07Z","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":"e5c496dd2e9014dd072c1d81cd604392ac1e5c4afe7f5f7504d0a19b15c791b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-11-24T15:17:32Z","title_canon_sha256":"dc7613aac28bcf557ce43491f5336a7e86887f5443dd2c7a73c46efee44cb3b8"},"schema_version":"1.0","source":{"id":"2511.19208","kind":"arxiv","version":3}},"canonical_sha256":"fadb8b2b7d9616d686ea286d9a7341dfedb96ec7b386b93ad85194cbe760e489","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fadb8b2b7d9616d686ea286d9a7341dfedb96ec7b386b93ad85194cbe760e489","first_computed_at":"2026-06-03T01:05:07.608340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:07.608340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GuQMeNGaPgcNVo+8rB52QZjw1sO0gjNx1aF1HeY5yjhSCT57Da5WLLSv6H5ZH4ulbzccQU/bZxTEsAuygeULAw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:07.608833Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.19208","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53afef3d43817c0e2c0237e9d96ab8c1ba1ada7cb99adc939af817d81fc243d9","sha256:2cd5b3701069e3f3fccb742483b96a2573a19fb06c514eda71d8354dc4dee75e"],"state_sha256":"67772b669781a262a652f13fbe58bbdce40156376886ffddd0d0141b8652e6fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74Ain2ittnwe0MqJaPT74uNf/9i6FnL5iJBRw46NI4/5+LT0WRv0fQ9/c6mYgeEeJS+sS7pCxATGQsVBujOiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:27:23.735878Z","bundle_sha256":"a55e65bf024f2269571a4e9382783aa462562056f1b09e57d9b8383542b98c2c"}}