{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JPBADMBSCREE7VLKFBXWFJ736Q","short_pith_number":"pith:JPBADMBS","schema_version":"1.0","canonical_sha256":"4bc201b03214484fd56a286f62a7fbf43c6e310c3a6194fbff6e11e4c2608144","source":{"kind":"arxiv","id":"2604.08438","version":2},"attestation_state":"computed","paper":{"title":"Adalina: Adaptive Linear Approximation for the Shapley Value and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A linear-space algorithm approximates Shapley values and semi-values with O(n/ε² log(1/δ)) queries while minimizing mean squared error for any utility.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bryan Kian Hsiang Low, Weida Li, Yaoliang Yu","submitted_at":"2026-04-09T16:38:14Z","abstract_excerpt":"The Shapley value, and its broader family of semi-values, has received much attention in various attribution problems. A fundamental and long-standing challenge is their efficient approximation, since exact computation generally requires an exponential number of utility queries in the number of players $n$. To meet the challenges of large-scale applications, we explore the limits of efficiently approximating semi-values under a $\\Theta(n)$ space constraint. Building upon a vector concentration inequality, we establish a theoretical framework that enables sharper query complexities for existing"},"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":true},"canonical_record":{"source":{"id":"2604.08438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-09T16:38:14Z","cross_cats_sorted":[],"title_canon_sha256":"b84431360dda8abe46294e537bf01c12b4deb3e91bf76002adeec910ea9cb143","abstract_canon_sha256":"d55164f24eae6d753b025f36cb17a061e020b092a82cd99f0d64b03cecc14476"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:49.704971Z","signature_b64":"BpbSxzflf92nuq1ecs6VZtrC6PlSl493OoVysl2JBqRgMEzR3aEYV490c3OfAtFy9WtQA4yg2TQnW7s3LXyJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bc201b03214484fd56a286f62a7fbf43c6e310c3a6194fbff6e11e4c2608144","last_reissued_at":"2026-06-04T01:08:49.704520Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:49.704520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adalina: Adaptive Linear Approximation for the Shapley Value and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A linear-space algorithm approximates Shapley values and semi-values with O(n/ε² log(1/δ)) queries while minimizing mean squared error for any utility.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bryan Kian Hsiang Low, Weida Li, Yaoliang Yu","submitted_at":"2026-04-09T16:38:14Z","abstract_excerpt":"The Shapley value, and its broader family of semi-values, has received much attention in various attribution problems. A fundamental and long-standing challenge is their efficient approximation, since exact computation generally requires an exponential number of utility queries in the number of players $n$. To meet the challenges of large-scale applications, we explore the limits of efficiently approximating semi-values under a $\\Theta(n)$ space constraint. Building upon a vector concentration inequality, we establish a theoretical framework that enables sharper query complexities for existing"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our algorithm requires O(n/ε² log(1/δ)) utility queries to ensure P(‖φ̂ - φ‖₂ ≥ ε) ≤ δ for all commonly used semi-values... our algorithm allows explicit minimization of the mean square error for each specific utility function... the first adaptive, linear-time, linear-space randomized algorithm, Adalina, that theoretically achieves improved mean square error.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The framework relies on a vector concentration inequality to derive the query bounds under a Θ(n) space constraint; if this inequality does not apply tightly to the semi-value estimators, the claimed complexities may not hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Introduces Adalina, the first adaptive linear-time linear-space randomized algorithm for semi-value approximation with provable O(n/ε² log(1/δ)) query complexity and explicit MSE minimization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A linear-space algorithm approximates Shapley values and semi-values with O(n/ε² log(1/δ)) queries while minimizing mean squared error for any utility.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9db8bb4ef4ad8cc365ada60f2b615f6e2a9d3fa5e417f4a809fdee9de7ed670b"},"source":{"id":"2604.08438","kind":"arxiv","version":2},"verdict":{"id":"31e2cd17-38a6-4b6f-adaf-f1867d94ab23","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T18:33:07.174134Z","strongest_claim":"Our algorithm requires O(n/ε² log(1/δ)) utility queries to ensure P(‖φ̂ - φ‖₂ ≥ ε) ≤ δ for all commonly used semi-values... our algorithm allows explicit minimization of the mean square error for each specific utility function... the first adaptive, linear-time, linear-space randomized algorithm, Adalina, that theoretically achieves improved mean square error.","one_line_summary":"Introduces Adalina, the first adaptive linear-time linear-space randomized algorithm for semi-value approximation with provable O(n/ε² log(1/δ)) query complexity and explicit MSE minimization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The framework relies on a vector concentration inequality to derive the query bounds under a Θ(n) space constraint; if this inequality does not apply tightly to the semi-value estimators, the claimed complexities may not hold.","pith_extraction_headline":"A linear-space algorithm approximates Shapley values and semi-values with O(n/ε² log(1/δ)) queries while minimizing mean squared error for any utility."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.08438/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":2,"snapshot_sha256":"cd1c453c5550d309211a649a1a515afd899c700c0c8f7dd1bb3875a4c21fa07c"},"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":"2604.08438","created_at":"2026-06-04T01:08:49.704592+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.08438v2","created_at":"2026-06-04T01:08:49.704592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.08438","created_at":"2026-06-04T01:08:49.704592+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPBADMBSCREE","created_at":"2026-06-04T01:08:49.704592+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPBADMBSCREE7VLK","created_at":"2026-06-04T01:08:49.704592+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPBADMBS","created_at":"2026-06-04T01:08:49.704592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q","json":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q.json","graph_json":"https://pith.science/api/pith-number/JPBADMBSCREE7VLKFBXWFJ736Q/graph.json","events_json":"https://pith.science/api/pith-number/JPBADMBSCREE7VLKFBXWFJ736Q/events.json","paper":"https://pith.science/paper/JPBADMBS"},"agent_actions":{"view_html":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q","download_json":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q.json","view_paper":"https://pith.science/paper/JPBADMBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.08438&json=true","fetch_graph":"https://pith.science/api/pith-number/JPBADMBSCREE7VLKFBXWFJ736Q/graph.json","fetch_events":"https://pith.science/api/pith-number/JPBADMBSCREE7VLKFBXWFJ736Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q/action/storage_attestation","attest_author":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q/action/author_attestation","sign_citation":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q/action/citation_signature","submit_replication":"https://pith.science/pith/JPBADMBSCREE7VLKFBXWFJ736Q/action/replication_record"}},"created_at":"2026-06-04T01:08:49.704592+00:00","updated_at":"2026-06-04T01:08:49.704592+00:00"}