{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZQCDFVJ4QTH2OMA4FCK4RO2DBQ","short_pith_number":"pith:ZQCDFVJ4","schema_version":"1.0","canonical_sha256":"cc0432d53c84cfa7301c2895c8bb430c30b99c7ad92d2ecd6dd9cecc51b31734","source":{"kind":"arxiv","id":"2302.10431","version":1},"attestation_state":"computed","paper":{"title":"A note on the partition bound for one-way classical communication complexity","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jo\\~ao F. Doriguello, Rahul Jain, Srinivasan Arunachalam","submitted_at":"2023-02-21T04:04:38Z","abstract_excerpt":"We present a linear program for the one-way version of the partition bound (denoted $\\mathsf{prt}^1_\\varepsilon(f)$). We show that it characterizes one-way randomized communication complexity $\\mathsf{R}_\\varepsilon^1(f)$ with shared randomness of every partial function $f:\\mathcal{X}\\times\\mathcal{Y}\\to\\mathcal{Z}$, i.e., for $\\delta,\\varepsilon\\in(0,1/2)$, $\\mathsf{R}_\\varepsilon^1(f) \\geq \\log\\mathsf{prt}_\\varepsilon^1(f)$ and $\\mathsf{R}_{\\varepsilon+\\delta}^1(f) \\leq \\log\\mathsf{prt}_\\varepsilon^1(f) + \\log\\log(1/\\delta)$. This improves upon the characterization of $\\mathsf{R}_\\varepsilon"},"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":"2302.10431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CC","submitted_at":"2023-02-21T04:04:38Z","cross_cats_sorted":[],"title_canon_sha256":"621b17479e5864fbc05018825e7dfa46be9f43329a0009f24d8f3c6dd4c27553","abstract_canon_sha256":"215ab69de0bab4811a98404beb3885a95163274881555be658d589fd24f01117"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:39.057704Z","signature_b64":"tNGn9n30kUXbZiHmhv41SbSzRYE2vK4hC5c81Bz8q5NBqbTd8gtF5Y22oTTZgNyK/Yb6aYZJnkaZx1cGZV39AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc0432d53c84cfa7301c2895c8bb430c30b99c7ad92d2ecd6dd9cecc51b31734","last_reissued_at":"2026-07-05T05:43:39.057218Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:39.057218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the partition bound for one-way classical communication complexity","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jo\\~ao F. Doriguello, Rahul Jain, Srinivasan Arunachalam","submitted_at":"2023-02-21T04:04:38Z","abstract_excerpt":"We present a linear program for the one-way version of the partition bound (denoted $\\mathsf{prt}^1_\\varepsilon(f)$). We show that it characterizes one-way randomized communication complexity $\\mathsf{R}_\\varepsilon^1(f)$ with shared randomness of every partial function $f:\\mathcal{X}\\times\\mathcal{Y}\\to\\mathcal{Z}$, i.e., for $\\delta,\\varepsilon\\in(0,1/2)$, $\\mathsf{R}_\\varepsilon^1(f) \\geq \\log\\mathsf{prt}_\\varepsilon^1(f)$ and $\\mathsf{R}_{\\varepsilon+\\delta}^1(f) \\leq \\log\\mathsf{prt}_\\varepsilon^1(f) + \\log\\log(1/\\delta)$. This improves upon the characterization of $\\mathsf{R}_\\varepsilon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10431","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/2302.10431/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":"2302.10431","created_at":"2026-07-05T05:43:39.057275+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.10431v1","created_at":"2026-07-05T05:43:39.057275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10431","created_at":"2026-07-05T05:43:39.057275+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQCDFVJ4QTH2","created_at":"2026-07-05T05:43:39.057275+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQCDFVJ4QTH2OMA4","created_at":"2026-07-05T05:43:39.057275+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQCDFVJ4","created_at":"2026-07-05T05:43:39.057275+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/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ","json":"https://pith.science/pith/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ.json","graph_json":"https://pith.science/api/pith-number/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/graph.json","events_json":"https://pith.science/api/pith-number/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/events.json","paper":"https://pith.science/paper/ZQCDFVJ4"},"agent_actions":{"view_html":"https://pith.science/pith/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ","download_json":"https://pith.science/pith/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ.json","view_paper":"https://pith.science/paper/ZQCDFVJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.10431&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZQCDFVJ4QTH2OMA4FCK4RO2DBQ/action/replication_record"}},"created_at":"2026-07-05T05:43:39.057275+00:00","updated_at":"2026-07-05T05:43:39.057275+00:00"}