{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UNFKHNBQFVH6JMMXQKQKC3LNDV","short_pith_number":"pith:UNFKHNBQ","schema_version":"1.0","canonical_sha256":"a34aa3b4302d4fe4b19782a0a16d6d1d679e7d7f33a118a47a6ea77ef06efc6b","source":{"kind":"arxiv","id":"1512.04226","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.04226","created_at":"2026-05-17T23:44:33.216539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04226v3","created_at":"2026-05-17T23:44:33.216539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04226","created_at":"2026-05-17T23:44:33.216539+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNFKHNBQFVH6","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNFKHNBQFVH6JMMX","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNFKHNBQ","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV","json":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV.json","graph_json":"https://pith.science/api/pith-number/UNFKHNBQFVH6JMMXQKQKC3LNDV/graph.json","events_json":"https://pith.science/api/pith-number/UNFKHNBQFVH6JMMXQKQKC3LNDV/events.json","paper":"https://pith.science/paper/UNFKHNBQ"},"agent_actions":{"view_html":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV","download_json":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV.json","view_paper":"https://pith.science/paper/UNFKHNBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04226&json=true","fetch_graph":"https://pith.science/api/pith-number/UNFKHNBQFVH6JMMXQKQKC3LNDV/graph.json","fetch_events":"https://pith.science/api/pith-number/UNFKHNBQFVH6JMMXQKQKC3LNDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/action/storage_attestation","attest_author":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/action/author_attestation","sign_citation":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/action/citation_signature","submit_replication":"https://pith.science/pith/UNFKHNBQFVH6JMMXQKQKC3LNDV/action/replication_record"}},"created_at":"2026-05-17T23:44:33.216539+00:00","updated_at":"2026-05-17T23:44:33.216539+00:00"}