{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BZ3P4IK3RTWVT3E4FYBZX5VULO","short_pith_number":"pith:BZ3P4IK3","schema_version":"1.0","canonical_sha256":"0e76fe215b8ced59ec9c2e039bf6b45bb604751def4ed9298847c4e17704f883","source":{"kind":"arxiv","id":"2005.01929","version":1},"attestation_state":"computed","paper":{"title":"Edge-Weighted Online Bipartite Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Matthew Fahrbach, Morteza Zadimoghaddam, Runzhou Tao, Zhiyi Huang","submitted_at":"2020-05-05T03:18:56Z","abstract_excerpt":"Online bipartite matching and its variants are among the most fundamental problems in the online algorithms literature. Karp, Vazirani, and Vazirani (STOC 1990) introduced an elegant algorithm for the unweighted problem that achieves an optimal competitive ratio of $1-1/e$. Later, Aggarwal et al. (SODA 2011) generalized their algorithm and analysis to the vertex-weighted case. Little is known, however, about the most general edge-weighted problem aside from the trivial $1/2$-competitive greedy algorithm. In this paper, we present the first online algorithm that breaks the long-standing $1/2$ b"},"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":"2005.01929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-05T03:18:56Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"20d74345288faa0f5bd6508f8fb76ba5006d6cd56c7594d49050e402c55d5b10","abstract_canon_sha256":"76f437770ee655a22937160946b13ef6ae0c5c0bf9d2f38dce02cfa003085042"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:54.131791Z","signature_b64":"NAc98ju9+J1ok8On1WWnDTsG16Rfa1whT++EFqyAK7brUZGIE4TWRTOH6qRQuOgWbLb+Z+QmUFG0MzZLi0rmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e76fe215b8ced59ec9c2e039bf6b45bb604751def4ed9298847c4e17704f883","last_reissued_at":"2026-07-05T08:26:54.131379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:54.131379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-Weighted Online Bipartite Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Matthew Fahrbach, Morteza Zadimoghaddam, Runzhou Tao, Zhiyi Huang","submitted_at":"2020-05-05T03:18:56Z","abstract_excerpt":"Online bipartite matching and its variants are among the most fundamental problems in the online algorithms literature. Karp, Vazirani, and Vazirani (STOC 1990) introduced an elegant algorithm for the unweighted problem that achieves an optimal competitive ratio of $1-1/e$. Later, Aggarwal et al. (SODA 2011) generalized their algorithm and analysis to the vertex-weighted case. Little is known, however, about the most general edge-weighted problem aside from the trivial $1/2$-competitive greedy algorithm. In this paper, we present the first online algorithm that breaks the long-standing $1/2$ b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01929","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.01929/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.01929","created_at":"2026-07-05T08:26:54.131436+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.01929v1","created_at":"2026-07-05T08:26:54.131436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01929","created_at":"2026-07-05T08:26:54.131436+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZ3P4IK3RTWV","created_at":"2026-07-05T08:26:54.131436+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZ3P4IK3RTWVT3E4","created_at":"2026-07-05T08:26:54.131436+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZ3P4IK3","created_at":"2026-07-05T08:26:54.131436+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/BZ3P4IK3RTWVT3E4FYBZX5VULO","json":"https://pith.science/pith/BZ3P4IK3RTWVT3E4FYBZX5VULO.json","graph_json":"https://pith.science/api/pith-number/BZ3P4IK3RTWVT3E4FYBZX5VULO/graph.json","events_json":"https://pith.science/api/pith-number/BZ3P4IK3RTWVT3E4FYBZX5VULO/events.json","paper":"https://pith.science/paper/BZ3P4IK3"},"agent_actions":{"view_html":"https://pith.science/pith/BZ3P4IK3RTWVT3E4FYBZX5VULO","download_json":"https://pith.science/pith/BZ3P4IK3RTWVT3E4FYBZX5VULO.json","view_paper":"https://pith.science/paper/BZ3P4IK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.01929&json=true","fetch_graph":"https://pith.science/api/pith-number/BZ3P4IK3RTWVT3E4FYBZX5VULO/graph.json","fetch_events":"https://pith.science/api/pith-number/BZ3P4IK3RTWVT3E4FYBZX5VULO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZ3P4IK3RTWVT3E4FYBZX5VULO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZ3P4IK3RTWVT3E4FYBZX5VULO/action/storage_attestation","attest_author":"https://pith.science/pith/BZ3P4IK3RTWVT3E4FYBZX5VULO/action/author_attestation","sign_citation":"https://pith.science/pith/BZ3P4IK3RTWVT3E4FYBZX5VULO/action/citation_signature","submit_replication":"https://pith.science/pith/BZ3P4IK3RTWVT3E4FYBZX5VULO/action/replication_record"}},"created_at":"2026-07-05T08:26:54.131436+00:00","updated_at":"2026-07-05T08:26:54.131436+00:00"}