{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SXG3PBKDAUU736L4PTJM5EHCY2","short_pith_number":"pith:SXG3PBKD","canonical_record":{"source":{"id":"1008.5356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-31T16:36:56Z","cross_cats_sorted":[],"title_canon_sha256":"cf660d1c488ff057ef121670e608caa59c11612e1c61d82e97211c8a596de579","abstract_canon_sha256":"b55dc160e83bf5c7e6124345ca546a5ef384c8ed68c595fa1b14941e699c186e"},"schema_version":"1.0"},"canonical_sha256":"95cdb785430529fdf97c7cd2ce90e2c6adebbba47c639184d5b71ed50b2a95e2","source":{"kind":"arxiv","id":"1008.5356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5356","created_at":"2026-05-18T04:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5356v1","created_at":"2026-05-18T04:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5356","created_at":"2026-05-18T04:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"SXG3PBKDAUU7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SXG3PBKDAUU736L4","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SXG3PBKD","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SXG3PBKDAUU736L4PTJM5EHCY2","target":"record","payload":{"canonical_record":{"source":{"id":"1008.5356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-31T16:36:56Z","cross_cats_sorted":[],"title_canon_sha256":"cf660d1c488ff057ef121670e608caa59c11612e1c61d82e97211c8a596de579","abstract_canon_sha256":"b55dc160e83bf5c7e6124345ca546a5ef384c8ed68c595fa1b14941e699c186e"},"schema_version":"1.0"},"canonical_sha256":"95cdb785430529fdf97c7cd2ce90e2c6adebbba47c639184d5b71ed50b2a95e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:36.113681Z","signature_b64":"r7iOfSZnbmvfxOHz9lbQhEE1HV0j+Pdnj8wiq8bzAfXe1KYeYH30aO8xPbeZPjHVXPfgTrjVPVaa0Ay0PlCoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95cdb785430529fdf97c7cd2ce90e2c6adebbba47c639184d5b71ed50b2a95e2","last_reissued_at":"2026-05-18T04:41:36.113229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:36.113229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.5356","source_version":1,"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-18T04:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AevUEllr0yVC5YKsDiEK654DA2MeoC4wELAapIhTpOShqcvy2kpvfdhGpco/gX4xJZyHEZ065J9DMryh9JJ3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:22:52.240902Z"},"content_sha256":"c40484f73b6f91d289d5eb3fef79f911c86fc15a2929c1e254a31cd62c7b974a","schema_version":"1.0","event_id":"sha256:c40484f73b6f91d289d5eb3fef79f911c86fc15a2929c1e254a31cd62c7b974a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SXG3PBKDAUU736L4PTJM5EHCY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Atri Rudra, Jian Li, Julian Mestre, Nikhil Bansal, Viswanath Nagarajan","submitted_at":"2010-08-31T16:36:56Z","abstract_excerpt":"Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. Given these probabilities, we want to build a large/heavy matching in the randomly generated graph. However, the only way we can find out whether an edge is present or not is to query it, and if the edge is indeed present in the graph, we are forced to add it to our matching. Further, each vertex $i$ is allowed to be queried at most $t_i$ times. How should we adaptively query the edges to maximize the expected weight of the matching? We consider several matching problems in this gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5356","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"},"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-18T04:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbiPSs3EHK6HHqSnsWLy2RJdgrV6A+X109HVPFpX62qBNBL+UwWn1984QGZ/0SFMvDrkbdXTJXvWaKGPbIanBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:22:52.241249Z"},"content_sha256":"ab7f0956762e0db390fe9859f3d58f005888aa1b81f67bc268282b3fbc383fd0","schema_version":"1.0","event_id":"sha256:ab7f0956762e0db390fe9859f3d58f005888aa1b81f67bc268282b3fbc383fd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXG3PBKDAUU736L4PTJM5EHCY2/bundle.json","state_url":"https://pith.science/pith/SXG3PBKDAUU736L4PTJM5EHCY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXG3PBKDAUU736L4PTJM5EHCY2/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-05-31T21:22:52Z","links":{"resolver":"https://pith.science/pith/SXG3PBKDAUU736L4PTJM5EHCY2","bundle":"https://pith.science/pith/SXG3PBKDAUU736L4PTJM5EHCY2/bundle.json","state":"https://pith.science/pith/SXG3PBKDAUU736L4PTJM5EHCY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXG3PBKDAUU736L4PTJM5EHCY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SXG3PBKDAUU736L4PTJM5EHCY2","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":"b55dc160e83bf5c7e6124345ca546a5ef384c8ed68c595fa1b14941e699c186e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-31T16:36:56Z","title_canon_sha256":"cf660d1c488ff057ef121670e608caa59c11612e1c61d82e97211c8a596de579"},"schema_version":"1.0","source":{"id":"1008.5356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5356","created_at":"2026-05-18T04:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5356v1","created_at":"2026-05-18T04:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5356","created_at":"2026-05-18T04:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"SXG3PBKDAUU7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SXG3PBKDAUU736L4","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SXG3PBKD","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:ab7f0956762e0db390fe9859f3d58f005888aa1b81f67bc268282b3fbc383fd0","target":"graph","created_at":"2026-05-18T04:41:36Z","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":"Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. Given these probabilities, we want to build a large/heavy matching in the randomly generated graph. However, the only way we can find out whether an edge is present or not is to query it, and if the edge is indeed present in the graph, we are forced to add it to our matching. Further, each vertex $i$ is allowed to be queried at most $t_i$ times. How should we adaptively query the edges to maximize the expected weight of the matching? We consider several matching problems in this gen","authors_text":"Anupam Gupta, Atri Rudra, Jian Li, Julian Mestre, Nikhil Bansal, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-31T16:36:56Z","title":"When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5356","kind":"arxiv","version":1},"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:c40484f73b6f91d289d5eb3fef79f911c86fc15a2929c1e254a31cd62c7b974a","target":"record","created_at":"2026-05-18T04:41:36Z","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":"b55dc160e83bf5c7e6124345ca546a5ef384c8ed68c595fa1b14941e699c186e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-31T16:36:56Z","title_canon_sha256":"cf660d1c488ff057ef121670e608caa59c11612e1c61d82e97211c8a596de579"},"schema_version":"1.0","source":{"id":"1008.5356","kind":"arxiv","version":1}},"canonical_sha256":"95cdb785430529fdf97c7cd2ce90e2c6adebbba47c639184d5b71ed50b2a95e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95cdb785430529fdf97c7cd2ce90e2c6adebbba47c639184d5b71ed50b2a95e2","first_computed_at":"2026-05-18T04:41:36.113229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:36.113229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r7iOfSZnbmvfxOHz9lbQhEE1HV0j+Pdnj8wiq8bzAfXe1KYeYH30aO8xPbeZPjHVXPfgTrjVPVaa0Ay0PlCoBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:36.113681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.5356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c40484f73b6f91d289d5eb3fef79f911c86fc15a2929c1e254a31cd62c7b974a","sha256:ab7f0956762e0db390fe9859f3d58f005888aa1b81f67bc268282b3fbc383fd0"],"state_sha256":"f6eb923fa7412ea9ae8cebfae251346e03ca7ecb395d791098780b67a57c2bfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWT7c3Cb1zPI9act04VJy7n/mxM2yGG486+mdIDvBANB+XF5RbJZb24mdo6PD3Y/hKfV9C2mURw+pT1kolT3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:22:52.243392Z","bundle_sha256":"a9e7e6563df38c638e15d9cb09285139c0178fd30e102e73fc02b66d899f11ca"}}