{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AYFGRX6FZXDL6C4XY4RO5WCMSC","short_pith_number":"pith:AYFGRX6F","schema_version":"1.0","canonical_sha256":"060a68dfc5cdc6bf0b97c722eed84c908ea9f623b533ab45df6368c324e69a83","source":{"kind":"arxiv","id":"2608.04125","version":1},"attestation_state":"computed","paper":{"title":"Concentration from Product Moments via an Additional Element of Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Michael Saks, Renata Valieva","submitted_at":"2026-08-04T18:23:40Z","abstract_excerpt":"The standard method of exponential moments for proving concentration bounds can often be replaced by an argument based on elementary symmetric polynomials. We introduce an additional element of randomness into this framework, which reduces the problem to bounding product moments over a uniformly sampled set of indices.\n  We show that this approach gives useful bounds in three settings. For read-$\\Delta$ families under limited independence, we obtain bounds governed by the degrees of randomly induced dependency subgraphs, improving the dependence on worst-case degrees. For random binary linear "},"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":"2608.04125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-04T18:23:40Z","cross_cats_sorted":[],"title_canon_sha256":"fb13902ce60336b603b5f71ad63c85ed2d200f6986aa95446d93eb4ed92b9263","abstract_canon_sha256":"c30c6d1a034d7429cc7cf0c8dd1ec5dda7ee1fa371ed9b4f182441b89fd1ae3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:30:40.754559Z","signature_b64":"PYcd+VXiL/k7cTdSHlluxPOwDn5H+uD1p3Y5uNXZuLn1mabjpkKHP3Zh2ajAX1R8CcxfYj7TDe3u95C6+1HXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"060a68dfc5cdc6bf0b97c722eed84c908ea9f623b533ab45df6368c324e69a83","last_reissued_at":"2026-08-06T01:30:40.753056Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:30:40.753056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concentration from Product Moments via an Additional Element of Randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Michael Saks, Renata Valieva","submitted_at":"2026-08-04T18:23:40Z","abstract_excerpt":"The standard method of exponential moments for proving concentration bounds can often be replaced by an argument based on elementary symmetric polynomials. We introduce an additional element of randomness into this framework, which reduces the problem to bounding product moments over a uniformly sampled set of indices.\n  We show that this approach gives useful bounds in three settings. For read-$\\Delta$ families under limited independence, we obtain bounds governed by the degrees of randomly induced dependency subgraphs, improving the dependence on worst-case degrees. For random binary linear "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04125","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/2608.04125/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":"2608.04125","created_at":"2026-08-06T01:30:40.754878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.04125v1","created_at":"2026-08-06T01:30:40.754878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04125","created_at":"2026-08-06T01:30:40.754878+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYFGRX6FZXDL","created_at":"2026-08-06T01:30:40.754878+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYFGRX6FZXDL6C4X","created_at":"2026-08-06T01:30:40.754878+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYFGRX6F","created_at":"2026-08-06T01:30:40.754878+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/AYFGRX6FZXDL6C4XY4RO5WCMSC","json":"https://pith.science/pith/AYFGRX6FZXDL6C4XY4RO5WCMSC.json","graph_json":"https://pith.science/api/pith-number/AYFGRX6FZXDL6C4XY4RO5WCMSC/graph.json","events_json":"https://pith.science/api/pith-number/AYFGRX6FZXDL6C4XY4RO5WCMSC/events.json","paper":"https://pith.science/paper/AYFGRX6F"},"agent_actions":{"view_html":"https://pith.science/pith/AYFGRX6FZXDL6C4XY4RO5WCMSC","download_json":"https://pith.science/pith/AYFGRX6FZXDL6C4XY4RO5WCMSC.json","view_paper":"https://pith.science/paper/AYFGRX6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.04125&json=true","fetch_graph":"https://pith.science/api/pith-number/AYFGRX6FZXDL6C4XY4RO5WCMSC/graph.json","fetch_events":"https://pith.science/api/pith-number/AYFGRX6FZXDL6C4XY4RO5WCMSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYFGRX6FZXDL6C4XY4RO5WCMSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYFGRX6FZXDL6C4XY4RO5WCMSC/action/storage_attestation","attest_author":"https://pith.science/pith/AYFGRX6FZXDL6C4XY4RO5WCMSC/action/author_attestation","sign_citation":"https://pith.science/pith/AYFGRX6FZXDL6C4XY4RO5WCMSC/action/citation_signature","submit_replication":"https://pith.science/pith/AYFGRX6FZXDL6C4XY4RO5WCMSC/action/replication_record"}},"created_at":"2026-08-06T01:30:40.754878+00:00","updated_at":"2026-08-06T01:30:40.754878+00:00"}