{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7V56K3HCY364CSHB4ZE3JAO5PN","short_pith_number":"pith:7V56K3HC","canonical_record":{"source":{"id":"2606.13157","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:33Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ad0a76c4efb9fe4019be457494ae9ac76d710caafc771cef511bb116af45e539","abstract_canon_sha256":"30ec50aa7284ed858d611973a181407b40f837b3240f46628882b0a16aebb8ff"},"schema_version":"1.0"},"canonical_sha256":"fd7be56ce2c6fdc148e1e649b481dd7b7f3724416801ff0625916fe8a479fc70","source":{"kind":"arxiv","id":"2606.13157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13157","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13157v1","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13157","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"7V56K3HCY364","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_16","alias_value":"7V56K3HCY364CSHB","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_8","alias_value":"7V56K3HC","created_at":"2026-06-12T01:09:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7V56K3HCY364CSHB4ZE3JAO5PN","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13157","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:33Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ad0a76c4efb9fe4019be457494ae9ac76d710caafc771cef511bb116af45e539","abstract_canon_sha256":"30ec50aa7284ed858d611973a181407b40f837b3240f46628882b0a16aebb8ff"},"schema_version":"1.0"},"canonical_sha256":"fd7be56ce2c6fdc148e1e649b481dd7b7f3724416801ff0625916fe8a479fc70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:43.938736Z","signature_b64":"cfbGHLdorVu7nWELsY1FskqQ+FTVAW92tGJfb4GOlI4E1HIGf6nETpnuGuLMTC8rZMzpAGUKsV3iGgYSi9fPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7be56ce2c6fdc148e1e649b481dd7b7f3724416801ff0625916fe8a479fc70","last_reissued_at":"2026-06-12T01:09:43.937919Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:43.937919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13157","source_version":1,"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-06-12T01:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61eS4ure5d3Pvjl/AYZcaAY0J4AnC1zyOQo+mFvZvb2Y1PHaU+/HjvpJPay7Lm+YjTrYFg5BbWlj+lBK7lbTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:08:50.606547Z"},"content_sha256":"1c5e26115e5bba029cc49c03a9980e2f119d2d5c4d4bfb82e96b35564fa58270","schema_version":"1.0","event_id":"sha256:1c5e26115e5bba029cc49c03a9980e2f119d2d5c4d4bfb82e96b35564fa58270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7V56K3HCY364CSHB4ZE3JAO5PN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropic Generation of Binary Words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DM","authors_text":"Francis Durand (Universit\\'e Sorbonne Paris-Nord), Olivier Bodini (Universit\\'e Sorbonne Paris-Nord)","submitted_at":"2026-06-11T10:27:33Z","abstract_excerpt":"The uniform generation of k Hamming weight binary words, equivalent to sampling k-subsets from n elements, relies on random bits, which can be expensive. We introduce a novel paradigm, random bit recycling, and use it to generate such binary words in linear time while consuming as few random bits as possible. The resulting algorithm is nearly optimal in terms of random bit consumption, meaning that it closely matches the Shannon entropic lower bound coming from information theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13157","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.13157/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"},"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-06-12T01:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gd8HMYGA+JDK7v+qIeHf3zHllpTURv9nE/CrL3Q26G2+MRKsssh+WYvg66T9zdYGTlCa3bTzqxGYgKhnewmHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:08:50.607042Z"},"content_sha256":"c59e06c38314478f25ca422bbcecfe18b9d7a57eba2a6aff7b9036b670e5b6b9","schema_version":"1.0","event_id":"sha256:c59e06c38314478f25ca422bbcecfe18b9d7a57eba2a6aff7b9036b670e5b6b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7V56K3HCY364CSHB4ZE3JAO5PN/bundle.json","state_url":"https://pith.science/pith/7V56K3HCY364CSHB4ZE3JAO5PN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7V56K3HCY364CSHB4ZE3JAO5PN/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-08-23T07:08:50Z","links":{"resolver":"https://pith.science/pith/7V56K3HCY364CSHB4ZE3JAO5PN","bundle":"https://pith.science/pith/7V56K3HCY364CSHB4ZE3JAO5PN/bundle.json","state":"https://pith.science/pith/7V56K3HCY364CSHB4ZE3JAO5PN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7V56K3HCY364CSHB4ZE3JAO5PN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7V56K3HCY364CSHB4ZE3JAO5PN","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":"30ec50aa7284ed858d611973a181407b40f837b3240f46628882b0a16aebb8ff","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:33Z","title_canon_sha256":"ad0a76c4efb9fe4019be457494ae9ac76d710caafc771cef511bb116af45e539"},"schema_version":"1.0","source":{"id":"2606.13157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13157","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13157v1","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13157","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"7V56K3HCY364","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_16","alias_value":"7V56K3HCY364CSHB","created_at":"2026-06-12T01:09:43Z"},{"alias_kind":"pith_short_8","alias_value":"7V56K3HC","created_at":"2026-06-12T01:09:43Z"}],"graph_snapshots":[{"event_id":"sha256:c59e06c38314478f25ca422bbcecfe18b9d7a57eba2a6aff7b9036b670e5b6b9","target":"graph","created_at":"2026-06-12T01:09:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.13157/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The uniform generation of k Hamming weight binary words, equivalent to sampling k-subsets from n elements, relies on random bits, which can be expensive. We introduce a novel paradigm, random bit recycling, and use it to generate such binary words in linear time while consuming as few random bits as possible. The resulting algorithm is nearly optimal in terms of random bit consumption, meaning that it closely matches the Shannon entropic lower bound coming from information theory.","authors_text":"Francis Durand (Universit\\'e Sorbonne Paris-Nord), Olivier Bodini (Universit\\'e Sorbonne Paris-Nord)","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:33Z","title":"Entropic Generation of Binary Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13157","kind":"arxiv","version":1},"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:1c5e26115e5bba029cc49c03a9980e2f119d2d5c4d4bfb82e96b35564fa58270","target":"record","created_at":"2026-06-12T01:09:43Z","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":"30ec50aa7284ed858d611973a181407b40f837b3240f46628882b0a16aebb8ff","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-11T10:27:33Z","title_canon_sha256":"ad0a76c4efb9fe4019be457494ae9ac76d710caafc771cef511bb116af45e539"},"schema_version":"1.0","source":{"id":"2606.13157","kind":"arxiv","version":1}},"canonical_sha256":"fd7be56ce2c6fdc148e1e649b481dd7b7f3724416801ff0625916fe8a479fc70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd7be56ce2c6fdc148e1e649b481dd7b7f3724416801ff0625916fe8a479fc70","first_computed_at":"2026-06-12T01:09:43.937919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:43.937919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cfbGHLdorVu7nWELsY1FskqQ+FTVAW92tGJfb4GOlI4E1HIGf6nETpnuGuLMTC8rZMzpAGUKsV3iGgYSi9fPCg==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:43.938736Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c5e26115e5bba029cc49c03a9980e2f119d2d5c4d4bfb82e96b35564fa58270","sha256:c59e06c38314478f25ca422bbcecfe18b9d7a57eba2a6aff7b9036b670e5b6b9"],"state_sha256":"5c1805a988be2646bf193abb20acb219ecc7f0852c2f41ce697e06302cf2d798"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zECVReq+rx/MvZnws4S+sHpM9mnf10OIiGQCaEapyDFJDjVhy9i83m58q1tr5SUbDY/vsQ0+uYbs3hOfNYnyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T07:08:50.610787Z","bundle_sha256":"20426c44011c74fa5eb54a4859747d0055b40b569510c13eba89f4fd2c2968c8"}}