{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZID6P6EZ4WYZIBSSTYAINEJEWC","short_pith_number":"pith:ZID6P6EZ","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"},"canonical_sha256":"ca07e7f899e5b19406529e00869124b08a7b53b019b4713999d63b83a8f22776","source":{"kind":"arxiv","id":"2305.08353","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.08353","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"2305.08353v3","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08353","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZID6P6EZ4WYZ","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"pith_short_16","alias_value":"ZID6P6EZ4WYZIBSS","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"pith_short_8","alias_value":"ZID6P6EZ","created_at":"2026-07-05T10:15:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZID6P6EZ4WYZIBSSTYAINEJEWC","target":"record","payload":{"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"},"canonical_sha256":"ca07e7f899e5b19406529e00869124b08a7b53b019b4713999d63b83a8f22776","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"},"source_kind":"arxiv","source_id":"2305.08353","source_version":3,"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-07-05T10:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3emX5lTJSirC7kPUPHmegzKngdmHGZusiJVjdC2s0pFpilJAlmPvU1nRi3qbjRqCF2Kzxc0ESnVeTS7sZLtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:25:30.041855Z"},"content_sha256":"996bf4c85e2b7243e4cfd82fc54e9fed6f6c9c0cc300123874ff10df730a714d","schema_version":"1.0","event_id":"sha256:996bf4c85e2b7243e4cfd82fc54e9fed6f6c9c0cc300123874ff10df730a714d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZID6P6EZ4WYZIBSSTYAINEJEWC","target":"graph","payload":{"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"},"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-07-05T10:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dG12CFCBzHfSVLgbUKlE97FjUIaA4Wln8buU51BFXub1Fqxzl3AZlv1Qup0NEFfhelIlQAx65xOin6ubv4UtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:25:30.042960Z"},"content_sha256":"e69e40828dc9012254e5beefebc5469eb5825a0b2e153178198fd01c9e064fc1","schema_version":"1.0","event_id":"sha256:e69e40828dc9012254e5beefebc5469eb5825a0b2e153178198fd01c9e064fc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/bundle.json","state_url":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/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-08-10T07:25:30Z","links":{"resolver":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC","bundle":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/bundle.json","state":"https://pith.science/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZID6P6EZ4WYZIBSSTYAINEJEWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZID6P6EZ4WYZIBSSTYAINEJEWC","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":"f26548d4b98c4c4afcbc80d79dab10a9594a7a9732d848f8eec032afbb5e2dfa","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-15T05:21:20Z","title_canon_sha256":"2695fc4ce0ae4498c6344f5542b4f9a1a573516a1925cb9573fc0f33b10e54b9"},"schema_version":"1.0","source":{"id":"2305.08353","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.08353","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"2305.08353v3","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08353","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZID6P6EZ4WYZ","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"pith_short_16","alias_value":"ZID6P6EZ4WYZIBSS","created_at":"2026-07-05T10:15:41Z"},{"alias_kind":"pith_short_8","alias_value":"ZID6P6EZ","created_at":"2026-07-05T10:15:41Z"}],"graph_snapshots":[{"event_id":"sha256:e69e40828dc9012254e5beefebc5469eb5825a0b2e153178198fd01c9e064fc1","target":"graph","created_at":"2026-07-05T10:15:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.08353/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chenbo Yin, Junze Yin, Weixin Wang, Zhao Song","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-15T05:21:20Z","title":"Fast and Efficient Matching Algorithm with Deadline Instances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08353","kind":"arxiv","version":3},"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:996bf4c85e2b7243e4cfd82fc54e9fed6f6c9c0cc300123874ff10df730a714d","target":"record","created_at":"2026-07-05T10:15:41Z","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":"f26548d4b98c4c4afcbc80d79dab10a9594a7a9732d848f8eec032afbb5e2dfa","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-15T05:21:20Z","title_canon_sha256":"2695fc4ce0ae4498c6344f5542b4f9a1a573516a1925cb9573fc0f33b10e54b9"},"schema_version":"1.0","source":{"id":"2305.08353","kind":"arxiv","version":3}},"canonical_sha256":"ca07e7f899e5b19406529e00869124b08a7b53b019b4713999d63b83a8f22776","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca07e7f899e5b19406529e00869124b08a7b53b019b4713999d63b83a8f22776","first_computed_at":"2026-07-05T10:15:41.401187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:41.401187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D3jM2C2hCBw+OSkdqyuAuPUIwNxGYAo82C2MEYqQBKXiRGbdspk5TBOZGpnt/OGhLdRRoP/39HaG/jjnzR2WBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:41.401686Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.08353","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:996bf4c85e2b7243e4cfd82fc54e9fed6f6c9c0cc300123874ff10df730a714d","sha256:e69e40828dc9012254e5beefebc5469eb5825a0b2e153178198fd01c9e064fc1"],"state_sha256":"bf0315a6eeab7b603a92f654c8989b96efa7138e782be83788b8eedd62a838c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwazzEUuTJG9+2iCvFP43E1G/pV+J/Gaylp6sHRSExfmLKLReZLN18bSAXd1S2B+7Q5oaew405LH21bpx2Q1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T07:25:30.049771Z","bundle_sha256":"0069cec5925737edaa8704fba6bbbbcd8b39479cd414e6707d3c785aef6981fb"}}