{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZID6P6EZ4WYZIBSSTYAINEJEWC","short_pith_number":"pith:ZID6P6EZ","schema_version":"1.0","canonical_sha256":"ca07e7f899e5b19406529e00869124b08a7b53b019b4713999d63b83a8f22776","source":{"kind":"arxiv","id":"2305.08353","version":3},"attestation_state":"computed","paper":{"title":"Fast and Efficient Matching Algorithm with Deadline Instances","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Chenbo Yin, Junze Yin, Weixin Wang, Zhao Song","submitted_at":"2023-05-15T05:21:20Z","abstract_excerpt":"The online weighted matching problem is a fundamental problem in machine learning due to its numerous applications. Despite many efforts in this area, existing algorithms are either too slow or don't take $\\mathrm{deadline}$ (the longest time a node can be matched) into account. In this paper, we introduce a market model with $\\mathrm{deadline}$ first. Next, we present our two optimized algorithms (\\textsc{FastGreedy} and \\textsc{FastPostponedGreedy}) and offer theoretical proof of the time complexity and correctness of our algorithms. In \\textsc{FastGreedy} algorithm, we have already known if"},"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":"2305.08353","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-15T05:21:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2695fc4ce0ae4498c6344f5542b4f9a1a573516a1925cb9573fc0f33b10e54b9","abstract_canon_sha256":"f26548d4b98c4c4afcbc80d79dab10a9594a7a9732d848f8eec032afbb5e2dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:41.401686Z","signature_b64":"D3jM2C2hCBw+OSkdqyuAuPUIwNxGYAo82C2MEYqQBKXiRGbdspk5TBOZGpnt/OGhLdRRoP/39HaG/jjnzR2WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca07e7f899e5b19406529e00869124b08a7b53b019b4713999d63b83a8f22776","last_reissued_at":"2026-07-05T10:15:41.401187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:41.401187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Efficient Matching Algorithm with Deadline Instances","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Chenbo Yin, Junze Yin, Weixin Wang, Zhao Song","submitted_at":"2023-05-15T05:21:20Z","abstract_excerpt":"The online weighted matching problem is a fundamental problem in machine learning due to its numerous applications. Despite many efforts in this area, existing algorithms are either too slow or don't take $\\mathrm{deadline}$ (the longest time a node can be matched) into account. In this paper, we introduce a market model with $\\mathrm{deadline}$ first. Next, we present our two optimized algorithms (\\textsc{FastGreedy} and \\textsc{FastPostponedGreedy}) and offer theoretical proof of the time complexity and correctness of our algorithms. In \\textsc{FastGreedy} algorithm, we have already known if"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08353","kind":"arxiv","version":3},"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/2305.08353/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":"2305.08353","created_at":"2026-07-05T10:15:41.401245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.08353v3","created_at":"2026-07-05T10:15:41.401245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08353","created_at":"2026-07-05T10:15:41.401245+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZID6P6EZ4WYZ","created_at":"2026-07-05T10:15:41.401245+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZID6P6EZ4WYZIBSS","created_at":"2026-07-05T10:15:41.401245+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZID6P6EZ","created_at":"2026-07-05T10:15:41.401245+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06167","citing_title":"Universal Approximation of Visual Autoregressive Transformers","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC","json":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC.json","graph_json":"https://pith.science/api/pith-number/ZID6P6EZ4WYZIBSSTYAINEJEWC/graph.json","events_json":"https://pith.science/api/pith-number/ZID6P6EZ4WYZIBSSTYAINEJEWC/events.json","paper":"https://pith.science/paper/ZID6P6EZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC","download_json":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC.json","view_paper":"https://pith.science/paper/ZID6P6EZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.08353&json=true","fetch_graph":"https://pith.science/api/pith-number/ZID6P6EZ4WYZIBSSTYAINEJEWC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZID6P6EZ4WYZIBSSTYAINEJEWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/action/storage_attestation","attest_author":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/action/author_attestation","sign_citation":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/action/citation_signature","submit_replication":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/action/replication_record"}},"created_at":"2026-07-05T10:15:41.401245+00:00","updated_at":"2026-07-05T10:15:41.401245+00:00"}