{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4XGKOBLZFRNVAABVQORLLSNVEG","short_pith_number":"pith:4XGKOBLZ","schema_version":"1.0","canonical_sha256":"e5cca705792c5b50003583a2b5c9b521a54aa6dec5f5ff622f6e9edabaf65953","source":{"kind":"arxiv","id":"2605.19078","version":1},"attestation_state":"computed","paper":{"title":"Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Orr Fischer","submitted_at":"2026-05-18T20:08:05Z","abstract_excerpt":"In the $t$-Proof Labeling Scheme model ($t$-PLS model), our goal is to certify that a network of nodes satisfies a given property $P$. A prover assigns a label to each node, and each node decides to accept or reject based on its labeled $t$-hop neighborhood. If $P$ holds, there exists a labeling that makes all nodes accept. If $P$ does not hold, in all labelings at least one node rejects. The cost of a scheme is its maximum label size.\n  The Tradeoff Conjecture [Feuilloley, Fraigniaud, Hirvonen, Paz, and Perry, DISC 18, Dist. Comput.~21] hypothesizes that the existence of a $1$-PLS for a prope"},"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":"2605.19078","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-18T20:08:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"edfe096b253e22c6b5f949626e868ac438716d5c722ebc21748449887044867f","abstract_canon_sha256":"a705a9371a92281c920d044d4aaf8421644ab25434315932b861c72737a2e913"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:26.338405Z","signature_b64":"Qj5nt7i6vUexBDhNzUET+WTXrC0mDQ4Kj+kw+QpDkvi9aM2DCm7uTFEtao3kh5J3sxwBF+IqwKIVpwlEjifCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5cca705792c5b50003583a2b5c9b521a54aa6dec5f5ff622f6e9edabaf65953","last_reissued_at":"2026-05-20T01:05:26.337625Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:26.337625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Orr Fischer","submitted_at":"2026-05-18T20:08:05Z","abstract_excerpt":"In the $t$-Proof Labeling Scheme model ($t$-PLS model), our goal is to certify that a network of nodes satisfies a given property $P$. A prover assigns a label to each node, and each node decides to accept or reject based on its labeled $t$-hop neighborhood. If $P$ holds, there exists a labeling that makes all nodes accept. If $P$ does not hold, in all labelings at least one node rejects. The cost of a scheme is its maximum label size.\n  The Tradeoff Conjecture [Feuilloley, Fraigniaud, Hirvonen, Paz, and Perry, DISC 18, Dist. Comput.~21] hypothesizes that the existence of a $1$-PLS for a prope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19078","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/2605.19078/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":"2605.19078","created_at":"2026-05-20T01:05:26.337758+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19078v1","created_at":"2026-05-20T01:05:26.337758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19078","created_at":"2026-05-20T01:05:26.337758+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XGKOBLZFRNV","created_at":"2026-05-20T01:05:26.337758+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XGKOBLZFRNVAABV","created_at":"2026-05-20T01:05:26.337758+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XGKOBLZ","created_at":"2026-05-20T01:05:26.337758+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/4XGKOBLZFRNVAABVQORLLSNVEG","json":"https://pith.science/pith/4XGKOBLZFRNVAABVQORLLSNVEG.json","graph_json":"https://pith.science/api/pith-number/4XGKOBLZFRNVAABVQORLLSNVEG/graph.json","events_json":"https://pith.science/api/pith-number/4XGKOBLZFRNVAABVQORLLSNVEG/events.json","paper":"https://pith.science/paper/4XGKOBLZ"},"agent_actions":{"view_html":"https://pith.science/pith/4XGKOBLZFRNVAABVQORLLSNVEG","download_json":"https://pith.science/pith/4XGKOBLZFRNVAABVQORLLSNVEG.json","view_paper":"https://pith.science/paper/4XGKOBLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19078&json=true","fetch_graph":"https://pith.science/api/pith-number/4XGKOBLZFRNVAABVQORLLSNVEG/graph.json","fetch_events":"https://pith.science/api/pith-number/4XGKOBLZFRNVAABVQORLLSNVEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XGKOBLZFRNVAABVQORLLSNVEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XGKOBLZFRNVAABVQORLLSNVEG/action/storage_attestation","attest_author":"https://pith.science/pith/4XGKOBLZFRNVAABVQORLLSNVEG/action/author_attestation","sign_citation":"https://pith.science/pith/4XGKOBLZFRNVAABVQORLLSNVEG/action/citation_signature","submit_replication":"https://pith.science/pith/4XGKOBLZFRNVAABVQORLLSNVEG/action/replication_record"}},"created_at":"2026-05-20T01:05:26.337758+00:00","updated_at":"2026-05-20T01:05:26.337758+00:00"}