{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UNFKHNBQFVH6JMMXQKQKC3LNDV","short_pith_number":"pith:UNFKHNBQ","canonical_record":{"source":{"id":"1512.04226","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T09:28:45Z","cross_cats_sorted":[],"title_canon_sha256":"c0ccd80b5768f8c3f646cfe4da146bddf338df29ef5d890c8886c4fb4e1aeb0c","abstract_canon_sha256":"d04fc2b494beffc10b6928a04935c8fbc9987d612e6d1ccdb642e05a12fc9d7f"},"schema_version":"1.0"},"canonical_sha256":"a34aa3b4302d4fe4b19782a0a16d6d1d679e7d7f33a118a47a6ea77ef06efc6b","source":{"kind":"arxiv","id":"1512.04226","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04226","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04226v3","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04226","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"UNFKHNBQFVH6","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UNFKHNBQFVH6JMMX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UNFKHNBQ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UNFKHNBQFVH6JMMXQKQKC3LNDV","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04226","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T09:28:45Z","cross_cats_sorted":[],"title_canon_sha256":"c0ccd80b5768f8c3f646cfe4da146bddf338df29ef5d890c8886c4fb4e1aeb0c","abstract_canon_sha256":"d04fc2b494beffc10b6928a04935c8fbc9987d612e6d1ccdb642e05a12fc9d7f"},"schema_version":"1.0"},"canonical_sha256":"a34aa3b4302d4fe4b19782a0a16d6d1d679e7d7f33a118a47a6ea77ef06efc6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:33.216970Z","signature_b64":"WH+J1MhRD8SWdxMgvNlvDitAdpyEi3BbKqbk9F1bPHusmv2cevMkYp0XHVqlqugmcY/pri5LuDuLt3ZIP3/MBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a34aa3b4302d4fe4b19782a0a16d6d1d679e7d7f33a118a47a6ea77ef06efc6b","last_reissued_at":"2026-05-17T23:44:33.216455Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:33.216455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04226","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-17T23:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kkxb+fkyFMVc3amIeNl9pNND6MIFsdChk8oD8TwfzcSApV7Rp1KBxqt6vh7izqhYram2ID3NuQYns6Py0Il1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:15:21.677519Z"},"content_sha256":"d08b65ab702e6d2e4277a896d4d4d161cc8d1d3271040d9746540b1324caac52","schema_version":"1.0","event_id":"sha256:d08b65ab702e6d2e4277a896d4d4d161cc8d1d3271040d9746540b1324caac52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UNFKHNBQFVH6JMMXQKQKC3LNDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Sampling with Removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bernd G\\\"artner, Johannes Lengler, Kenneth L. Clarkson, May Szedlak","submitted_at":"2015-12-14T09:28:45Z","abstract_excerpt":"We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator spaces; and a setting we introduce, consistent spaces. Such algorithms typically involve a step of finding the optimal solution for a random sample of the constraints. They exploit the condition that, in finite dimension $\\delta$, this sample optimum violates a provably small expected fraction of the non-sampled constraints, with the fraction decreasing in the sample size~$r$. We extend such algorithms by considering"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04226","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-17T23:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RM7FRL2NuLouxLA1p0BiiM3Hh/61+Z1DmDCUsz4YENVlgqDw+UWZy/DtrJYP/rbDkYGECgNED7maMtZF0MFDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:15:21.677864Z"},"content_sha256":"83402cfd57153dda950318d1592dfd196c312f5adb6b68c1c7541eae855d26a4","schema_version":"1.0","event_id":"sha256:83402cfd57153dda950318d1592dfd196c312f5adb6b68c1c7541eae855d26a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/bundle.json","state_url":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/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-09T14:15:21Z","links":{"resolver":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV","bundle":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/bundle.json","state":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UNFKHNBQFVH6JMMXQKQKC3LNDV","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":"d04fc2b494beffc10b6928a04935c8fbc9987d612e6d1ccdb642e05a12fc9d7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T09:28:45Z","title_canon_sha256":"c0ccd80b5768f8c3f646cfe4da146bddf338df29ef5d890c8886c4fb4e1aeb0c"},"schema_version":"1.0","source":{"id":"1512.04226","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04226","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04226v3","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04226","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"UNFKHNBQFVH6","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UNFKHNBQFVH6JMMX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UNFKHNBQ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:83402cfd57153dda950318d1592dfd196c312f5adb6b68c1c7541eae855d26a4","target":"graph","created_at":"2026-05-17T23:44:33Z","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 study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator spaces; and a setting we introduce, consistent spaces. Such algorithms typically involve a step of finding the optimal solution for a random sample of the constraints. They exploit the condition that, in finite dimension $\\delta$, this sample optimum violates a provably small expected fraction of the non-sampled constraints, with the fraction decreasing in the sample size~$r$. We extend such algorithms by considering","authors_text":"Bernd G\\\"artner, Johannes Lengler, Kenneth L. Clarkson, May Szedlak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T09:28:45Z","title":"Random Sampling with Removal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04226","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:d08b65ab702e6d2e4277a896d4d4d161cc8d1d3271040d9746540b1324caac52","target":"record","created_at":"2026-05-17T23:44:33Z","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":"d04fc2b494beffc10b6928a04935c8fbc9987d612e6d1ccdb642e05a12fc9d7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-14T09:28:45Z","title_canon_sha256":"c0ccd80b5768f8c3f646cfe4da146bddf338df29ef5d890c8886c4fb4e1aeb0c"},"schema_version":"1.0","source":{"id":"1512.04226","kind":"arxiv","version":3}},"canonical_sha256":"a34aa3b4302d4fe4b19782a0a16d6d1d679e7d7f33a118a47a6ea77ef06efc6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a34aa3b4302d4fe4b19782a0a16d6d1d679e7d7f33a118a47a6ea77ef06efc6b","first_computed_at":"2026-05-17T23:44:33.216455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:33.216455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WH+J1MhRD8SWdxMgvNlvDitAdpyEi3BbKqbk9F1bPHusmv2cevMkYp0XHVqlqugmcY/pri5LuDuLt3ZIP3/MBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:33.216970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04226","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d08b65ab702e6d2e4277a896d4d4d161cc8d1d3271040d9746540b1324caac52","sha256:83402cfd57153dda950318d1592dfd196c312f5adb6b68c1c7541eae855d26a4"],"state_sha256":"ef7d4af37342fa2d2e9e20a9185ae0a248c67a377d291c3073362ebcc255f1f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiNRRSwsaY7nCLZgHf7od5IxDIPQN3EmlyPNAynk2HhoLnpRDL527/rUwa3X+xORre06h0z4PxYnDVX0TiGyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:15:21.679777Z","bundle_sha256":"8832b7e920893faca5cacb7c347d53e9c861eda9ffb16656ad8382cdce2786f5"}}