{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:XSM3G4RHUMARAKZ54LTZ7JLVLQ","short_pith_number":"pith:XSM3G4RH","canonical_record":{"source":{"id":"0801.0059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-31T02:52:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b86857937c2c52b3ef82a66c8adc9d37b85ce8f2e5ecce5131bd2cd856bceb4a","abstract_canon_sha256":"0410491cf193fe5902ba274ec5e6ee0cce5d4f5a3fe2f002dd4220525af8b3bb"},"schema_version":"1.0"},"canonical_sha256":"bc99b37227a301102b3de2e79fa5755c3ea0673d43ab8cde3dc826a97bbf597c","source":{"kind":"arxiv","id":"0801.0059","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.0059","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"0801.0059v3","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0059","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"XSM3G4RHUMAR","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"XSM3G4RHUMARAKZ5","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"XSM3G4RH","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:XSM3G4RHUMARAKZ54LTZ7JLVLQ","target":"record","payload":{"canonical_record":{"source":{"id":"0801.0059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-31T02:52:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b86857937c2c52b3ef82a66c8adc9d37b85ce8f2e5ecce5131bd2cd856bceb4a","abstract_canon_sha256":"0410491cf193fe5902ba274ec5e6ee0cce5d4f5a3fe2f002dd4220525af8b3bb"},"schema_version":"1.0"},"canonical_sha256":"bc99b37227a301102b3de2e79fa5755c3ea0673d43ab8cde3dc826a97bbf597c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:32.533930Z","signature_b64":"F4CKMwd4g3ZUcNrq0z+ReatRelvjqGf+LytxKRX9KSeYaqqqdZpviafavgEFC+WCLrllbPJcEx8H2aThrwqmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc99b37227a301102b3de2e79fa5755c3ea0673d43ab8cde3dc826a97bbf597c","last_reissued_at":"2026-05-18T04:16:32.533440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:32.533440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0801.0059","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MqikeisGQzTBnr7Ees0uDodh4TFKaJ2/CzR+nYwl+xT/yehWn6d3ogrIqsBQPcUK3x4evpFzo9LjGQtXU6wPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:29:48.747563Z"},"content_sha256":"ad77535af00b1a466f36e80c08180b066f44fe9d57340778ccac47c9314a5c6a","schema_version":"1.0","event_id":"sha256:ad77535af00b1a466f36e80c08180b066f44fe9d57340778ccac47c9314a5c6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:XSM3G4RHUMARAKZ54LTZ7JLVLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Maximal Probability that k-wise Independent Bits are All 1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Amir Yehudayoff, Ariel Yadin, Ron Peled","submitted_at":"2007-12-31T02:52:17Z","abstract_excerpt":"A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical marginals, each bit has probability p to be 1. We address the following question: how high can the probability that all the bits are 1 be, for such a distribution? For a wide range of the parameters n,k and p we find an explicit lower bound for this probability which matches an upper bound given by Benjamini et al., up to multiplicative factors of lower order. The question we investigate can be seen a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0059","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8tC4DvzQgJS3ojtmWEhmCRhAgKkamLkWV2Rx5ib/Wr2p+H3Qf9Ha0F9hqfMumu1mENVAL19I1drcLONWs9GDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:29:48.748038Z"},"content_sha256":"86e30c262b11580b44fa581ae1f3143e8b99bf883e5357e500e7bde5397fa134","schema_version":"1.0","event_id":"sha256:86e30c262b11580b44fa581ae1f3143e8b99bf883e5357e500e7bde5397fa134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSM3G4RHUMARAKZ54LTZ7JLVLQ/bundle.json","state_url":"https://pith.science/pith/XSM3G4RHUMARAKZ54LTZ7JLVLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSM3G4RHUMARAKZ54LTZ7JLVLQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T19:29:48Z","links":{"resolver":"https://pith.science/pith/XSM3G4RHUMARAKZ54LTZ7JLVLQ","bundle":"https://pith.science/pith/XSM3G4RHUMARAKZ54LTZ7JLVLQ/bundle.json","state":"https://pith.science/pith/XSM3G4RHUMARAKZ54LTZ7JLVLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSM3G4RHUMARAKZ54LTZ7JLVLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:XSM3G4RHUMARAKZ54LTZ7JLVLQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0410491cf193fe5902ba274ec5e6ee0cce5d4f5a3fe2f002dd4220525af8b3bb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-31T02:52:17Z","title_canon_sha256":"b86857937c2c52b3ef82a66c8adc9d37b85ce8f2e5ecce5131bd2cd856bceb4a"},"schema_version":"1.0","source":{"id":"0801.0059","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.0059","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"0801.0059v3","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0059","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"XSM3G4RHUMAR","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"XSM3G4RHUMARAKZ5","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"XSM3G4RH","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:86e30c262b11580b44fa581ae1f3143e8b99bf883e5357e500e7bde5397fa134","target":"graph","created_at":"2026-05-18T04:16:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical marginals, each bit has probability p to be 1. We address the following question: how high can the probability that all the bits are 1 be, for such a distribution? For a wide range of the parameters n,k and p we find an explicit lower bound for this probability which matches an upper bound given by Benjamini et al., up to multiplicative factors of lower order. The question we investigate can be seen a","authors_text":"Amir Yehudayoff, Ariel Yadin, Ron Peled","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-31T02:52:17Z","title":"The Maximal Probability that k-wise Independent Bits are All 1"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0059","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ad77535af00b1a466f36e80c08180b066f44fe9d57340778ccac47c9314a5c6a","target":"record","created_at":"2026-05-18T04:16:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0410491cf193fe5902ba274ec5e6ee0cce5d4f5a3fe2f002dd4220525af8b3bb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-12-31T02:52:17Z","title_canon_sha256":"b86857937c2c52b3ef82a66c8adc9d37b85ce8f2e5ecce5131bd2cd856bceb4a"},"schema_version":"1.0","source":{"id":"0801.0059","kind":"arxiv","version":3}},"canonical_sha256":"bc99b37227a301102b3de2e79fa5755c3ea0673d43ab8cde3dc826a97bbf597c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc99b37227a301102b3de2e79fa5755c3ea0673d43ab8cde3dc826a97bbf597c","first_computed_at":"2026-05-18T04:16:32.533440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:32.533440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F4CKMwd4g3ZUcNrq0z+ReatRelvjqGf+LytxKRX9KSeYaqqqdZpviafavgEFC+WCLrllbPJcEx8H2aThrwqmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:32.533930Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.0059","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad77535af00b1a466f36e80c08180b066f44fe9d57340778ccac47c9314a5c6a","sha256:86e30c262b11580b44fa581ae1f3143e8b99bf883e5357e500e7bde5397fa134"],"state_sha256":"39c936026b2a09730bc9c5ecd11e1f7f9e9ccdc25e32fc462c8ab678e0e5b9d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/vMCoSTA/fk9zeMFNB0+AEysd0SgfGE7GcAUcfqbm/MIr9UQyBL+PBsqHbzK6XSNwrICguOdQOLu9+TmawZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:29:48.751634Z","bundle_sha256":"b6e44b084ef791b6bf5540ba84110541b6f040d62acfe5fe9d93403b7d7f6b62"}}