{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:46BWQ6SWF4BOSCANLTWCNAWGSZ","short_pith_number":"pith:46BWQ6SW","schema_version":"1.0","canonical_sha256":"e783687a562f02e9080d5cec2682c6965305d24d199cb52f9fff02732c41fe46","source":{"kind":"arxiv","id":"1408.0488","version":2},"attestation_state":"computed","paper":{"title":"Improved Randomized Rounding using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sandeep Sen","submitted_at":"2014-08-03T12:10:32Z","abstract_excerpt":"We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\\bar{x}$, the procedure converges in polynomial time to a distribution over (possibly infeasible) point set $P \\subset {\\{0,1 \\}}^n$ such that the expected value of any linear objective function over $P$ equals the value at $\\bar{x}$. This is an alternate approach to the classical randomized rounding method of Raghavan and Thompson \\cite{RT:87}.\n  Our procedure is very general and in conjunction with discrepancy "},"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":"1408.0488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-03T12:10:32Z","cross_cats_sorted":[],"title_canon_sha256":"1992809cd46508d9bedd91a29aef4071a11d9921bf5d0602778d3ed1039953ce","abstract_canon_sha256":"3c72ce3e0a0fec3f858acf09cb7e741830c3d22e813c65f36fb1bd55417d9a19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.974937Z","signature_b64":"Gksws0DNVV8U/B/PCV6LnNjTx7uo1Tua9YCd8JFecW6mrPMbvs8mry6jOLnFu4T7WR9+nbALGhIUolldwa28AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e783687a562f02e9080d5cec2682c6965305d24d199cb52f9fff02732c41fe46","last_reissued_at":"2026-05-18T02:45:30.974305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.974305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Randomized Rounding using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sandeep Sen","submitted_at":"2014-08-03T12:10:32Z","abstract_excerpt":"We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\\bar{x}$, the procedure converges in polynomial time to a distribution over (possibly infeasible) point set $P \\subset {\\{0,1 \\}}^n$ such that the expected value of any linear objective function over $P$ equals the value at $\\bar{x}$. This is an alternate approach to the classical randomized rounding method of Raghavan and Thompson \\cite{RT:87}.\n  Our procedure is very general and in conjunction with discrepancy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0488","kind":"arxiv","version":2},"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":"1408.0488","created_at":"2026-05-18T02:45:30.974407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0488v2","created_at":"2026-05-18T02:45:30.974407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0488","created_at":"2026-05-18T02:45:30.974407+00:00"},{"alias_kind":"pith_short_12","alias_value":"46BWQ6SWF4BO","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"46BWQ6SWF4BOSCAN","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"46BWQ6SW","created_at":"2026-05-18T12:28:14.216126+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/46BWQ6SWF4BOSCANLTWCNAWGSZ","json":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ.json","graph_json":"https://pith.science/api/pith-number/46BWQ6SWF4BOSCANLTWCNAWGSZ/graph.json","events_json":"https://pith.science/api/pith-number/46BWQ6SWF4BOSCANLTWCNAWGSZ/events.json","paper":"https://pith.science/paper/46BWQ6SW"},"agent_actions":{"view_html":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ","download_json":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ.json","view_paper":"https://pith.science/paper/46BWQ6SW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0488&json=true","fetch_graph":"https://pith.science/api/pith-number/46BWQ6SWF4BOSCANLTWCNAWGSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/46BWQ6SWF4BOSCANLTWCNAWGSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/action/storage_attestation","attest_author":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/action/author_attestation","sign_citation":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/action/citation_signature","submit_replication":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/action/replication_record"}},"created_at":"2026-05-18T02:45:30.974407+00:00","updated_at":"2026-05-18T02:45:30.974407+00:00"}