{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L653Y5GMATWSVDADX2YPPVDFWK","short_pith_number":"pith:L653Y5GM","canonical_record":{"source":{"id":"1611.00532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T10:20:21Z","cross_cats_sorted":[],"title_canon_sha256":"7b298cb88f6d46070f2d8a050cab7fc05fe0260908ab5b5aa7581c4df2a7fb3e","abstract_canon_sha256":"27f5354d89f366ef7bdaa0c3a51d8b0371e34bd8c3945ac9b79efbaa82b23dd9"},"schema_version":"1.0"},"canonical_sha256":"5fbbbc74cc04ed2a8c03beb0f7d465b2a0ada87f12ccca2df902806293bb0972","source":{"kind":"arxiv","id":"1611.00532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00532","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00532v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00532","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"L653Y5GMATWS","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L653Y5GMATWSVDAD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L653Y5GM","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L653Y5GMATWSVDADX2YPPVDFWK","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T10:20:21Z","cross_cats_sorted":[],"title_canon_sha256":"7b298cb88f6d46070f2d8a050cab7fc05fe0260908ab5b5aa7581c4df2a7fb3e","abstract_canon_sha256":"27f5354d89f366ef7bdaa0c3a51d8b0371e34bd8c3945ac9b79efbaa82b23dd9"},"schema_version":"1.0"},"canonical_sha256":"5fbbbc74cc04ed2a8c03beb0f7d465b2a0ada87f12ccca2df902806293bb0972","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.518033Z","signature_b64":"7H0JeCgDR9D8CPSS6r/m4y8K8h6z4J1Mewn2kvNBuNC68QdjoArV7Ze30BeCo3X4lNO+k0mfyXV7RtV2J7/FBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fbbbc74cc04ed2a8c03beb0f7d465b2a0ada87f12ccca2df902806293bb0972","last_reissued_at":"2026-05-18T01:00:32.517480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.517480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00532","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-05-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zFVwol4OQiLV8dUiCD909xqkReV2bf4/BqBtKQcv4gQ5GC7rjG477wm+CY3Z1qOoMMBelWKFjUjdNWs1pEKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:28:00.883263Z"},"content_sha256":"f8e8590d954adb1e1136154d3068fb0ab53454f8de5f57e90382c6af8b147941","schema_version":"1.0","event_id":"sha256:f8e8590d954adb1e1136154d3068fb0ab53454f8de5f57e90382c6af8b147941"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L653Y5GMATWSVDADX2YPPVDFWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An asymptotically optimal, online algorithm for weighted random sampling with replacement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Micha{\\l} Startek","submitted_at":"2016-11-02T10:20:21Z","abstract_excerpt":"This paper presents a novel algorithm solving the classic problem of generating a random sample of size s from population of size n with non-uniform probabilities. The sampling is done with replacement. The algorithm requires constant additional memory, and works in O(n) time (even when s >> n, in which case the algorithm produces a list containing, for every population member, the number of times it has been selected for sample). The algorithm works online, and as such is well-suited to processing streams. In addition, a novel method of mass-sampling from any discrete distribution using the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00532","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":""},"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-18T01:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/I/YtvyWyZujl/Dn7/5qZnZK0EpGni4ePEfyytneozKO6pKvC7EfgTXPy6YgK5o9RgLrD8n/qD11ZYLToJABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:28:00.883970Z"},"content_sha256":"48e6b67ef7fcf145298542da4111dde35f9b5dbc12de677c7e6fa8cba04079b1","schema_version":"1.0","event_id":"sha256:48e6b67ef7fcf145298542da4111dde35f9b5dbc12de677c7e6fa8cba04079b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L653Y5GMATWSVDADX2YPPVDFWK/bundle.json","state_url":"https://pith.science/pith/L653Y5GMATWSVDADX2YPPVDFWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L653Y5GMATWSVDADX2YPPVDFWK/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-10T11:28:00Z","links":{"resolver":"https://pith.science/pith/L653Y5GMATWSVDADX2YPPVDFWK","bundle":"https://pith.science/pith/L653Y5GMATWSVDADX2YPPVDFWK/bundle.json","state":"https://pith.science/pith/L653Y5GMATWSVDADX2YPPVDFWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L653Y5GMATWSVDADX2YPPVDFWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L653Y5GMATWSVDADX2YPPVDFWK","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":"27f5354d89f366ef7bdaa0c3a51d8b0371e34bd8c3945ac9b79efbaa82b23dd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T10:20:21Z","title_canon_sha256":"7b298cb88f6d46070f2d8a050cab7fc05fe0260908ab5b5aa7581c4df2a7fb3e"},"schema_version":"1.0","source":{"id":"1611.00532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00532","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00532v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00532","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"L653Y5GMATWS","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L653Y5GMATWSVDAD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L653Y5GM","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:48e6b67ef7fcf145298542da4111dde35f9b5dbc12de677c7e6fa8cba04079b1","target":"graph","created_at":"2026-05-18T01:00: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":"This paper presents a novel algorithm solving the classic problem of generating a random sample of size s from population of size n with non-uniform probabilities. The sampling is done with replacement. The algorithm requires constant additional memory, and works in O(n) time (even when s >> n, in which case the algorithm produces a list containing, for every population member, the number of times it has been selected for sample). The algorithm works online, and as such is well-suited to processing streams. In addition, a novel method of mass-sampling from any discrete distribution using the a","authors_text":"Micha{\\l} Startek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T10:20:21Z","title":"An asymptotically optimal, online algorithm for weighted random sampling with replacement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00532","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:f8e8590d954adb1e1136154d3068fb0ab53454f8de5f57e90382c6af8b147941","target":"record","created_at":"2026-05-18T01:00: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":"27f5354d89f366ef7bdaa0c3a51d8b0371e34bd8c3945ac9b79efbaa82b23dd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T10:20:21Z","title_canon_sha256":"7b298cb88f6d46070f2d8a050cab7fc05fe0260908ab5b5aa7581c4df2a7fb3e"},"schema_version":"1.0","source":{"id":"1611.00532","kind":"arxiv","version":1}},"canonical_sha256":"5fbbbc74cc04ed2a8c03beb0f7d465b2a0ada87f12ccca2df902806293bb0972","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fbbbc74cc04ed2a8c03beb0f7d465b2a0ada87f12ccca2df902806293bb0972","first_computed_at":"2026-05-18T01:00:32.517480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:32.517480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7H0JeCgDR9D8CPSS6r/m4y8K8h6z4J1Mewn2kvNBuNC68QdjoArV7Ze30BeCo3X4lNO+k0mfyXV7RtV2J7/FBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:32.518033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8e8590d954adb1e1136154d3068fb0ab53454f8de5f57e90382c6af8b147941","sha256:48e6b67ef7fcf145298542da4111dde35f9b5dbc12de677c7e6fa8cba04079b1"],"state_sha256":"530414d11897542a68b5dc5da7d362193bcfe3b48d07e5ec8cc7ae53c8805942"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TlVNivEPod/Y0cPZk9+zsQ04uuBt7aO78dADrYsgJWlQlwJkROtUZhbr1Db5dFJbu3OtNFp3XKbGu2k15Of0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:28:00.887908Z","bundle_sha256":"5ff894653c56d1569633647aaf71323a9ee6702ce302760379e52bb000e84bcc"}}