{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BMRSPNZOXTOZI336ADAJ2N7JJW","short_pith_number":"pith:BMRSPNZO","canonical_record":{"source":{"id":"1811.05100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-13T04:43:05Z","cross_cats_sorted":[],"title_canon_sha256":"1e2a0fff8223217edbb48366d93cc3d9478633f556fb8af91f1822d72775b24d","abstract_canon_sha256":"4474d38fab18809d1d060b045d5e9d4fbe5278797ac63fd1b1f005476dc9969f"},"schema_version":"1.0"},"canonical_sha256":"0b2327b72ebcdd946f7e00c09d37e94dbaa5c4c637cdfdc5b2c9ce3e74da7f2f","source":{"kind":"arxiv","id":"1811.05100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05100","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05100v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05100","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"BMRSPNZOXTOZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BMRSPNZOXTOZI336","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BMRSPNZO","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BMRSPNZOXTOZI336ADAJ2N7JJW","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-13T04:43:05Z","cross_cats_sorted":[],"title_canon_sha256":"1e2a0fff8223217edbb48366d93cc3d9478633f556fb8af91f1822d72775b24d","abstract_canon_sha256":"4474d38fab18809d1d060b045d5e9d4fbe5278797ac63fd1b1f005476dc9969f"},"schema_version":"1.0"},"canonical_sha256":"0b2327b72ebcdd946f7e00c09d37e94dbaa5c4c637cdfdc5b2c9ce3e74da7f2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:01.212604Z","signature_b64":"zqcjMszbyTuZn1v8L3fSm2NZZbP6HAuubl9vaQxw9ZZkVv48Rf71IYZO0kTbJfBxfJYtLCqmDB8H6W5Qth43BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b2327b72ebcdd946f7e00c09d37e94dbaa5c4c637cdfdc5b2c9ce3e74da7f2f","last_reissued_at":"2026-05-18T00:01:01.212140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:01.212140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05100","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-18T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PObapUQpRfEIpPjS5Hms0GjN9If3Lv9Xez30o1yZKjWkULssnqlM5/lu2YxCeIrZ6CQ7sPzOIREN9V6J4sldBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T17:39:44.861823Z"},"content_sha256":"1992f9690ea57022b35b29a73500222debb7f49a9c2dd6ebe48dbf610d81089d","schema_version":"1.0","event_id":"sha256:1992f9690ea57022b35b29a73500222debb7f49a9c2dd6ebe48dbf610d81089d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BMRSPNZOXTOZI336ADAJ2N7JJW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, John P. Dickerson, Karthik Abinav Sankararaman, Pan Xu","submitted_at":"2018-11-13T04:43:05Z","abstract_excerpt":"In bipartite matching problems, vertices on one side of a bipartite graph are paired with those on the other. In its online variant, one side of the graph is available offline, while the vertices on the other side arrive online. When a vertex arrives, an irrevocable and immediate decision should be made by the algorithm; either match it to an available vertex or drop it. Examples of such problems include matching workers to firms, advertisers to keywords, organs to patients, and so on. Much of the literature focuses on maximizing the total relevance---modeled via total weight---of the matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05100","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-18T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"laKlyjBK93oPk5cR78OQ4kQo5oXh1B5UtEuVlHOIcaetgZCSFHADj9DmLVRSth/8eZ5MzYhrS8JwGwrRCBksAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T17:39:44.862410Z"},"content_sha256":"341d235fa8735503c156d172cc7b02cb81c3b8a14670fa628a6305fef6c0ffa3","schema_version":"1.0","event_id":"sha256:341d235fa8735503c156d172cc7b02cb81c3b8a14670fa628a6305fef6c0ffa3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMRSPNZOXTOZI336ADAJ2N7JJW/bundle.json","state_url":"https://pith.science/pith/BMRSPNZOXTOZI336ADAJ2N7JJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMRSPNZOXTOZI336ADAJ2N7JJW/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-05-20T17:39:44Z","links":{"resolver":"https://pith.science/pith/BMRSPNZOXTOZI336ADAJ2N7JJW","bundle":"https://pith.science/pith/BMRSPNZOXTOZI336ADAJ2N7JJW/bundle.json","state":"https://pith.science/pith/BMRSPNZOXTOZI336ADAJ2N7JJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMRSPNZOXTOZI336ADAJ2N7JJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BMRSPNZOXTOZI336ADAJ2N7JJW","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":"4474d38fab18809d1d060b045d5e9d4fbe5278797ac63fd1b1f005476dc9969f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-13T04:43:05Z","title_canon_sha256":"1e2a0fff8223217edbb48366d93cc3d9478633f556fb8af91f1822d72775b24d"},"schema_version":"1.0","source":{"id":"1811.05100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05100","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05100v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05100","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"BMRSPNZOXTOZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BMRSPNZOXTOZI336","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BMRSPNZO","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:341d235fa8735503c156d172cc7b02cb81c3b8a14670fa628a6305fef6c0ffa3","target":"graph","created_at":"2026-05-18T00:01:01Z","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":"In bipartite matching problems, vertices on one side of a bipartite graph are paired with those on the other. In its online variant, one side of the graph is available offline, while the vertices on the other side arrive online. When a vertex arrives, an irrevocable and immediate decision should be made by the algorithm; either match it to an available vertex or drop it. Examples of such problems include matching workers to firms, advertisers to keywords, organs to patients, and so on. Much of the literature focuses on maximizing the total relevance---modeled via total weight---of the matching","authors_text":"Aravind Srinivasan, John P. Dickerson, Karthik Abinav Sankararaman, Pan Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-13T04:43:05Z","title":"Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05100","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:1992f9690ea57022b35b29a73500222debb7f49a9c2dd6ebe48dbf610d81089d","target":"record","created_at":"2026-05-18T00:01:01Z","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":"4474d38fab18809d1d060b045d5e9d4fbe5278797ac63fd1b1f005476dc9969f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-13T04:43:05Z","title_canon_sha256":"1e2a0fff8223217edbb48366d93cc3d9478633f556fb8af91f1822d72775b24d"},"schema_version":"1.0","source":{"id":"1811.05100","kind":"arxiv","version":1}},"canonical_sha256":"0b2327b72ebcdd946f7e00c09d37e94dbaa5c4c637cdfdc5b2c9ce3e74da7f2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b2327b72ebcdd946f7e00c09d37e94dbaa5c4c637cdfdc5b2c9ce3e74da7f2f","first_computed_at":"2026-05-18T00:01:01.212140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:01.212140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zqcjMszbyTuZn1v8L3fSm2NZZbP6HAuubl9vaQxw9ZZkVv48Rf71IYZO0kTbJfBxfJYtLCqmDB8H6W5Qth43BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:01.212604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1992f9690ea57022b35b29a73500222debb7f49a9c2dd6ebe48dbf610d81089d","sha256:341d235fa8735503c156d172cc7b02cb81c3b8a14670fa628a6305fef6c0ffa3"],"state_sha256":"e2f53290299679a82c1174238540c45c59f04dff941c9bc5eed5b6bee531de7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wALSaxSU6h0GsYzbybbzjsOF/UWFlmsbX/EaBDBvlAfYU3Utoe9QfF7xbcV8PN+a7I+VNFFi2KLl4GPj8SerDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T17:39:44.865201Z","bundle_sha256":"37afce84ff85fb2adea79268c90bdb9b603170ef42ed0c286b1ab9d5acec5d0c"}}