{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M6WOBYM5BSPE653LU2IDJHXVKV","short_pith_number":"pith:M6WOBYM5","schema_version":"1.0","canonical_sha256":"67ace0e19d0c9e4f776ba690349ef55542c83d89ec8abbf12888a7ecfaa28b1b","source":{"kind":"arxiv","id":"1708.06947","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.06947","created_at":"2026-05-18T00:36:48.816980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06947v1","created_at":"2026-05-18T00:36:48.816980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06947","created_at":"2026-05-18T00:36:48.816980+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6WOBYM5BSPE","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6WOBYM5BSPE653L","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6WOBYM5","created_at":"2026-05-18T12:31:31.346846+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/M6WOBYM5BSPE653LU2IDJHXVKV","json":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV.json","graph_json":"https://pith.science/api/pith-number/M6WOBYM5BSPE653LU2IDJHXVKV/graph.json","events_json":"https://pith.science/api/pith-number/M6WOBYM5BSPE653LU2IDJHXVKV/events.json","paper":"https://pith.science/paper/M6WOBYM5"},"agent_actions":{"view_html":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV","download_json":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV.json","view_paper":"https://pith.science/paper/M6WOBYM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06947&json=true","fetch_graph":"https://pith.science/api/pith-number/M6WOBYM5BSPE653LU2IDJHXVKV/graph.json","fetch_events":"https://pith.science/api/pith-number/M6WOBYM5BSPE653LU2IDJHXVKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/action/storage_attestation","attest_author":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/action/author_attestation","sign_citation":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/action/citation_signature","submit_replication":"https://pith.science/pith/M6WOBYM5BSPE653LU2IDJHXVKV/action/replication_record"}},"created_at":"2026-05-18T00:36:48.816980+00:00","updated_at":"2026-05-18T00:36:48.816980+00:00"}