{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YKN2UI7Z2ZV5KCAQQYXLZUSNX3","short_pith_number":"pith:YKN2UI7Z","canonical_record":{"source":{"id":"1202.3706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ce5a956660435f752c43eed932337a4f6c94da87287ba62ff3637071d64300a2","abstract_canon_sha256":"0f11822a5eade6cdd75e3650d4610111faeace897d1c009196b80c636b56b627"},"schema_version":"1.0"},"canonical_sha256":"c29baa23f9d66bd50810862ebcd24dbeef7f98bdbbafd848e65c71fb2efed867","source":{"kind":"arxiv","id":"1202.3706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3706","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3706v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3706","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"YKN2UI7Z2ZV5","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YKN2UI7Z2ZV5KCAQ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YKN2UI7Z","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YKN2UI7Z2ZV5KCAQQYXLZUSNX3","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ce5a956660435f752c43eed932337a4f6c94da87287ba62ff3637071d64300a2","abstract_canon_sha256":"0f11822a5eade6cdd75e3650d4610111faeace897d1c009196b80c636b56b627"},"schema_version":"1.0"},"canonical_sha256":"c29baa23f9d66bd50810862ebcd24dbeef7f98bdbbafd848e65c71fb2efed867","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.469986Z","signature_b64":"E7+exHR6KGjho3MlkwI+vSa1cxFK/n4dOomo4dZoUU9KSOBZZSk4XhKkZ4RsQ40h7SbHSpwFqUR0R+3hwQ5FDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c29baa23f9d66bd50810862ebcd24dbeef7f98bdbbafd848e65c71fb2efed867","last_reissued_at":"2026-05-18T04:02:03.469494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.469494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3706","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KURTuZt9hfBy1nkUKkwWgBdK/y5cCTq7063Z8KMwRecUgaP3Sil6wTPnbo64G2XYAHBc97i2Rb3mAyQwB5hWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:11:27.841991Z"},"content_sha256":"1155e81b0f61746726368e62f6b226624b2c3fb48e5c88fa979031ce642d0cfd","schema_version":"1.0","event_id":"sha256:1155e81b0f61746726368e62f6b226624b2c3fb48e5c88fa979031ce642d0cfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YKN2UI7Z2ZV5KCAQQYXLZUSNX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for Optimizing Paper Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Craig Boutilier, Laurent Charlin, Richard S. Zemel","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"At the heart of many scientific conferences is the problem of matching submitted papers to suitable reviewers. Arriving at a good assignment is a major and important challenge for any conference organizer. In this paper we propose a framework to optimize paper-to-reviewer assignments. Our framework uses suitability scores to measure pairwise affinity between papers and reviewers. We show how learning can be used to infer suitability scores from a small set of provided scores, thereby reducing the burden on reviewers and organizers. We frame the assignment problem as an integer program and prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3706","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMXUh8XauvaTGpyXV+lXSCtXsqPXlrm43ynO37vc3D4QAlObtPnzKERLMb0NaTKDTpSfVSsOzIWPMzudk2SWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:11:27.842666Z"},"content_sha256":"8302eabbbfaa3b4de35516b5fe2ce522c074453bba9dd12a97ffb7fc8b6e9e91","schema_version":"1.0","event_id":"sha256:8302eabbbfaa3b4de35516b5fe2ce522c074453bba9dd12a97ffb7fc8b6e9e91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKN2UI7Z2ZV5KCAQQYXLZUSNX3/bundle.json","state_url":"https://pith.science/pith/YKN2UI7Z2ZV5KCAQQYXLZUSNX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKN2UI7Z2ZV5KCAQQYXLZUSNX3/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-22T13:11:27Z","links":{"resolver":"https://pith.science/pith/YKN2UI7Z2ZV5KCAQQYXLZUSNX3","bundle":"https://pith.science/pith/YKN2UI7Z2ZV5KCAQQYXLZUSNX3/bundle.json","state":"https://pith.science/pith/YKN2UI7Z2ZV5KCAQQYXLZUSNX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKN2UI7Z2ZV5KCAQQYXLZUSNX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YKN2UI7Z2ZV5KCAQQYXLZUSNX3","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":"0f11822a5eade6cdd75e3650d4610111faeace897d1c009196b80c636b56b627","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"ce5a956660435f752c43eed932337a4f6c94da87287ba62ff3637071d64300a2"},"schema_version":"1.0","source":{"id":"1202.3706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3706","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3706v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3706","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"YKN2UI7Z2ZV5","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YKN2UI7Z2ZV5KCAQ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YKN2UI7Z","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:8302eabbbfaa3b4de35516b5fe2ce522c074453bba9dd12a97ffb7fc8b6e9e91","target":"graph","created_at":"2026-05-18T04:02:03Z","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":"At the heart of many scientific conferences is the problem of matching submitted papers to suitable reviewers. Arriving at a good assignment is a major and important challenge for any conference organizer. In this paper we propose a framework to optimize paper-to-reviewer assignments. Our framework uses suitability scores to measure pairwise affinity between papers and reviewers. We show how learning can be used to infer suitability scores from a small set of provided scores, thereby reducing the burden on reviewers and organizers. We frame the assignment problem as an integer program and prop","authors_text":"Craig Boutilier, Laurent Charlin, Richard S. Zemel","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-02-14T16:41:17Z","title":"A Framework for Optimizing Paper Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3706","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:1155e81b0f61746726368e62f6b226624b2c3fb48e5c88fa979031ce642d0cfd","target":"record","created_at":"2026-05-18T04:02:03Z","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":"0f11822a5eade6cdd75e3650d4610111faeace897d1c009196b80c636b56b627","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"ce5a956660435f752c43eed932337a4f6c94da87287ba62ff3637071d64300a2"},"schema_version":"1.0","source":{"id":"1202.3706","kind":"arxiv","version":1}},"canonical_sha256":"c29baa23f9d66bd50810862ebcd24dbeef7f98bdbbafd848e65c71fb2efed867","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c29baa23f9d66bd50810862ebcd24dbeef7f98bdbbafd848e65c71fb2efed867","first_computed_at":"2026-05-18T04:02:03.469494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:03.469494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E7+exHR6KGjho3MlkwI+vSa1cxFK/n4dOomo4dZoUU9KSOBZZSk4XhKkZ4RsQ40h7SbHSpwFqUR0R+3hwQ5FDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:03.469986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1155e81b0f61746726368e62f6b226624b2c3fb48e5c88fa979031ce642d0cfd","sha256:8302eabbbfaa3b4de35516b5fe2ce522c074453bba9dd12a97ffb7fc8b6e9e91"],"state_sha256":"5888a50cbe2b667cbd132127a9a63c4aca2c5e2ebd775fd8a889302d0f9d7dce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axOoDqfbEB+alrFZt24gadM5vXhQOKwP3+rqK+JM/nKjHJdq9a0N3WUMwyCuQRyjJ5qbHkSgVrr00Bst0K4ODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T13:11:27.846087Z","bundle_sha256":"26ddcac4fac391c4a592d55c7dcb9dde7a5e08ba5988b85a092cfbdb429b6361"}}