{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:L5RLMO3RZXYDZIFZH6NITEZ4IZ","short_pith_number":"pith:L5RLMO3R","schema_version":"1.0","canonical_sha256":"5f62b63b71cdf03ca0b93f9a89933c465cb11ff1eed547b23a76987b7a8b5fcd","source":{"kind":"arxiv","id":"2004.05691","version":1},"attestation_state":"computed","paper":{"title":"Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aliaksei Mikhailiuk, Clifford Wilmot, Dingcheng Yue, Maria Perez-Ortiz, Rafal Mantiuk","submitted_at":"2020-04-12T20:48:10Z","abstract_excerpt":"Pairwise comparison data arise in many domains with subjective assessment experiments, for example in image and video quality assessment. In these experiments observers are asked to express a preference between two conditions. However, many pairwise comparison protocols require a large number of comparisons to infer accurate scores, which may be unfeasible when each comparison is time-consuming (e.g. videos) or expensive (e.g. medical imaging). This motivates the use of an active sampling algorithm that chooses only the most informative pairs for comparison. In this paper we propose ASAP, an a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2004.05691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-12T20:48:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2f00e0e9842f3ed695f1fa28223de74944a174f6e15bda79faac8884997104b4","abstract_canon_sha256":"939a82b06159774dbd9994182c1cd773d9c1600d2b61b26fba79ba6a81500092"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:39.788800Z","signature_b64":"JdcxPOhZuyrQ9+jm/KiZVQ9qG/NpLEJgMejLav7ojWdYVWXu4IydE5sMYTxgZtUw87ilttf6qVRJMx009JyNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f62b63b71cdf03ca0b93f9a89933c465cb11ff1eed547b23a76987b7a8b5fcd","last_reissued_at":"2026-07-05T00:54:39.788284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:39.788284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aliaksei Mikhailiuk, Clifford Wilmot, Dingcheng Yue, Maria Perez-Ortiz, Rafal Mantiuk","submitted_at":"2020-04-12T20:48:10Z","abstract_excerpt":"Pairwise comparison data arise in many domains with subjective assessment experiments, for example in image and video quality assessment. In these experiments observers are asked to express a preference between two conditions. However, many pairwise comparison protocols require a large number of comparisons to infer accurate scores, which may be unfeasible when each comparison is time-consuming (e.g. videos) or expensive (e.g. medical imaging). This motivates the use of an active sampling algorithm that chooses only the most informative pairs for comparison. In this paper we propose ASAP, an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05691","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.05691/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2004.05691","created_at":"2026-07-05T00:54:39.788358+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.05691v1","created_at":"2026-07-05T00:54:39.788358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05691","created_at":"2026-07-05T00:54:39.788358+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5RLMO3RZXYD","created_at":"2026-07-05T00:54:39.788358+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5RLMO3RZXYDZIFZ","created_at":"2026-07-05T00:54:39.788358+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5RLMO3R","created_at":"2026-07-05T00:54:39.788358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24643","citing_title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ","json":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ.json","graph_json":"https://pith.science/api/pith-number/L5RLMO3RZXYDZIFZH6NITEZ4IZ/graph.json","events_json":"https://pith.science/api/pith-number/L5RLMO3RZXYDZIFZH6NITEZ4IZ/events.json","paper":"https://pith.science/paper/L5RLMO3R"},"agent_actions":{"view_html":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ","download_json":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ.json","view_paper":"https://pith.science/paper/L5RLMO3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.05691&json=true","fetch_graph":"https://pith.science/api/pith-number/L5RLMO3RZXYDZIFZH6NITEZ4IZ/graph.json","fetch_events":"https://pith.science/api/pith-number/L5RLMO3RZXYDZIFZH6NITEZ4IZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ/action/storage_attestation","attest_author":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ/action/author_attestation","sign_citation":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ/action/citation_signature","submit_replication":"https://pith.science/pith/L5RLMO3RZXYDZIFZH6NITEZ4IZ/action/replication_record"}},"created_at":"2026-07-05T00:54:39.788358+00:00","updated_at":"2026-07-05T00:54:39.788358+00:00"}