{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:I3C4UM7VABVTEP2YGW42WCYOFQ","short_pith_number":"pith:I3C4UM7V","canonical_record":{"source":{"id":"1510.07428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-26T09:57:54Z","cross_cats_sorted":[],"title_canon_sha256":"1dae2357f19ba0619a43295ee3de8b882c6e708d621a837c6d215a2b09f64b19","abstract_canon_sha256":"4da8658af5dcba4cc48a270e46cd93bc6277518d8c9db9e0fcd885f9276795d2"},"schema_version":"1.0"},"canonical_sha256":"46c5ca33f5006b323f5835b9ab0b0e2c17225362c5fef5974a66fc330978210e","source":{"kind":"arxiv","id":"1510.07428","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07428","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07428v1","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07428","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"I3C4UM7VABVT","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I3C4UM7VABVTEP2Y","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I3C4UM7V","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:I3C4UM7VABVTEP2YGW42WCYOFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-26T09:57:54Z","cross_cats_sorted":[],"title_canon_sha256":"1dae2357f19ba0619a43295ee3de8b882c6e708d621a837c6d215a2b09f64b19","abstract_canon_sha256":"4da8658af5dcba4cc48a270e46cd93bc6277518d8c9db9e0fcd885f9276795d2"},"schema_version":"1.0"},"canonical_sha256":"46c5ca33f5006b323f5835b9ab0b0e2c17225362c5fef5974a66fc330978210e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:14.110997Z","signature_b64":"n5kclNRTakSIAETzKggFPowlCiAim5GKit1vj86K15RfkwkEIX4i9IOmP6hq/0csa1Ha7xo2XWmWFduuEQrHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c5ca33f5006b323f5835b9ab0b0e2c17225362c5fef5974a66fc330978210e","last_reissued_at":"2026-05-18T01:29:14.110352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:14.110352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07428","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:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZMoglg9HNg2FxVAun/ib5d68Z2uko6kG/sSudOiMc+MiGOqTHkCkI4POIKbjC3JvhesNx1wLtqiuKnaaMCQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:27:31.113934Z"},"content_sha256":"a6968aea957bc5559d71194924c1c8aa995077d21a3f942488ba365c764df2a1","schema_version":"1.0","event_id":"sha256:a6968aea957bc5559d71194924c1c8aa995077d21a3f942488ba365c764df2a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:I3C4UM7VABVTEP2YGW42WCYOFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A geometric Achlioptas process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Reto Sp\\\"ohel, Tobias M\\\"uller","submitted_at":"2015-10-26T09:57:54Z","abstract_excerpt":"The random geometric graph is obtained by sampling $n$ points from the unit square (uniformly at random and independently), and connecting two points whenever their distance is at most $r$, for some given $r=r(n)$. We consider the following variation on the random geometric graph: in each of $n$ rounds in total, a player is offered two random points from the unit square, and has to select exactly one of these two points for inclusion in the evolving geometric graph. We study the problem of avoiding a linear-sized (or \"giant\") component in this setting. Specifically, we show that for any $r\\ll("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07428","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:29:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDHImdxdbUlMnSc4wBDGaDgb1RzbuHhlvrrJdMFyvGx0agUv0SYecaDrsuykXBv/nicnMknhQrs0tvD21FLHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:27:31.114747Z"},"content_sha256":"380d282fd0f9daf16ab5cf7b1781ee9d7a6d3fbeb155b10b440006a12e584e6f","schema_version":"1.0","event_id":"sha256:380d282fd0f9daf16ab5cf7b1781ee9d7a6d3fbeb155b10b440006a12e584e6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3C4UM7VABVTEP2YGW42WCYOFQ/bundle.json","state_url":"https://pith.science/pith/I3C4UM7VABVTEP2YGW42WCYOFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3C4UM7VABVTEP2YGW42WCYOFQ/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-05T20:27:31Z","links":{"resolver":"https://pith.science/pith/I3C4UM7VABVTEP2YGW42WCYOFQ","bundle":"https://pith.science/pith/I3C4UM7VABVTEP2YGW42WCYOFQ/bundle.json","state":"https://pith.science/pith/I3C4UM7VABVTEP2YGW42WCYOFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3C4UM7VABVTEP2YGW42WCYOFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:I3C4UM7VABVTEP2YGW42WCYOFQ","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":"4da8658af5dcba4cc48a270e46cd93bc6277518d8c9db9e0fcd885f9276795d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-26T09:57:54Z","title_canon_sha256":"1dae2357f19ba0619a43295ee3de8b882c6e708d621a837c6d215a2b09f64b19"},"schema_version":"1.0","source":{"id":"1510.07428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07428","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07428v1","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07428","created_at":"2026-05-18T01:29:14Z"},{"alias_kind":"pith_short_12","alias_value":"I3C4UM7VABVT","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I3C4UM7VABVTEP2Y","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I3C4UM7V","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:380d282fd0f9daf16ab5cf7b1781ee9d7a6d3fbeb155b10b440006a12e584e6f","target":"graph","created_at":"2026-05-18T01:29:14Z","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":"The random geometric graph is obtained by sampling $n$ points from the unit square (uniformly at random and independently), and connecting two points whenever their distance is at most $r$, for some given $r=r(n)$. We consider the following variation on the random geometric graph: in each of $n$ rounds in total, a player is offered two random points from the unit square, and has to select exactly one of these two points for inclusion in the evolving geometric graph. We study the problem of avoiding a linear-sized (or \"giant\") component in this setting. Specifically, we show that for any $r\\ll(","authors_text":"Reto Sp\\\"ohel, Tobias M\\\"uller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-26T09:57:54Z","title":"A geometric Achlioptas process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07428","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:a6968aea957bc5559d71194924c1c8aa995077d21a3f942488ba365c764df2a1","target":"record","created_at":"2026-05-18T01:29:14Z","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":"4da8658af5dcba4cc48a270e46cd93bc6277518d8c9db9e0fcd885f9276795d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-26T09:57:54Z","title_canon_sha256":"1dae2357f19ba0619a43295ee3de8b882c6e708d621a837c6d215a2b09f64b19"},"schema_version":"1.0","source":{"id":"1510.07428","kind":"arxiv","version":1}},"canonical_sha256":"46c5ca33f5006b323f5835b9ab0b0e2c17225362c5fef5974a66fc330978210e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46c5ca33f5006b323f5835b9ab0b0e2c17225362c5fef5974a66fc330978210e","first_computed_at":"2026-05-18T01:29:14.110352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:14.110352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n5kclNRTakSIAETzKggFPowlCiAim5GKit1vj86K15RfkwkEIX4i9IOmP6hq/0csa1Ha7xo2XWmWFduuEQrHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:14.110997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6968aea957bc5559d71194924c1c8aa995077d21a3f942488ba365c764df2a1","sha256:380d282fd0f9daf16ab5cf7b1781ee9d7a6d3fbeb155b10b440006a12e584e6f"],"state_sha256":"b24a70ec70b16d1c1e44aaf4dc5ec7f6aeb6bc4a29e98a7514ee6328b50913ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Ce5WoIatUIy9+VfATFC0YUVQIsKdbxIly0SX7aQVNeJ8KjtJGyPquf58iiiuf7j746zlMPIa1evvKb6bfsPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:27:31.119733Z","bundle_sha256":"00c0e77ec08c7fea4a4161d94f2019b4e36f247a87d953bf4240833c20c478cb"}}