{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TPJO6UC6RN2U7GZJ7JPOFSRNQ5","short_pith_number":"pith:TPJO6UC6","canonical_record":{"source":{"id":"1703.04225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2017-03-13T02:05:58Z","cross_cats_sorted":[],"title_canon_sha256":"5566e4d3544e1907a774d1d7e20bc401dc1673e4be667d1e6b0858beecfabbfc","abstract_canon_sha256":"f55810c79392820586a63badc322ffe5bb03dcd330e5fae66b2f753c31f1bb2a"},"schema_version":"1.0"},"canonical_sha256":"9bd2ef505e8b754f9b29fa5ee2ca2d87401183409cf71b258e6e08d9a42995cf","source":{"kind":"arxiv","id":"1703.04225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04225","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04225v1","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04225","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"TPJO6UC6RN2U","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPJO6UC6RN2U7GZJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPJO6UC6","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TPJO6UC6RN2U7GZJ7JPOFSRNQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2017-03-13T02:05:58Z","cross_cats_sorted":[],"title_canon_sha256":"5566e4d3544e1907a774d1d7e20bc401dc1673e4be667d1e6b0858beecfabbfc","abstract_canon_sha256":"f55810c79392820586a63badc322ffe5bb03dcd330e5fae66b2f753c31f1bb2a"},"schema_version":"1.0"},"canonical_sha256":"9bd2ef505e8b754f9b29fa5ee2ca2d87401183409cf71b258e6e08d9a42995cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:49.380758Z","signature_b64":"f+PozaBXqXw00qSxmmIZUlYiqpdkahSnb8ePkGOT0dEtvIecHsp1q1/pu8CAzUlfUtUwSqX2HvGacMA1p5dJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bd2ef505e8b754f9b29fa5ee2ca2d87401183409cf71b258e6e08d9a42995cf","last_reissued_at":"2026-05-18T00:48:49.379936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:49.379936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04225","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:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tj5J8DE7yVjRdr3FXpP7aPQIDi0w3a/yKOt7Ye2NETt8jBEzBMpTPm8LL5Pr2tFoxcBGYc++qSRuBjnbKpa3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:07:37.457126Z"},"content_sha256":"fa5fc26e47bad98729131f9ca751d9d0f093aad0479512bac0f52495c6090e1c","schema_version":"1.0","event_id":"sha256:fa5fc26e47bad98729131f9ca751d9d0f093aad0479512bac0f52495c6090e1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TPJO6UC6RN2U7GZJ7JPOFSRNQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New algorithms for matching problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jacky Lo, Mark C. Wilson","submitted_at":"2017-03-13T02:05:58Z","abstract_excerpt":"The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the Gale-Shapley algorithm; for one-sided matching, (random) Serial Dictatorship and Probabilistic Serial rule; for school choice, Gale-Shapley and the Boston mechanisms.\n  The main reason for the dominance of these algorithms is their good (worst-case) axiomatic behaviour with respect to notions of efficiency and strategyproofness. However if we shift the focus "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04225","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:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXjYKv75M6690JoU+6lnACZTbjFd8ojvj+YY5WhVNmqFa5sEvYP0gowj0iETMYQKj+dhhp5eecxtBvcpcla0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:07:37.457836Z"},"content_sha256":"cc46225fb90541cecb65d0b98c26411d6a5cff955740f8a266d97f761fe7357e","schema_version":"1.0","event_id":"sha256:cc46225fb90541cecb65d0b98c26411d6a5cff955740f8a266d97f761fe7357e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/bundle.json","state_url":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/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-09T02:07:37Z","links":{"resolver":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5","bundle":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/bundle.json","state":"https://pith.science/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPJO6UC6RN2U7GZJ7JPOFSRNQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TPJO6UC6RN2U7GZJ7JPOFSRNQ5","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":"f55810c79392820586a63badc322ffe5bb03dcd330e5fae66b2f753c31f1bb2a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2017-03-13T02:05:58Z","title_canon_sha256":"5566e4d3544e1907a774d1d7e20bc401dc1673e4be667d1e6b0858beecfabbfc"},"schema_version":"1.0","source":{"id":"1703.04225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04225","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04225v1","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04225","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"TPJO6UC6RN2U","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPJO6UC6RN2U7GZJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPJO6UC6","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:cc46225fb90541cecb65d0b98c26411d6a5cff955740f8a266d97f761fe7357e","target":"graph","created_at":"2026-05-18T00:48:49Z","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":"The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the Gale-Shapley algorithm; for one-sided matching, (random) Serial Dictatorship and Probabilistic Serial rule; for school choice, Gale-Shapley and the Boston mechanisms.\n  The main reason for the dominance of these algorithms is their good (worst-case) axiomatic behaviour with respect to notions of efficiency and strategyproofness. However if we shift the focus ","authors_text":"Jacky Lo, Mark C. Wilson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2017-03-13T02:05:58Z","title":"New algorithms for matching problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04225","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:fa5fc26e47bad98729131f9ca751d9d0f093aad0479512bac0f52495c6090e1c","target":"record","created_at":"2026-05-18T00:48:49Z","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":"f55810c79392820586a63badc322ffe5bb03dcd330e5fae66b2f753c31f1bb2a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2017-03-13T02:05:58Z","title_canon_sha256":"5566e4d3544e1907a774d1d7e20bc401dc1673e4be667d1e6b0858beecfabbfc"},"schema_version":"1.0","source":{"id":"1703.04225","kind":"arxiv","version":1}},"canonical_sha256":"9bd2ef505e8b754f9b29fa5ee2ca2d87401183409cf71b258e6e08d9a42995cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bd2ef505e8b754f9b29fa5ee2ca2d87401183409cf71b258e6e08d9a42995cf","first_computed_at":"2026-05-18T00:48:49.379936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:49.379936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f+PozaBXqXw00qSxmmIZUlYiqpdkahSnb8ePkGOT0dEtvIecHsp1q1/pu8CAzUlfUtUwSqX2HvGacMA1p5dJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:49.380758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa5fc26e47bad98729131f9ca751d9d0f093aad0479512bac0f52495c6090e1c","sha256:cc46225fb90541cecb65d0b98c26411d6a5cff955740f8a266d97f761fe7357e"],"state_sha256":"342f7f50e6b55550baf4c568286073552ed25345b5844e80da2fa72751908591"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBc1G9s/k7+7KKP8Bm6V4y3A/6ZI9WNi1gB5QHsZDjhicpl6cSJmXIi2MTbXJ9Dnv8i4gXOOz1P+RA9TCDxCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:07:37.461724Z","bundle_sha256":"1a311ea368a4d12315f8be469313c10e6635c9c485885c78c39bcf1e2fa7b48f"}}