{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:33Q4WCMMTT3MALR56SSA5BYHM3","short_pith_number":"pith:33Q4WCMM","canonical_record":{"source":{"id":"1407.4094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-15T18:52:32Z","cross_cats_sorted":[],"title_canon_sha256":"3efe3a427e07ccf33b490b824ed598cc61be153b216c24f619bcf34fc4373a68","abstract_canon_sha256":"fcdb0c3b6d9f7de4cf65a485b929430bbaf95bf47ee8262a560fbdb7eb590b6c"},"schema_version":"1.0"},"canonical_sha256":"dee1cb098c9cf6c02e3df4a40e870766e7c330acb9eb65006b03b71f74a4703b","source":{"kind":"arxiv","id":"1407.4094","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4094","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4094v2","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4094","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"33Q4WCMMTT3M","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"33Q4WCMMTT3MALR5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"33Q4WCMM","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:33Q4WCMMTT3MALR56SSA5BYHM3","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-15T18:52:32Z","cross_cats_sorted":[],"title_canon_sha256":"3efe3a427e07ccf33b490b824ed598cc61be153b216c24f619bcf34fc4373a68","abstract_canon_sha256":"fcdb0c3b6d9f7de4cf65a485b929430bbaf95bf47ee8262a560fbdb7eb590b6c"},"schema_version":"1.0"},"canonical_sha256":"dee1cb098c9cf6c02e3df4a40e870766e7c330acb9eb65006b03b71f74a4703b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:33.715532Z","signature_b64":"cK+ctZ1BF/jXc3lKevn+Wdfu0XF8jV9dQTV6JcQssn3j28in9cat5AEdAt/RPqBCP6RXF+LB4U4YegtlMXrJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee1cb098c9cf6c02e3df4a40e870766e7c330acb9eb65006b03b71f74a4703b","last_reissued_at":"2026-05-18T02:17:33.714831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:33.714831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4094","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:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYc+LTt3EUVCdNliHKz88qrF9zo8hKrbbXx34jCViGJeCc5QA4HGLhpZ3XH+FrgEVopj3EEa4aDhgU9+ib2vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:10:07.489934Z"},"content_sha256":"c8875fbb069011bf3b438c82d5ca3d4d36edd29c1200fd441aa1df1b29907377","schema_version":"1.0","event_id":"sha256:c8875fbb069011bf3b438c82d5ca3d4d36edd29c1200fd441aa1df1b29907377"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:33Q4WCMMTT3MALR56SSA5BYHM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ankit Sharma, Ariel D. Procaccia, Avrim Blum, John P. Dickerson, Nika Haghtalab, Tuomas Sandholm","submitted_at":"2014-07-15T18:52:32Z","abstract_excerpt":"The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic $k$-set packing, where the problem is to find a maximum packing of sets, each of which exists with some probability. In this paper, we provide edge and set query algorithms for these two problems, respectively, that provably achieve some fraction of the omniscient optimal solution.\n  Our main theoretical result for the stochastic matching (i.e., $2$-set packing) problem is the design of an \\emph{adaptive} algorithm that q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4094","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:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6ZzvRvPp4BwaDbApCW6qZeqakL88kl9Q8zvQ5zYGGt2aZsKcmUSuTH0Z1VaGbVSSamIn+2VWx9wIMGtqGQZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:10:07.490282Z"},"content_sha256":"74f957979fb958a1ad40c1e6a95b564643181164245b556e942e3235d851b896","schema_version":"1.0","event_id":"sha256:74f957979fb958a1ad40c1e6a95b564643181164245b556e942e3235d851b896"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33Q4WCMMTT3MALR56SSA5BYHM3/bundle.json","state_url":"https://pith.science/pith/33Q4WCMMTT3MALR56SSA5BYHM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33Q4WCMMTT3MALR56SSA5BYHM3/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-30T06:10:07Z","links":{"resolver":"https://pith.science/pith/33Q4WCMMTT3MALR56SSA5BYHM3","bundle":"https://pith.science/pith/33Q4WCMMTT3MALR56SSA5BYHM3/bundle.json","state":"https://pith.science/pith/33Q4WCMMTT3MALR56SSA5BYHM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33Q4WCMMTT3MALR56SSA5BYHM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:33Q4WCMMTT3MALR56SSA5BYHM3","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":"fcdb0c3b6d9f7de4cf65a485b929430bbaf95bf47ee8262a560fbdb7eb590b6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-15T18:52:32Z","title_canon_sha256":"3efe3a427e07ccf33b490b824ed598cc61be153b216c24f619bcf34fc4373a68"},"schema_version":"1.0","source":{"id":"1407.4094","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4094","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4094v2","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4094","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"33Q4WCMMTT3M","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"33Q4WCMMTT3MALR5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"33Q4WCMM","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:74f957979fb958a1ad40c1e6a95b564643181164245b556e942e3235d851b896","target":"graph","created_at":"2026-05-18T02:17:33Z","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":"The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic $k$-set packing, where the problem is to find a maximum packing of sets, each of which exists with some probability. In this paper, we provide edge and set query algorithms for these two problems, respectively, that provably achieve some fraction of the omniscient optimal solution.\n  Our main theoretical result for the stochastic matching (i.e., $2$-set packing) problem is the design of an \\emph{adaptive} algorithm that q","authors_text":"Ankit Sharma, Ariel D. Procaccia, Avrim Blum, John P. Dickerson, Nika Haghtalab, Tuomas Sandholm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-15T18:52:32Z","title":"Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4094","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:c8875fbb069011bf3b438c82d5ca3d4d36edd29c1200fd441aa1df1b29907377","target":"record","created_at":"2026-05-18T02:17:33Z","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":"fcdb0c3b6d9f7de4cf65a485b929430bbaf95bf47ee8262a560fbdb7eb590b6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-15T18:52:32Z","title_canon_sha256":"3efe3a427e07ccf33b490b824ed598cc61be153b216c24f619bcf34fc4373a68"},"schema_version":"1.0","source":{"id":"1407.4094","kind":"arxiv","version":2}},"canonical_sha256":"dee1cb098c9cf6c02e3df4a40e870766e7c330acb9eb65006b03b71f74a4703b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dee1cb098c9cf6c02e3df4a40e870766e7c330acb9eb65006b03b71f74a4703b","first_computed_at":"2026-05-18T02:17:33.714831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:33.714831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cK+ctZ1BF/jXc3lKevn+Wdfu0XF8jV9dQTV6JcQssn3j28in9cat5AEdAt/RPqBCP6RXF+LB4U4YegtlMXrJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:33.715532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4094","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8875fbb069011bf3b438c82d5ca3d4d36edd29c1200fd441aa1df1b29907377","sha256:74f957979fb958a1ad40c1e6a95b564643181164245b556e942e3235d851b896"],"state_sha256":"eed3d2f6a77d1fc21c7b16d3deb3c2ccfa66a8127aef12e787823577e1e62ee7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfIVhr/7a1MxlwJkOOGHHbpWfTOSFXTY9qziepTPpzZGLKQFLeLs0CFwik5q7KKIXh17ULGd070azbGmu1ZIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:10:07.492201Z","bundle_sha256":"7974a61d105ea540984de243e44a79a9972f5173ffed84cadf4096d8cd73f2e3"}}