{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LY53VEKOQS355PRTPVQKGH3DPP","short_pith_number":"pith:LY53VEKO","schema_version":"1.0","canonical_sha256":"5e3bba914e84b7debe337d60a31f637bf124d3da0fbb1a8c193fecf6fc375c55","source":{"kind":"arxiv","id":"1803.05501","version":1},"attestation_state":"computed","paper":{"title":"Max-Min Greedy Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Alon Eden, Michal Feldman, Uriel Feige","submitted_at":"2018-03-14T20:28:59Z","abstract_excerpt":"A bipartite graph $G(U,V;E)$ that admits a perfect matching is given. One player imposes a permutation $\\pi$ over $V$, the other player imposes a permutation $\\sigma$ over $U$. In the greedy matching algorithm, vertices of $U$ arrive in order $\\sigma$ and each vertex is matched to the lowest (under $\\pi$) yet unmatched neighbor in $V$ (or left unmatched, if all its neighbors are already matched). The obtained matching is maximal, thus matches at least a half of the vertices. The max-min greedy matching problem asks: suppose the first (max) player reveals $\\pi$, and the second (min) player resp"},"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":"1803.05501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-14T20:28:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"20ad3386b5c6cd5b19d3b024e3fb7983ef1201cd85d207f56aff110a4d4f7c31","abstract_canon_sha256":"24147a361d9f49fce199e34e53afb825bf4cc26398c6cc4b965939f779434069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:55.282412Z","signature_b64":"Ub7GkMLWmP1wOF8qSyDH1YUunKeIn2bb6K5b1nfgzmmNqD4A9h87brweaXfEEUSB0VnUi12E2+PPW2hyK3e6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e3bba914e84b7debe337d60a31f637bf124d3da0fbb1a8c193fecf6fc375c55","last_reissued_at":"2026-05-18T00:20:55.281954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:55.281954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max-Min Greedy Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Alon Eden, Michal Feldman, Uriel Feige","submitted_at":"2018-03-14T20:28:59Z","abstract_excerpt":"A bipartite graph $G(U,V;E)$ that admits a perfect matching is given. One player imposes a permutation $\\pi$ over $V$, the other player imposes a permutation $\\sigma$ over $U$. In the greedy matching algorithm, vertices of $U$ arrive in order $\\sigma$ and each vertex is matched to the lowest (under $\\pi$) yet unmatched neighbor in $V$ (or left unmatched, if all its neighbors are already matched). The obtained matching is maximal, thus matches at least a half of the vertices. The max-min greedy matching problem asks: suppose the first (max) player reveals $\\pi$, and the second (min) player resp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05501","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":"1803.05501","created_at":"2026-05-18T00:20:55.282018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05501v1","created_at":"2026-05-18T00:20:55.282018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05501","created_at":"2026-05-18T00:20:55.282018+00:00"},{"alias_kind":"pith_short_12","alias_value":"LY53VEKOQS35","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LY53VEKOQS355PRT","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LY53VEKO","created_at":"2026-05-18T12:32:37.024351+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/LY53VEKOQS355PRTPVQKGH3DPP","json":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP.json","graph_json":"https://pith.science/api/pith-number/LY53VEKOQS355PRTPVQKGH3DPP/graph.json","events_json":"https://pith.science/api/pith-number/LY53VEKOQS355PRTPVQKGH3DPP/events.json","paper":"https://pith.science/paper/LY53VEKO"},"agent_actions":{"view_html":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP","download_json":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP.json","view_paper":"https://pith.science/paper/LY53VEKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05501&json=true","fetch_graph":"https://pith.science/api/pith-number/LY53VEKOQS355PRTPVQKGH3DPP/graph.json","fetch_events":"https://pith.science/api/pith-number/LY53VEKOQS355PRTPVQKGH3DPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/action/storage_attestation","attest_author":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/action/author_attestation","sign_citation":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/action/citation_signature","submit_replication":"https://pith.science/pith/LY53VEKOQS355PRTPVQKGH3DPP/action/replication_record"}},"created_at":"2026-05-18T00:20:55.282018+00:00","updated_at":"2026-05-18T00:20:55.282018+00:00"}