{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:AJA4VP226CXIEPIDV4GEULORP5","short_pith_number":"pith:AJA4VP22","schema_version":"1.0","canonical_sha256":"0241cabf5af0ae823d03af0c4a2dd17f6832329e78da53af22006029e046e571","source":{"kind":"arxiv","id":"cs/0205036","version":1},"attestation_state":"computed","paper":{"title":"Randomized Rounding without Solving the Linear Program","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Neal E. Young","submitted_at":"2002-05-18T04:05:19Z","abstract_excerpt":"Randomized rounding is a standard method, based on the probabilistic method, for designing combinatorial approximation algorithms. In Raghavan's seminal paper introducing the method (1988), he writes: \"The time taken to solve the linear program relaxations of the integer programs dominates the net running time theoretically (and, most likely, in practice as well).\"\n  This paper explores how this bottleneck can be avoided for randomized rounding algorithms for packing and covering problems (linear programs, or mixed integer linear programs, having no negative coefficients). The resulting algori"},"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":"cs/0205036","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T04:05:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"792dafa67fc92e86bd45661cc11c0c4d443229b58df544519dfec9a1e5b6aafd","abstract_canon_sha256":"1064a865c553968ba83cfbfe3145f68eaa93867d357a5cdcc98802fe44ecf90a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.974097Z","signature_b64":"C5KljaX07goM2/eHHLlQEweeaqGxHX7WKDMT6S55irRI8Fi7r5+GmFQdHYTBOIx0pG4M1ZYyWFN8IsctBBGbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0241cabf5af0ae823d03af0c4a2dd17f6832329e78da53af22006029e046e571","last_reissued_at":"2026-05-18T01:59:53.973592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.973592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Rounding without Solving the Linear Program","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Neal E. Young","submitted_at":"2002-05-18T04:05:19Z","abstract_excerpt":"Randomized rounding is a standard method, based on the probabilistic method, for designing combinatorial approximation algorithms. In Raghavan's seminal paper introducing the method (1988), he writes: \"The time taken to solve the linear program relaxations of the integer programs dominates the net running time theoretically (and, most likely, in practice as well).\"\n  This paper explores how this bottleneck can be avoided for randomized rounding algorithms for packing and covering problems (linear programs, or mixed integer linear programs, having no negative coefficients). The resulting algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205036","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205036","created_at":"2026-05-18T01:59:53.973669+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205036v1","created_at":"2026-05-18T01:59:53.973669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205036","created_at":"2026-05-18T01:59:53.973669+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJA4VP226CXI","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJA4VP226CXIEPID","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJA4VP22","created_at":"2026-05-18T12:25:50.845339+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/AJA4VP226CXIEPIDV4GEULORP5","json":"https://pith.science/pith/AJA4VP226CXIEPIDV4GEULORP5.json","graph_json":"https://pith.science/api/pith-number/AJA4VP226CXIEPIDV4GEULORP5/graph.json","events_json":"https://pith.science/api/pith-number/AJA4VP226CXIEPIDV4GEULORP5/events.json","paper":"https://pith.science/paper/AJA4VP22"},"agent_actions":{"view_html":"https://pith.science/pith/AJA4VP226CXIEPIDV4GEULORP5","download_json":"https://pith.science/pith/AJA4VP226CXIEPIDV4GEULORP5.json","view_paper":"https://pith.science/paper/AJA4VP22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205036&json=true","fetch_graph":"https://pith.science/api/pith-number/AJA4VP226CXIEPIDV4GEULORP5/graph.json","fetch_events":"https://pith.science/api/pith-number/AJA4VP226CXIEPIDV4GEULORP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJA4VP226CXIEPIDV4GEULORP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJA4VP226CXIEPIDV4GEULORP5/action/storage_attestation","attest_author":"https://pith.science/pith/AJA4VP226CXIEPIDV4GEULORP5/action/author_attestation","sign_citation":"https://pith.science/pith/AJA4VP226CXIEPIDV4GEULORP5/action/citation_signature","submit_replication":"https://pith.science/pith/AJA4VP226CXIEPIDV4GEULORP5/action/replication_record"}},"created_at":"2026-05-18T01:59:53.973669+00:00","updated_at":"2026-05-18T01:59:53.973669+00:00"}