{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:75OJM2WKXWHUFVTBV6Q6HOSU4Q","short_pith_number":"pith:75OJM2WK","canonical_record":{"source":{"id":"1504.02438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"db9578cd81b66087bb17136ca0dc983b96013c76815e108bf3affbc1f16bf005","abstract_canon_sha256":"ccd42e75485f50879ce4d2bffa702eb31274a7c07c2425ce10f76221266df5ee"},"schema_version":"1.0"},"canonical_sha256":"ff5c966acabd8f42d661afa1e3ba54e42793677e2cb0d2b9d7d8900867674ad6","source":{"kind":"arxiv","id":"1504.02438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02438","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02438v1","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02438","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"75OJM2WKXWHU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"75OJM2WKXWHUFVTB","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"75OJM2WK","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:75OJM2WKXWHUFVTBV6Q6HOSU4Q","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"db9578cd81b66087bb17136ca0dc983b96013c76815e108bf3affbc1f16bf005","abstract_canon_sha256":"ccd42e75485f50879ce4d2bffa702eb31274a7c07c2425ce10f76221266df5ee"},"schema_version":"1.0"},"canonical_sha256":"ff5c966acabd8f42d661afa1e3ba54e42793677e2cb0d2b9d7d8900867674ad6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:08.914508Z","signature_b64":"XvhH9rjjreRvbWk65Zrl4aIyn2ytBdPF17rlWzzh0idFLq8Q3PHubZwz571skcSudm8/cvXPyIMkjQlIprx1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff5c966acabd8f42d661afa1e3ba54e42793677e2cb0d2b9d7d8900867674ad6","last_reissued_at":"2026-05-18T02:19:08.913965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:08.913965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02438","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-18T02:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmOnuN9Zfg6tKIHWCe0mxPVKNAJpooiHnWaQtuNkhlMN2Ozz/6QQnKnDAQNycJfZFpuB/gPY4Scknfykau7hBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:29:09.541838Z"},"content_sha256":"ec0f4750fe0efa1b95d85c9cfd5ff6e99bde7eb6ab07f049636a9073ec94d9a8","schema_version":"1.0","event_id":"sha256:ec0f4750fe0efa1b95d85c9cfd5ff6e99bde7eb6ab07f049636a9073ec94d9a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:75OJM2WKXWHUFVTBV6Q6HOSU4Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling limits for exploration algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jaron Sanders, Matthieu Jonckheere, Paola Bermolen","submitted_at":"2015-04-09T19:29:07Z","abstract_excerpt":"We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items $N$ growing to infinity and building on a strong homogeneity assumption, we study using scaling limits of Markovian processes statistical properties of the proportion of active nodes in time. This is a companion paper that rigorously establishes the claims and heuristics presented in [5].\n  [5] Jaron Sanders, Matthieu Jonckheere, and Servaas Kokkelmans. Sub-Poissonian statistics of jamming limits in Rydberg gases. 2015. To appear."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02438","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-18T02:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rKOuYdqx5wB34PzpCQ5Zg1whav+Lw7r1zHvRqrkRuAVKCUNHGnQ+AQnYEqyH7T1YvBbA/r979Rx8Y4XWR16Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:29:09.542178Z"},"content_sha256":"ac14d08a9842677185af9708754f9827ecf43b2177b0bd249d553835ced853fb","schema_version":"1.0","event_id":"sha256:ac14d08a9842677185af9708754f9827ecf43b2177b0bd249d553835ced853fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75OJM2WKXWHUFVTBV6Q6HOSU4Q/bundle.json","state_url":"https://pith.science/pith/75OJM2WKXWHUFVTBV6Q6HOSU4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75OJM2WKXWHUFVTBV6Q6HOSU4Q/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-03T04:29:09Z","links":{"resolver":"https://pith.science/pith/75OJM2WKXWHUFVTBV6Q6HOSU4Q","bundle":"https://pith.science/pith/75OJM2WKXWHUFVTBV6Q6HOSU4Q/bundle.json","state":"https://pith.science/pith/75OJM2WKXWHUFVTBV6Q6HOSU4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75OJM2WKXWHUFVTBV6Q6HOSU4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:75OJM2WKXWHUFVTBV6Q6HOSU4Q","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":"ccd42e75485f50879ce4d2bffa702eb31274a7c07c2425ce10f76221266df5ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:29:07Z","title_canon_sha256":"db9578cd81b66087bb17136ca0dc983b96013c76815e108bf3affbc1f16bf005"},"schema_version":"1.0","source":{"id":"1504.02438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02438","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02438v1","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02438","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"75OJM2WKXWHU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"75OJM2WKXWHUFVTB","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"75OJM2WK","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:ac14d08a9842677185af9708754f9827ecf43b2177b0bd249d553835ced853fb","target":"graph","created_at":"2026-05-18T02:19:08Z","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":"We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items $N$ growing to infinity and building on a strong homogeneity assumption, we study using scaling limits of Markovian processes statistical properties of the proportion of active nodes in time. This is a companion paper that rigorously establishes the claims and heuristics presented in [5].\n  [5] Jaron Sanders, Matthieu Jonckheere, and Servaas Kokkelmans. Sub-Poissonian statistics of jamming limits in Rydberg gases. 2015. To appear.","authors_text":"Jaron Sanders, Matthieu Jonckheere, Paola Bermolen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:29:07Z","title":"Scaling limits for exploration algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02438","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:ec0f4750fe0efa1b95d85c9cfd5ff6e99bde7eb6ab07f049636a9073ec94d9a8","target":"record","created_at":"2026-05-18T02:19:08Z","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":"ccd42e75485f50879ce4d2bffa702eb31274a7c07c2425ce10f76221266df5ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-09T19:29:07Z","title_canon_sha256":"db9578cd81b66087bb17136ca0dc983b96013c76815e108bf3affbc1f16bf005"},"schema_version":"1.0","source":{"id":"1504.02438","kind":"arxiv","version":1}},"canonical_sha256":"ff5c966acabd8f42d661afa1e3ba54e42793677e2cb0d2b9d7d8900867674ad6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff5c966acabd8f42d661afa1e3ba54e42793677e2cb0d2b9d7d8900867674ad6","first_computed_at":"2026-05-18T02:19:08.913965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:08.913965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XvhH9rjjreRvbWk65Zrl4aIyn2ytBdPF17rlWzzh0idFLq8Q3PHubZwz571skcSudm8/cvXPyIMkjQlIprx1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:08.914508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec0f4750fe0efa1b95d85c9cfd5ff6e99bde7eb6ab07f049636a9073ec94d9a8","sha256:ac14d08a9842677185af9708754f9827ecf43b2177b0bd249d553835ced853fb"],"state_sha256":"4f543477d68c6ce0ac5243370889f8fd4cb86bf451b34765565991f76ec6f08e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZY4uEOsvP/gqFH/ySYiZkcQWGdhdLby/6A4JPH8w4McWHZuSr+ZRb7A6uVWNYXQbmpMpexFpED+7X5Z63JeAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:29:09.544269Z","bundle_sha256":"434ee43539bf3a4eedb2891277bd6981770f874722da6e9956695c8b4ceb2328"}}