{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YE2AB67HY3RMX7F3JUVXFA52GO","short_pith_number":"pith:YE2AB67H","canonical_record":{"source":{"id":"1707.01608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-06T01:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"53a048fa4f7f8a59f1c93432f7552c94271486dc3a0af5f475bcb61017f5372e","abstract_canon_sha256":"b7a8d05e7ff813fe56f799d98adca98f3627145f92da0084ad960188d03390c0"},"schema_version":"1.0"},"canonical_sha256":"c13400fbe7c6e2cbfcbb4d2b7283ba33aebf18a3a61fff3a279ca9f1403c6c66","source":{"kind":"arxiv","id":"1707.01608","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01608","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01608v1","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01608","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"YE2AB67HY3RM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YE2AB67HY3RMX7F3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YE2AB67H","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YE2AB67HY3RMX7F3JUVXFA52GO","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-06T01:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"53a048fa4f7f8a59f1c93432f7552c94271486dc3a0af5f475bcb61017f5372e","abstract_canon_sha256":"b7a8d05e7ff813fe56f799d98adca98f3627145f92da0084ad960188d03390c0"},"schema_version":"1.0"},"canonical_sha256":"c13400fbe7c6e2cbfcbb4d2b7283ba33aebf18a3a61fff3a279ca9f1403c6c66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:48.048278Z","signature_b64":"qyjiG7DHh4KihhsvFoSBSelN2V1HxAy7/lMkCXHby/bPVw5bB/OIlcFMdbm04YLgN/nEelV5KWIeBq/5DH6MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c13400fbe7c6e2cbfcbb4d2b7283ba33aebf18a3a61fff3a279ca9f1403c6c66","last_reissued_at":"2026-05-18T00:40:48.047673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:48.047673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01608","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:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRICzhcbYFIVJifx2ZYdhPDylRVzHb2YvxRVdBr7YmyutinqgokMv1Qy+MeI60lwfHhxWYOt68byp6Sjl07cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:10.466654Z"},"content_sha256":"5b4166a2d5532d633c19fe1baf699fd8e03e8ec43ffc88cfa684760f797f9276","schema_version":"1.0","event_id":"sha256:5b4166a2d5532d633c19fe1baf699fd8e03e8ec43ffc88cfa684760f797f9276"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YE2AB67HY3RMX7F3JUVXFA52GO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Elliot Anshelevich, Wennan Zhu","submitted_at":"2017-07-06T01:34:56Z","abstract_excerpt":"We study ordinal approximation algorithms for maximum-weight bipartite matchings. Such algorithms only know the ordinal preferences of the agents/nodes in the graph for their preferred matches, but must compete with fully omniscient algorithms which know the true numerical edge weights (utilities). %instead of only their relative orderings. Ordinal approximation is all about being able to produce good results with only limited information. Because of this, one important question is how much better the algorithms can be as the amount of information increases. To address this question for formin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01608","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:40:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iICa6NrR2PAjYWvXGT9MQaNfxC1Ov5uDd+u/mHs/X1WBnW0MXSCY9M8gUXkjwwE8Khxuek47uoFszDCGHiBQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:34:10.467012Z"},"content_sha256":"a23d5ea48f1d9a50f69414f2e5de269c014577343d3af7442c41a500e2461d09","schema_version":"1.0","event_id":"sha256:a23d5ea48f1d9a50f69414f2e5de269c014577343d3af7442c41a500e2461d09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YE2AB67HY3RMX7F3JUVXFA52GO/bundle.json","state_url":"https://pith.science/pith/YE2AB67HY3RMX7F3JUVXFA52GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YE2AB67HY3RMX7F3JUVXFA52GO/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-02T17:34:10Z","links":{"resolver":"https://pith.science/pith/YE2AB67HY3RMX7F3JUVXFA52GO","bundle":"https://pith.science/pith/YE2AB67HY3RMX7F3JUVXFA52GO/bundle.json","state":"https://pith.science/pith/YE2AB67HY3RMX7F3JUVXFA52GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YE2AB67HY3RMX7F3JUVXFA52GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YE2AB67HY3RMX7F3JUVXFA52GO","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":"b7a8d05e7ff813fe56f799d98adca98f3627145f92da0084ad960188d03390c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-06T01:34:56Z","title_canon_sha256":"53a048fa4f7f8a59f1c93432f7552c94271486dc3a0af5f475bcb61017f5372e"},"schema_version":"1.0","source":{"id":"1707.01608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01608","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01608v1","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01608","created_at":"2026-05-18T00:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"YE2AB67HY3RM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YE2AB67HY3RMX7F3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YE2AB67H","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:a23d5ea48f1d9a50f69414f2e5de269c014577343d3af7442c41a500e2461d09","target":"graph","created_at":"2026-05-18T00:40:48Z","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 ordinal approximation algorithms for maximum-weight bipartite matchings. Such algorithms only know the ordinal preferences of the agents/nodes in the graph for their preferred matches, but must compete with fully omniscient algorithms which know the true numerical edge weights (utilities). %instead of only their relative orderings. Ordinal approximation is all about being able to produce good results with only limited information. Because of this, one important question is how much better the algorithms can be as the amount of information increases. To address this question for formin","authors_text":"Elliot Anshelevich, Wennan Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-06T01:34:56Z","title":"Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01608","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:5b4166a2d5532d633c19fe1baf699fd8e03e8ec43ffc88cfa684760f797f9276","target":"record","created_at":"2026-05-18T00:40:48Z","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":"b7a8d05e7ff813fe56f799d98adca98f3627145f92da0084ad960188d03390c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-06T01:34:56Z","title_canon_sha256":"53a048fa4f7f8a59f1c93432f7552c94271486dc3a0af5f475bcb61017f5372e"},"schema_version":"1.0","source":{"id":"1707.01608","kind":"arxiv","version":1}},"canonical_sha256":"c13400fbe7c6e2cbfcbb4d2b7283ba33aebf18a3a61fff3a279ca9f1403c6c66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c13400fbe7c6e2cbfcbb4d2b7283ba33aebf18a3a61fff3a279ca9f1403c6c66","first_computed_at":"2026-05-18T00:40:48.047673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:48.047673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qyjiG7DHh4KihhsvFoSBSelN2V1HxAy7/lMkCXHby/bPVw5bB/OIlcFMdbm04YLgN/nEelV5KWIeBq/5DH6MAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:48.048278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b4166a2d5532d633c19fe1baf699fd8e03e8ec43ffc88cfa684760f797f9276","sha256:a23d5ea48f1d9a50f69414f2e5de269c014577343d3af7442c41a500e2461d09"],"state_sha256":"d900ac324817c486209a36d6bf8f8945dc737a95af9d6615e6378b7681fb7aae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRJMRsYhcftn83XguJyFLYB9l131KCpFqZZQguTz6ULHBis2Jgt90JMUKptmrbQsmZctTc3yEHvcj3VqMPJzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:34:10.469355Z","bundle_sha256":"574cb6a38192979762f78fffe778228258197e6f90be40a179efa42e9d3a7acf"}}