{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:OQYH5SSZWCSTZGQDKORRWDTYFN","short_pith_number":"pith:OQYH5SSZ","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"},"canonical_sha256":"74307eca59b0a53c9a0353a31b0e782b5c62e1680c73568ede47fc6d7ed7050d","source":{"kind":"arxiv","id":"math/0602171","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0602171","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"math/0602171v3","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602171","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"OQYH5SSZWCST","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"OQYH5SSZWCSTZGQD","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"OQYH5SSZ","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:OQYH5SSZWCSTZGQDKORRWDTYFN","target":"record","payload":{"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"},"canonical_sha256":"74307eca59b0a53c9a0353a31b0e782b5c62e1680c73568ede47fc6d7ed7050d","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"},"source_kind":"arxiv","source_id":"math/0602171","source_version":3,"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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nvswy1mo0VgHdwo34srJtHF+FkfdZ8qibLxLKY2JAS2+eansTy2zUALVhkauHJH5kgOdvukoSe8GldStEkaKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:34:50.117639Z"},"content_sha256":"9864bf03e3c74dc7cb7fb1d021a3f4c1027dd0835ab175e3c58d1cba73f21fe6","schema_version":"1.0","event_id":"sha256:9864bf03e3c74dc7cb7fb1d021a3f4c1027dd0835ab175e3c58d1cba73f21fe6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:OQYH5SSZWCSTZGQDKORRWDTYFN","target":"graph","payload":{"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"},"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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9x+PPhB/vD6ghJoHh8oAuRmL/vz/xb+foKTQe6l7wDKa1ZpUYVOcBgUkjWl9v9TzLq6lLgJSUv8E3+OI15+ZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:34:50.117983Z"},"content_sha256":"bcaee2c55e89c529005ddbe8f89ab915a5fa002abafdd68c2b047e533337c03a","schema_version":"1.0","event_id":"sha256:bcaee2c55e89c529005ddbe8f89ab915a5fa002abafdd68c2b047e533337c03a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/bundle.json","state_url":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/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-07-06T18:34:50Z","links":{"resolver":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN","bundle":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/bundle.json","state":"https://pith.science/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQYH5SSZWCSTZGQDKORRWDTYFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:OQYH5SSZWCSTZGQDKORRWDTYFN","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":"4b164c7de00f2265198555439d6c7811682899cff3dc828faa4217d7cdba7635","cross_cats_sorted":["cs.MA","math.CO"],"license":"","primary_cat":"math.OC","submitted_at":"2006-02-08T20:23:37Z","title_canon_sha256":"20952294c96b0c05c8d023046c2fb88b14d1a5d95d3ca8b01255714d97d1a800"},"schema_version":"1.0","source":{"id":"math/0602171","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0602171","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"math/0602171v3","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602171","created_at":"2026-05-18T04:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"OQYH5SSZWCST","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"OQYH5SSZWCSTZGQD","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"OQYH5SSZ","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:bcaee2c55e89c529005ddbe8f89ab915a5fa002abafdd68c2b047e533337c03a","target":"graph","created_at":"2026-05-18T04:11:18Z","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 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","authors_text":"Elena Shamis, Pavel Chebotarev","cross_cats":["cs.MA","math.CO"],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2006-02-08T20:23:37Z","title":"Preference fusion when the number of alternatives exceeds two: indirect scoring procedures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602171","kind":"arxiv","version":3},"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:9864bf03e3c74dc7cb7fb1d021a3f4c1027dd0835ab175e3c58d1cba73f21fe6","target":"record","created_at":"2026-05-18T04:11:18Z","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":"4b164c7de00f2265198555439d6c7811682899cff3dc828faa4217d7cdba7635","cross_cats_sorted":["cs.MA","math.CO"],"license":"","primary_cat":"math.OC","submitted_at":"2006-02-08T20:23:37Z","title_canon_sha256":"20952294c96b0c05c8d023046c2fb88b14d1a5d95d3ca8b01255714d97d1a800"},"schema_version":"1.0","source":{"id":"math/0602171","kind":"arxiv","version":3}},"canonical_sha256":"74307eca59b0a53c9a0353a31b0e782b5c62e1680c73568ede47fc6d7ed7050d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74307eca59b0a53c9a0353a31b0e782b5c62e1680c73568ede47fc6d7ed7050d","first_computed_at":"2026-05-18T04:11:18.331842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:18.331842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K1bJl+AK5KgQCJACrrRr6DxFOFK3tRjTmQUmG85nPXlY6X5f5Nu2SIR9vV2FZJuo1qQzNuGnhT2B9M5dcldeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:18.332416Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0602171","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9864bf03e3c74dc7cb7fb1d021a3f4c1027dd0835ab175e3c58d1cba73f21fe6","sha256:bcaee2c55e89c529005ddbe8f89ab915a5fa002abafdd68c2b047e533337c03a"],"state_sha256":"0bd20320c2803d2438b38d977f637ab5599eb983cea20793f0423f9737981101"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBuI8JoYwfndaSaGeFQnOSHly2mSB9oqnzZhZ+k5COj/A8egiUjK7UK/SK1eAy/ZC8aMs6nzudwiMprO+OuvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:34:50.119830Z","bundle_sha256":"4b13a619ddc420f3fd24e8b0b3604aed2ac6550b314104718ff49fd09a82dfb8"}}