{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P2BRZOHQ74WJQ5CY4XXKILPD3Z","short_pith_number":"pith:P2BRZOHQ","canonical_record":{"source":{"id":"1409.2139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-07T17:03:07Z","cross_cats_sorted":[],"title_canon_sha256":"d4aecdc12a04e4ed73ec5b1270594d2e71d0efef72afc9181c0cca881e5d3442","abstract_canon_sha256":"18c8ed14a315d8401b5a3294363c929ff6a753bb7470ed9cc895a32478e9ff60"},"schema_version":"1.0"},"canonical_sha256":"7e831cb8f0ff2c987458e5eea42de3de7b35351e1eeddb02f32c0da40fbd2833","source":{"kind":"arxiv","id":"1409.2139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2139","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2139v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2139","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"P2BRZOHQ74WJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2BRZOHQ74WJQ5CY","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2BRZOHQ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P2BRZOHQ74WJQ5CY4XXKILPD3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-07T17:03:07Z","cross_cats_sorted":[],"title_canon_sha256":"d4aecdc12a04e4ed73ec5b1270594d2e71d0efef72afc9181c0cca881e5d3442","abstract_canon_sha256":"18c8ed14a315d8401b5a3294363c929ff6a753bb7470ed9cc895a32478e9ff60"},"schema_version":"1.0"},"canonical_sha256":"7e831cb8f0ff2c987458e5eea42de3de7b35351e1eeddb02f32c0da40fbd2833","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:17.786960Z","signature_b64":"E4SvKHxCKqPJQHBmFwKFZ5cjI1mM65L383EgidbbUT0WYXXHwC+DT9SIIfSZJBdinElD1nLTfXOI22p8csh7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e831cb8f0ff2c987458e5eea42de3de7b35351e1eeddb02f32c0da40fbd2833","last_reissued_at":"2026-05-18T02:43:17.786376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:17.786376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2139","source_version":1,"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-05-18T02:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LhUMkc8T9c/tcw8/wyPijKI6svjEHgFmAEuge998XYWaClutSLIfg9u86PhCEfykA7y7CsQyc2ziqZBJ1U/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:22:47.748628Z"},"content_sha256":"5c782e5dee5562648476688e7e99ac892c7af8df24ada38a9d50bd253577a5a3","schema_version":"1.0","event_id":"sha256:5c782e5dee5562648476688e7e99ac892c7af8df24ada38a9d50bd253577a5a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P2BRZOHQ74WJQ5CY4XXKILPD3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Bipartite Matching with Decomposable Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huy L. Nguyen, Monika Henzinger, Moses Charikar","submitted_at":"2014-09-07T17:03:07Z","abstract_excerpt":"We study a weighted online bipartite matching problem: $G(V_1, V_2, E)$ is a weighted bipartite graph where $V_1$ is known beforehand and the vertices of $V_2$ arrive online. The goal is to match vertices of $V_2$ as they arrive to vertices in $V_1$, so as to maximize the sum of weights of edges in the matching. If assignments to $V_1$ cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with {\\em free disposal}, where vertices in $V_1$ can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2139","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"},"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-05-18T02:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ny3aemKX7jVQXKolF82q1kp7U6pIhwlMmP5KFv9Wv1h8HAp6Z3ovsv3ZrbQ/V5nQNfW7/y+pZxixwx/4hL2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:22:47.749382Z"},"content_sha256":"57f7e656481a6062647164805d90ff0c4f4f1483246d9ee514106e70d22f6d9a","schema_version":"1.0","event_id":"sha256:57f7e656481a6062647164805d90ff0c4f4f1483246d9ee514106e70d22f6d9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2BRZOHQ74WJQ5CY4XXKILPD3Z/bundle.json","state_url":"https://pith.science/pith/P2BRZOHQ74WJQ5CY4XXKILPD3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2BRZOHQ74WJQ5CY4XXKILPD3Z/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-06-11T22:22:47Z","links":{"resolver":"https://pith.science/pith/P2BRZOHQ74WJQ5CY4XXKILPD3Z","bundle":"https://pith.science/pith/P2BRZOHQ74WJQ5CY4XXKILPD3Z/bundle.json","state":"https://pith.science/pith/P2BRZOHQ74WJQ5CY4XXKILPD3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2BRZOHQ74WJQ5CY4XXKILPD3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P2BRZOHQ74WJQ5CY4XXKILPD3Z","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":"18c8ed14a315d8401b5a3294363c929ff6a753bb7470ed9cc895a32478e9ff60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-07T17:03:07Z","title_canon_sha256":"d4aecdc12a04e4ed73ec5b1270594d2e71d0efef72afc9181c0cca881e5d3442"},"schema_version":"1.0","source":{"id":"1409.2139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2139","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2139v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2139","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"P2BRZOHQ74WJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2BRZOHQ74WJQ5CY","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2BRZOHQ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:57f7e656481a6062647164805d90ff0c4f4f1483246d9ee514106e70d22f6d9a","target":"graph","created_at":"2026-05-18T02:43:17Z","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"},"paper":{"abstract_excerpt":"We study a weighted online bipartite matching problem: $G(V_1, V_2, E)$ is a weighted bipartite graph where $V_1$ is known beforehand and the vertices of $V_2$ arrive online. The goal is to match vertices of $V_2$ as they arrive to vertices in $V_1$, so as to maximize the sum of weights of edges in the matching. If assignments to $V_1$ cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with {\\em free disposal}, where vertices in $V_1$ can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over t","authors_text":"Huy L. Nguyen, Monika Henzinger, Moses Charikar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-07T17:03:07Z","title":"Online Bipartite Matching with Decomposable Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2139","kind":"arxiv","version":1},"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:5c782e5dee5562648476688e7e99ac892c7af8df24ada38a9d50bd253577a5a3","target":"record","created_at":"2026-05-18T02:43:17Z","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":"18c8ed14a315d8401b5a3294363c929ff6a753bb7470ed9cc895a32478e9ff60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-07T17:03:07Z","title_canon_sha256":"d4aecdc12a04e4ed73ec5b1270594d2e71d0efef72afc9181c0cca881e5d3442"},"schema_version":"1.0","source":{"id":"1409.2139","kind":"arxiv","version":1}},"canonical_sha256":"7e831cb8f0ff2c987458e5eea42de3de7b35351e1eeddb02f32c0da40fbd2833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e831cb8f0ff2c987458e5eea42de3de7b35351e1eeddb02f32c0da40fbd2833","first_computed_at":"2026-05-18T02:43:17.786376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:17.786376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E4SvKHxCKqPJQHBmFwKFZ5cjI1mM65L383EgidbbUT0WYXXHwC+DT9SIIfSZJBdinElD1nLTfXOI22p8csh7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:17.786960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c782e5dee5562648476688e7e99ac892c7af8df24ada38a9d50bd253577a5a3","sha256:57f7e656481a6062647164805d90ff0c4f4f1483246d9ee514106e70d22f6d9a"],"state_sha256":"cbdfb6d98e795c1a87ef9c21f412e0626d6551c62498613d58ebb58341e2c9ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44wBDYReV2uMlmskSOtScx2QejXV9o0ORdSnn5PVTRMQaSVeuu35YeIT9l9s0XHgJ4dY47q66NYioi4bzS34Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:22:47.753580Z","bundle_sha256":"8dfacb475b3c1a279f146f3798c15158d53702ac72818568fc245ebe743121d6"}}