{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:46BWQ6SWF4BOSCANLTWCNAWGSZ","short_pith_number":"pith:46BWQ6SW","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"},"canonical_sha256":"e783687a562f02e9080d5cec2682c6965305d24d199cb52f9fff02732c41fe46","source":{"kind":"arxiv","id":"1408.0488","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0488","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0488v2","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0488","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"46BWQ6SWF4BO","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"46BWQ6SWF4BOSCAN","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"46BWQ6SW","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:46BWQ6SWF4BOSCANLTWCNAWGSZ","target":"record","payload":{"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"},"canonical_sha256":"e783687a562f02e9080d5cec2682c6965305d24d199cb52f9fff02732c41fe46","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"},"source_kind":"arxiv","source_id":"1408.0488","source_version":2,"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-18T02:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGJvIsW/WLz4tyHYbI3HPY65vDGiQXWO5iHqqeEYNVUlBqxHhUwQhLTpgJDGT+Xr3GdtL9n0b/ao2ex2rNFJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:25:26.866362Z"},"content_sha256":"cd6f8e674842df581a3f02fd5c40faedec580be8d1e50df5481dfa2d4dfca66c","schema_version":"1.0","event_id":"sha256:cd6f8e674842df581a3f02fd5c40faedec580be8d1e50df5481dfa2d4dfca66c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:46BWQ6SWF4BOSCANLTWCNAWGSZ","target":"graph","payload":{"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"},"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-18T02:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+CvzspXY7rOLFcHOz2Sn/41Oa5+zbqkX+GtR+WrsJWvb8e6eTipL7CSkifzJgQamVxCQvVjhWH+spDvSHUTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:25:26.866703Z"},"content_sha256":"86969a7ad46efcb85dbf6851737b9ef8d883130a96b7b7a68b18f9b22e4c1694","schema_version":"1.0","event_id":"sha256:86969a7ad46efcb85dbf6851737b9ef8d883130a96b7b7a68b18f9b22e4c1694"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/bundle.json","state_url":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/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-03T01:25:26Z","links":{"resolver":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ","bundle":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/bundle.json","state":"https://pith.science/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46BWQ6SWF4BOSCANLTWCNAWGSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:46BWQ6SWF4BOSCANLTWCNAWGSZ","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":"3c72ce3e0a0fec3f858acf09cb7e741830c3d22e813c65f36fb1bd55417d9a19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-03T12:10:32Z","title_canon_sha256":"1992809cd46508d9bedd91a29aef4071a11d9921bf5d0602778d3ed1039953ce"},"schema_version":"1.0","source":{"id":"1408.0488","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0488","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0488v2","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0488","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"46BWQ6SWF4BO","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"46BWQ6SWF4BOSCAN","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"46BWQ6SW","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:86969a7ad46efcb85dbf6851737b9ef8d883130a96b7b7a68b18f9b22e4c1694","target":"graph","created_at":"2026-05-18T02:45:30Z","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 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 ","authors_text":"Sandeep Sen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-03T12:10:32Z","title":"Improved Randomized Rounding using Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0488","kind":"arxiv","version":2},"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:cd6f8e674842df581a3f02fd5c40faedec580be8d1e50df5481dfa2d4dfca66c","target":"record","created_at":"2026-05-18T02:45:30Z","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":"3c72ce3e0a0fec3f858acf09cb7e741830c3d22e813c65f36fb1bd55417d9a19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-03T12:10:32Z","title_canon_sha256":"1992809cd46508d9bedd91a29aef4071a11d9921bf5d0602778d3ed1039953ce"},"schema_version":"1.0","source":{"id":"1408.0488","kind":"arxiv","version":2}},"canonical_sha256":"e783687a562f02e9080d5cec2682c6965305d24d199cb52f9fff02732c41fe46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e783687a562f02e9080d5cec2682c6965305d24d199cb52f9fff02732c41fe46","first_computed_at":"2026-05-18T02:45:30.974305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:30.974305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gksws0DNVV8U/B/PCV6LnNjTx7uo1Tua9YCd8JFecW6mrPMbvs8mry6jOLnFu4T7WR9+nbALGhIUolldwa28AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:30.974937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0488","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd6f8e674842df581a3f02fd5c40faedec580be8d1e50df5481dfa2d4dfca66c","sha256:86969a7ad46efcb85dbf6851737b9ef8d883130a96b7b7a68b18f9b22e4c1694"],"state_sha256":"30e3af0014f55077a7e6b45bfd360dd93e6516f8edbf459666916bbb6a08cd3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3i65PIJHKBBiTEcG4YGCbZ8G/DO+4vellxcVQ3WtprIc4tDMX45Upwy6+krSnVEbxopd3gkF+5KoZQ3SeH4/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:25:26.868652Z","bundle_sha256":"90ae12251be09d9c28205f9e460532ced855ca7b63b0218ee089bb3daccf2f74"}}