{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V74IKHDCF7EZXOY65LDGLSPWFU","short_pith_number":"pith:V74IKHDC","schema_version":"1.0","canonical_sha256":"aff8851c622fc99bbb1eeac665c9f62d3834fb48dab77d6cf38f0fe8c3d8a9a1","source":{"kind":"arxiv","id":"1705.06631","version":1},"attestation_state":"computed","paper":{"title":"Robust randomized matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jannik Matuschke, Jos\\'e A. Soto, Martin Skutella","submitted_at":"2017-05-18T14:53:25Z","abstract_excerpt":"The following game is played on a weighted graph: Alice selects a matching $M$ and Bob selects a number $k$. Alice's payoff is the ratio of the weight of the $k$ heaviest edges of $M$ to the maximum weight of a matching of size at most $k$. If $M$ guarantees a payoff of at least $\\alpha$ then it is called $\\alpha$-robust. In 2002, Hassin and Rubinstein gave an algorithm that returns a $1/\\sqrt{2}$-robust matching, which is best possible.\n  We show that Alice can improve her payoff to $1/\\ln(4)$ by playing a randomized strategy. This result extends to a very general class of independence system"},"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":"1705.06631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-18T14:53:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"27d16df1761c98e6404781e522189861cc3d692e463cf36b6f6ecad75b2a0bce","abstract_canon_sha256":"3e2cef729087b0e7b8ea4c6db081c690122a172e3b5cd65f5e1c5fb0e04f13d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:14.253927Z","signature_b64":"BK/Lgb2zEwyBaqKuT3icxedRH9s7YhaXtAM4oYXJ5Y+19M7dHDQOP3rfS7++7MGswi2JhFan7+R6QW9CKakGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aff8851c622fc99bbb1eeac665c9f62d3834fb48dab77d6cf38f0fe8c3d8a9a1","last_reissued_at":"2026-05-18T00:44:14.253457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:14.253457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust randomized matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jannik Matuschke, Jos\\'e A. Soto, Martin Skutella","submitted_at":"2017-05-18T14:53:25Z","abstract_excerpt":"The following game is played on a weighted graph: Alice selects a matching $M$ and Bob selects a number $k$. Alice's payoff is the ratio of the weight of the $k$ heaviest edges of $M$ to the maximum weight of a matching of size at most $k$. If $M$ guarantees a payoff of at least $\\alpha$ then it is called $\\alpha$-robust. In 2002, Hassin and Rubinstein gave an algorithm that returns a $1/\\sqrt{2}$-robust matching, which is best possible.\n  We show that Alice can improve her payoff to $1/\\ln(4)$ by playing a randomized strategy. This result extends to a very general class of independence system"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06631","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.06631","created_at":"2026-05-18T00:44:14.253533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06631v1","created_at":"2026-05-18T00:44:14.253533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06631","created_at":"2026-05-18T00:44:14.253533+00:00"},{"alias_kind":"pith_short_12","alias_value":"V74IKHDCF7EZ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V74IKHDCF7EZXOY6","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V74IKHDC","created_at":"2026-05-18T12:31:49.984773+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/V74IKHDCF7EZXOY65LDGLSPWFU","json":"https://pith.science/pith/V74IKHDCF7EZXOY65LDGLSPWFU.json","graph_json":"https://pith.science/api/pith-number/V74IKHDCF7EZXOY65LDGLSPWFU/graph.json","events_json":"https://pith.science/api/pith-number/V74IKHDCF7EZXOY65LDGLSPWFU/events.json","paper":"https://pith.science/paper/V74IKHDC"},"agent_actions":{"view_html":"https://pith.science/pith/V74IKHDCF7EZXOY65LDGLSPWFU","download_json":"https://pith.science/pith/V74IKHDCF7EZXOY65LDGLSPWFU.json","view_paper":"https://pith.science/paper/V74IKHDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06631&json=true","fetch_graph":"https://pith.science/api/pith-number/V74IKHDCF7EZXOY65LDGLSPWFU/graph.json","fetch_events":"https://pith.science/api/pith-number/V74IKHDCF7EZXOY65LDGLSPWFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V74IKHDCF7EZXOY65LDGLSPWFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V74IKHDCF7EZXOY65LDGLSPWFU/action/storage_attestation","attest_author":"https://pith.science/pith/V74IKHDCF7EZXOY65LDGLSPWFU/action/author_attestation","sign_citation":"https://pith.science/pith/V74IKHDCF7EZXOY65LDGLSPWFU/action/citation_signature","submit_replication":"https://pith.science/pith/V74IKHDCF7EZXOY65LDGLSPWFU/action/replication_record"}},"created_at":"2026-05-18T00:44:14.253533+00:00","updated_at":"2026-05-18T00:44:14.253533+00:00"}