{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IQ6ZZSAIME34B23UVUAVGCYVWE","short_pith_number":"pith:IQ6ZZSAI","schema_version":"1.0","canonical_sha256":"443d9cc8086137c0eb74ad01530b15b135360fcfe2a06604a0df5cf6eac1a7dd","source":{"kind":"arxiv","id":"2606.18236","version":1},"attestation_state":"computed","paper":{"title":"Sign-Rank, Index, and List Replicability: Connections and Separations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Ari Blondal, Chavdar Lalov, Hamed Hatami, Pooya Hatami, Sivan Tretiak","submitted_at":"2026-06-16T17:57:16Z","abstract_excerpt":"In learning theory, the sign rank of a binary concept class captures the smallest dimension in which it can be represented by points and halfspaces. Despite tremendous interest, lower bounds on sign rank are notoriously difficult to come by. Two recent approaches to the problem establish lower bounds on sign rank by measures that are easier to analyze: the $\\mathbb{Z}_2$-index and the list replicability number.\n  We order these measures, showing that the $\\mathbb{Z}_2$-index is upper-bounded by a linear function of the list replicability number. As a main consequence, we obtain a strong separa"},"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":"2606.18236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T17:57:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f277f2bdfc05fd6343f8ae0cddf93a2019af0246be2ef87bc0a8031fc95c2a13","abstract_canon_sha256":"253711d6c1f100ab3cd09cf2de2b903c4a6f4ac32e4670f2aefd52cf0faadf95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:51.916165Z","signature_b64":"0B+W+BNI/ESQTbdtFtceKuyvAZ4zggd8WNapPCI0/MuP+5MgE6JmIlzMQXgGTSrf+dc3lWDeMyRuLG68+4LFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"443d9cc8086137c0eb74ad01530b15b135360fcfe2a06604a0df5cf6eac1a7dd","last_reissued_at":"2026-06-19T16:10:51.915771Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:51.915771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sign-Rank, Index, and List Replicability: Connections and Separations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Ari Blondal, Chavdar Lalov, Hamed Hatami, Pooya Hatami, Sivan Tretiak","submitted_at":"2026-06-16T17:57:16Z","abstract_excerpt":"In learning theory, the sign rank of a binary concept class captures the smallest dimension in which it can be represented by points and halfspaces. Despite tremendous interest, lower bounds on sign rank are notoriously difficult to come by. Two recent approaches to the problem establish lower bounds on sign rank by measures that are easier to analyze: the $\\mathbb{Z}_2$-index and the list replicability number.\n  We order these measures, showing that the $\\mathbb{Z}_2$-index is upper-bounded by a linear function of the list replicability number. As a main consequence, we obtain a strong separa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18236","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/2606.18236/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":"2606.18236","created_at":"2026-06-19T16:10:51.915836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18236v1","created_at":"2026-06-19T16:10:51.915836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18236","created_at":"2026-06-19T16:10:51.915836+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQ6ZZSAIME34","created_at":"2026-06-19T16:10:51.915836+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQ6ZZSAIME34B23U","created_at":"2026-06-19T16:10:51.915836+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQ6ZZSAI","created_at":"2026-06-19T16:10:51.915836+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/IQ6ZZSAIME34B23UVUAVGCYVWE","json":"https://pith.science/pith/IQ6ZZSAIME34B23UVUAVGCYVWE.json","graph_json":"https://pith.science/api/pith-number/IQ6ZZSAIME34B23UVUAVGCYVWE/graph.json","events_json":"https://pith.science/api/pith-number/IQ6ZZSAIME34B23UVUAVGCYVWE/events.json","paper":"https://pith.science/paper/IQ6ZZSAI"},"agent_actions":{"view_html":"https://pith.science/pith/IQ6ZZSAIME34B23UVUAVGCYVWE","download_json":"https://pith.science/pith/IQ6ZZSAIME34B23UVUAVGCYVWE.json","view_paper":"https://pith.science/paper/IQ6ZZSAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18236&json=true","fetch_graph":"https://pith.science/api/pith-number/IQ6ZZSAIME34B23UVUAVGCYVWE/graph.json","fetch_events":"https://pith.science/api/pith-number/IQ6ZZSAIME34B23UVUAVGCYVWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQ6ZZSAIME34B23UVUAVGCYVWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQ6ZZSAIME34B23UVUAVGCYVWE/action/storage_attestation","attest_author":"https://pith.science/pith/IQ6ZZSAIME34B23UVUAVGCYVWE/action/author_attestation","sign_citation":"https://pith.science/pith/IQ6ZZSAIME34B23UVUAVGCYVWE/action/citation_signature","submit_replication":"https://pith.science/pith/IQ6ZZSAIME34B23UVUAVGCYVWE/action/replication_record"}},"created_at":"2026-06-19T16:10:51.915836+00:00","updated_at":"2026-06-19T16:10:51.915836+00:00"}