{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D3TRPHVIPEBV3BMXV3HIHMWOH7","short_pith_number":"pith:D3TRPHVI","canonical_record":{"source":{"id":"1705.02280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T16:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"ce7a431e36b34df2e97f56f61fc80a8a16993ec6e08a266494b6525ef8d51338","abstract_canon_sha256":"0a30d9ab2312ff020f01d9ac08c830a81d1325e9cab3ba31745cea6ec2e3697d"},"schema_version":"1.0"},"canonical_sha256":"1ee7179ea879035d8597aece83b2ce3ffa61112bde3ab0562da160ac1c45c51a","source":{"kind":"arxiv","id":"1705.02280","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02280","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02280v1","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02280","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"D3TRPHVIPEBV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D3TRPHVIPEBV3BMX","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D3TRPHVI","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D3TRPHVIPEBV3BMXV3HIHMWOH7","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T16:00:25Z","cross_cats_sorted":[],"title_canon_sha256":"ce7a431e36b34df2e97f56f61fc80a8a16993ec6e08a266494b6525ef8d51338","abstract_canon_sha256":"0a30d9ab2312ff020f01d9ac08c830a81d1325e9cab3ba31745cea6ec2e3697d"},"schema_version":"1.0"},"canonical_sha256":"1ee7179ea879035d8597aece83b2ce3ffa61112bde3ab0562da160ac1c45c51a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:00.280456Z","signature_b64":"hOAHjJy2BKw2JfPrJmbxAiSwUN4sXWW2JR+ZvLR25NYrXXrJc85X+XNWFtXeEN8prKi54+TrIXmFOygxo0k0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee7179ea879035d8597aece83b2ce3ffa61112bde3ab0562da160ac1c45c51a","last_reissued_at":"2026-05-18T00:45:00.280059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:00.280059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02280","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-18T00:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlC5qGYdQYa/y+g6Y5ceGP3ibYI2cME10C7m8hucIzwqmlfXNUYRgVhCCHZB5ntrgbId6yOKpR/iPA4kXwErDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:29:55.109941Z"},"content_sha256":"82ecfd484c18e54549a837351cdda27c8db9ed9c4873ccb0d433427c968f2f01","schema_version":"1.0","event_id":"sha256:82ecfd484c18e54549a837351cdda27c8db9ed9c4873ccb0d433427c968f2f01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D3TRPHVIPEBV3BMXV3HIHMWOH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjeev Khanna, Sepehr Assadi, Yang Li","submitted_at":"2017-05-05T16:00:25Z","abstract_excerpt":"In the stochastic matching problem, we are given a general (not necessarily bipartite) graph $G(V,E)$, where each edge in $E$ is realized with some constant probability $p > 0$ and the goal is to compute a bounded-degree (bounded by a function depending only on $p$) subgraph $H$ of $G$ such that the expected maximum matching size in $H$ is close to the expected maximum matching size in $G$. The algorithms in this setting are considered non-adaptive as they have to choose the subgraph $H$ without knowing any information about the set of realized edges in $G$. Originally motivated by an applicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02280","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-18T00:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrsIOklfQiOFzYvaF0IrFsTGZxgO8HAXYwYG76a6QCu+FnJJi8A2uuUvu7y3MngbcTs7dUluHcrormw10b8sDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:29:55.110281Z"},"content_sha256":"37624165092caf766e50419c696a2f9f0467532db90532899e7725e0a5ab0faa","schema_version":"1.0","event_id":"sha256:37624165092caf766e50419c696a2f9f0467532db90532899e7725e0a5ab0faa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/bundle.json","state_url":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/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-03T06:29:55Z","links":{"resolver":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7","bundle":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/bundle.json","state":"https://pith.science/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3TRPHVIPEBV3BMXV3HIHMWOH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D3TRPHVIPEBV3BMXV3HIHMWOH7","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":"0a30d9ab2312ff020f01d9ac08c830a81d1325e9cab3ba31745cea6ec2e3697d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T16:00:25Z","title_canon_sha256":"ce7a431e36b34df2e97f56f61fc80a8a16993ec6e08a266494b6525ef8d51338"},"schema_version":"1.0","source":{"id":"1705.02280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02280","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02280v1","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02280","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"D3TRPHVIPEBV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D3TRPHVIPEBV3BMX","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D3TRPHVI","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:37624165092caf766e50419c696a2f9f0467532db90532899e7725e0a5ab0faa","target":"graph","created_at":"2026-05-18T00:45:00Z","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":"In the stochastic matching problem, we are given a general (not necessarily bipartite) graph $G(V,E)$, where each edge in $E$ is realized with some constant probability $p > 0$ and the goal is to compute a bounded-degree (bounded by a function depending only on $p$) subgraph $H$ of $G$ such that the expected maximum matching size in $H$ is close to the expected maximum matching size in $G$. The algorithms in this setting are considered non-adaptive as they have to choose the subgraph $H$ without knowing any information about the set of realized edges in $G$. Originally motivated by an applicat","authors_text":"Sanjeev Khanna, Sepehr Assadi, Yang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T16:00:25Z","title":"The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02280","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:82ecfd484c18e54549a837351cdda27c8db9ed9c4873ccb0d433427c968f2f01","target":"record","created_at":"2026-05-18T00:45:00Z","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":"0a30d9ab2312ff020f01d9ac08c830a81d1325e9cab3ba31745cea6ec2e3697d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T16:00:25Z","title_canon_sha256":"ce7a431e36b34df2e97f56f61fc80a8a16993ec6e08a266494b6525ef8d51338"},"schema_version":"1.0","source":{"id":"1705.02280","kind":"arxiv","version":1}},"canonical_sha256":"1ee7179ea879035d8597aece83b2ce3ffa61112bde3ab0562da160ac1c45c51a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ee7179ea879035d8597aece83b2ce3ffa61112bde3ab0562da160ac1c45c51a","first_computed_at":"2026-05-18T00:45:00.280059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:00.280059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hOAHjJy2BKw2JfPrJmbxAiSwUN4sXWW2JR+ZvLR25NYrXXrJc85X+XNWFtXeEN8prKi54+TrIXmFOygxo0k0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:00.280456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82ecfd484c18e54549a837351cdda27c8db9ed9c4873ccb0d433427c968f2f01","sha256:37624165092caf766e50419c696a2f9f0467532db90532899e7725e0a5ab0faa"],"state_sha256":"028f4a0fcc37e6e17eb8d573bc49aa6d3552304f67d6bad3f358aafc05afbeb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsLzEqAt1mfU/wSmG+MqT0g2xYDbIB+nc20iqfesgIrKASqNhpiOmBZrJKGUmVCc6rTQEELgTnBwcXyxuMiHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:29:55.112257Z","bundle_sha256":"85a72b916fd88b4292ee00d1c1f8e0c1917481ceb084c3d926b4ca06e4631bc5"}}