{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:OQYH5SSZWCSTZGQDKORRWDTYFN","short_pith_number":"pith:OQYH5SSZ","schema_version":"1.0","canonical_sha256":"74307eca59b0a53c9a0353a31b0e782b5c62e1680c73568ede47fc6d7ed7050d","source":{"kind":"arxiv","id":"math/0602171","version":3},"attestation_state":"computed","paper":{"title":"Preference fusion when the number of alternatives exceeds two: indirect scoring procedures","license":"","headline":"","cross_cats":["cs.MA","math.CO"],"primary_cat":"math.OC","authors_text":"Elena Shamis, Pavel Chebotarev","submitted_at":"2006-02-08T20:23:37Z","abstract_excerpt":"We consider the problem of aggregation of incomplete preferences represented by arbitrary binary relations or incomplete paired comparison matrices. For a number of indirect scoring procedures we examine whether or not they satisfy the axiom of self-consistent monotonicity. The class of {\\em win-loss combining scoring procedures} is introduced which contains a majority of known scoring procedures. Two main results are established. According to the first one, every win-loss combining scoring procedure breaks self-consistent monotonicity. The second result provides a sufficient condition of sati"},"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":"math/0602171","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2006-02-08T20:23:37Z","cross_cats_sorted":["cs.MA","math.CO"],"title_canon_sha256":"20952294c96b0c05c8d023046c2fb88b14d1a5d95d3ca8b01255714d97d1a800","abstract_canon_sha256":"4b164c7de00f2265198555439d6c7811682899cff3dc828faa4217d7cdba7635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:18.332416Z","signature_b64":"K1bJl+AK5KgQCJACrrRr6DxFOFK3tRjTmQUmG85nPXlY6X5f5Nu2SIR9vV2FZJuo1qQzNuGnhT2B9M5dcldeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74307eca59b0a53c9a0353a31b0e782b5c62e1680c73568ede47fc6d7ed7050d","last_reissued_at":"2026-05-18T04:11:18.331842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:18.331842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preference fusion when the number of alternatives exceeds two: indirect scoring procedures","license":"","headline":"","cross_cats":["cs.MA","math.CO"],"primary_cat":"math.OC","authors_text":"Elena Shamis, Pavel Chebotarev","submitted_at":"2006-02-08T20:23:37Z","abstract_excerpt":"We consider the problem of aggregation of incomplete preferences represented by arbitrary binary relations or incomplete paired comparison matrices. For a number of indirect scoring procedures we examine whether or not they satisfy the axiom of self-consistent monotonicity. The class of {\\em win-loss combining scoring procedures} is introduced which contains a majority of known scoring procedures. Two main results are established. According to the first one, every win-loss combining scoring procedure breaks self-consistent monotonicity. The second result provides a sufficient condition of sati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602171","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0602171","created_at":"2026-05-18T04:11:18.331918+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0602171v3","created_at":"2026-05-18T04:11:18.331918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602171","created_at":"2026-05-18T04:11:18.331918+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQYH5SSZWCST","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQYH5SSZWCSTZGQD","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQYH5SSZ","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN","json":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN.json","graph_json":"https://pith.science/api/pith-number/OQYH5SSZWCSTZGQDKORRWDTYFN/graph.json","events_json":"https://pith.science/api/pith-number/OQYH5SSZWCSTZGQDKORRWDTYFN/events.json","paper":"https://pith.science/paper/OQYH5SSZ"},"agent_actions":{"view_html":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN","download_json":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN.json","view_paper":"https://pith.science/paper/OQYH5SSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0602171&json=true","fetch_graph":"https://pith.science/api/pith-number/OQYH5SSZWCSTZGQDKORRWDTYFN/graph.json","fetch_events":"https://pith.science/api/pith-number/OQYH5SSZWCSTZGQDKORRWDTYFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/action/storage_attestation","attest_author":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/action/author_attestation","sign_citation":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/action/citation_signature","submit_replication":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/action/replication_record"}},"created_at":"2026-05-18T04:11:18.331918+00:00","updated_at":"2026-05-18T04:11:18.331918+00:00"}