{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M6WOBYM5BSPE653LU2IDJHXVKV","short_pith_number":"pith:M6WOBYM5","canonical_record":{"source":{"id":"1708.06947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T10:31:29Z","cross_cats_sorted":[],"title_canon_sha256":"acdb539310ac9af55e2cff5fca78dac7d596a34bd7226c7891f91717ada9406e","abstract_canon_sha256":"f83cde6da70256fd15e0b53058eb53a2d75452fc0239e3a749b8cc01694b692a"},"schema_version":"1.0"},"canonical_sha256":"67ace0e19d0c9e4f776ba690349ef55542c83d89ec8abbf12888a7ecfaa28b1b","source":{"kind":"arxiv","id":"1708.06947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06947","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06947v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06947","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"M6WOBYM5BSPE","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M6WOBYM5BSPE653L","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M6WOBYM5","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M6WOBYM5BSPE653LU2IDJHXVKV","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T10:31:29Z","cross_cats_sorted":[],"title_canon_sha256":"acdb539310ac9af55e2cff5fca78dac7d596a34bd7226c7891f91717ada9406e","abstract_canon_sha256":"f83cde6da70256fd15e0b53058eb53a2d75452fc0239e3a749b8cc01694b692a"},"schema_version":"1.0"},"canonical_sha256":"67ace0e19d0c9e4f776ba690349ef55542c83d89ec8abbf12888a7ecfaa28b1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.817530Z","signature_b64":"kMiQohWgO0id9YPUsj9mzXLc0i13JVj+EQ5Jl3MPLqNYoEHGR0fhQ3kwbSsAKPCIZqcVWcfB5vDcXeE3etgsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67ace0e19d0c9e4f776ba690349ef55542c83d89ec8abbf12888a7ecfaa28b1b","last_reissued_at":"2026-05-18T00:36:48.816905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.816905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06947","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-05-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2IWFpPYeLTBu/aUl36p3U1bXJmpE1DbFWhkTby3USHozqu6E0eTo7r9XcZljUgtErcPqmV5e8tc4PIcUlacAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:14:22.700423Z"},"content_sha256":"153e0d229ad45e681c6153a88355a18030226e4bfb959574b172ff5552f2cacd","schema_version":"1.0","event_id":"sha256:153e0d229ad45e681c6153a88355a18030226e4bfb959574b172ff5552f2cacd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M6WOBYM5BSPE653LU2IDJHXVKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proof-Labeling Schemes: Broadcast, Unicast and In Between","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Boaz Patt-Shamir, Mor Perry","submitted_at":"2017-08-23T10:31:29Z","abstract_excerpt":"We study the effect of limiting the number of different messages a node can transmit simultaneously on the verification complexity of proof-labeling schemes (PLS). In a PLS, each node is given a label, and the goal is to verify, by exchanging messages over each link in each direction, that a certain global predicate is satisfied by the system configuration. We consider a single parameter r that bounds the number of distinct messages that can be sent concurrently by any node: in the case r=1, each node may only send the same message to all its neighbors (the broadcast model), in the case r is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06947","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":""},"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-05-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SDWHMm62Pc0ICNFv9x/5GAE8DGi18IOL5GaqNaCRdlXx2aciHwKrefuT4cpI113VnfvPh680/c4DzxhoTlWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:14:22.700764Z"},"content_sha256":"3b09609f32deae3c93363bb4b586d23d619926b83f3b17a616377f357955ab3f","schema_version":"1.0","event_id":"sha256:3b09609f32deae3c93363bb4b586d23d619926b83f3b17a616377f357955ab3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/bundle.json","state_url":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6WOBYM5BSPE653LU2IDJHXVKV/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-03T08:14:22Z","links":{"resolver":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV","bundle":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/bundle.json","state":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6WOBYM5BSPE653LU2IDJHXVKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M6WOBYM5BSPE653LU2IDJHXVKV","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":"f83cde6da70256fd15e0b53058eb53a2d75452fc0239e3a749b8cc01694b692a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T10:31:29Z","title_canon_sha256":"acdb539310ac9af55e2cff5fca78dac7d596a34bd7226c7891f91717ada9406e"},"schema_version":"1.0","source":{"id":"1708.06947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06947","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06947v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06947","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"M6WOBYM5BSPE","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M6WOBYM5BSPE653L","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M6WOBYM5","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:3b09609f32deae3c93363bb4b586d23d619926b83f3b17a616377f357955ab3f","target":"graph","created_at":"2026-05-18T00:36:48Z","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"},"paper":{"abstract_excerpt":"We study the effect of limiting the number of different messages a node can transmit simultaneously on the verification complexity of proof-labeling schemes (PLS). In a PLS, each node is given a label, and the goal is to verify, by exchanging messages over each link in each direction, that a certain global predicate is satisfied by the system configuration. We consider a single parameter r that bounds the number of distinct messages that can be sent concurrently by any node: in the case r=1, each node may only send the same message to all its neighbors (the broadcast model), in the case r is a","authors_text":"Boaz Patt-Shamir, Mor Perry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T10:31:29Z","title":"Proof-Labeling Schemes: Broadcast, Unicast and In Between"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06947","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:153e0d229ad45e681c6153a88355a18030226e4bfb959574b172ff5552f2cacd","target":"record","created_at":"2026-05-18T00:36:48Z","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":"f83cde6da70256fd15e0b53058eb53a2d75452fc0239e3a749b8cc01694b692a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-23T10:31:29Z","title_canon_sha256":"acdb539310ac9af55e2cff5fca78dac7d596a34bd7226c7891f91717ada9406e"},"schema_version":"1.0","source":{"id":"1708.06947","kind":"arxiv","version":1}},"canonical_sha256":"67ace0e19d0c9e4f776ba690349ef55542c83d89ec8abbf12888a7ecfaa28b1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67ace0e19d0c9e4f776ba690349ef55542c83d89ec8abbf12888a7ecfaa28b1b","first_computed_at":"2026-05-18T00:36:48.816905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:48.816905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kMiQohWgO0id9YPUsj9mzXLc0i13JVj+EQ5Jl3MPLqNYoEHGR0fhQ3kwbSsAKPCIZqcVWcfB5vDcXeE3etgsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:48.817530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:153e0d229ad45e681c6153a88355a18030226e4bfb959574b172ff5552f2cacd","sha256:3b09609f32deae3c93363bb4b586d23d619926b83f3b17a616377f357955ab3f"],"state_sha256":"6acc4f9a359f2f72f6a94f4719a0345f5fe7ce8ce7a3cc1c36dc20085aa81391"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyLlUBTdD5tfiSnxiMXvzqoH18VDGJvqjYuF2MqLstaKt6YNh8ajgOEhhaQJ6N1kiYi2275tglMKkGqrudsXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:14:22.702670Z","bundle_sha256":"050b232cd420920e80923d098fe41135ed027273ed841e9a6a44ace0d18e18cf"}}