{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:5XSEF2YMMVEJOEJASDKZLOUXBA","short_pith_number":"pith:5XSEF2YM","canonical_record":{"source":{"id":"math/0602552","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2006-02-24T16:09:14Z","cross_cats_sorted":["cs.MA","math.CO"],"title_canon_sha256":"36668858321bc53041904e59fe3527876a37c1b4e8dc98276c837f883f8885c7","abstract_canon_sha256":"78704591f382f769dea4193af0cc67d51889d64ea1f3dca0e5863cd741f8593a"},"schema_version":"1.0"},"canonical_sha256":"ede442eb0c654897112090d595ba9708160397fcfe3d3e7962cea0e50829bdff","source":{"kind":"arxiv","id":"math/0602552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0602552","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"math/0602552v1","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602552","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"5XSEF2YMMVEJ","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"pith_short_16","alias_value":"5XSEF2YMMVEJOEJA","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"pith_short_8","alias_value":"5XSEF2YM","created_at":"2026-07-04T14:53:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:5XSEF2YMMVEJOEJASDKZLOUXBA","target":"record","payload":{"canonical_record":{"source":{"id":"math/0602552","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2006-02-24T16:09:14Z","cross_cats_sorted":["cs.MA","math.CO"],"title_canon_sha256":"36668858321bc53041904e59fe3527876a37c1b4e8dc98276c837f883f8885c7","abstract_canon_sha256":"78704591f382f769dea4193af0cc67d51889d64ea1f3dca0e5863cd741f8593a"},"schema_version":"1.0"},"canonical_sha256":"ede442eb0c654897112090d595ba9708160397fcfe3d3e7962cea0e50829bdff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:53:26.297926Z","signature_b64":"rq64fpMpK6BtWbmdsS3NFUCXdB2/y4bPTpnhNcEZIosruKRGNoFSyCG4QcEBNEnAOHACeVXJM4x+BJER0H/kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede442eb0c654897112090d595ba9708160397fcfe3d3e7962cea0e50829bdff","last_reissued_at":"2026-07-04T14:53:26.297526Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:53:26.297526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0602552","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-07-04T14:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dSRaLFEQDpzj5kTZwNq4t7MLUiln4eBBV4O3o/3RuDGi9HfnJQXcRQuhgpgOBBQkQtEGwTopnmi96K3pfPoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:09:31.927552Z"},"content_sha256":"52cb208ae27dd82832e8aa116f1608e8150c0dafecd9e92f3a7f6b7176f8926a","schema_version":"1.0","event_id":"sha256:52cb208ae27dd82832e8aa116f1608e8150c0dafecd9e92f3a7f6b7176f8926a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:5XSEF2YMMVEJOEJASDKZLOUXBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Incomplete Preferences to Ranking via Optimization","license":"","headline":"","cross_cats":["cs.MA","math.CO"],"primary_cat":"math.OC","authors_text":"Elena Shamis, Pavel Chebotarev","submitted_at":"2006-02-24T16:09:14Z","abstract_excerpt":"We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices. This incomplete case remains practically unexplored so far. We examine the properties of several known methods and propose one new method. In particular, we test whether these methods obey a new axiom referred to as {\\it Self-Consistent Monotonicity}. Some results are established that characterize solutions of the related optimization problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602552","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/math/0602552/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"},"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-07-04T14:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82DALumChscjvoovQLDDJ+cKLGqSpBCjECWK91K2ETyFGoPc7lo5e0F6o2HqjHK3E7wGVIsIrNZ372hkSSSgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:09:31.927930Z"},"content_sha256":"66d4dc36f1576bd059fc41594bd40018d470562300e86f4b303fcad092064c5c","schema_version":"1.0","event_id":"sha256:66d4dc36f1576bd059fc41594bd40018d470562300e86f4b303fcad092064c5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XSEF2YMMVEJOEJASDKZLOUXBA/bundle.json","state_url":"https://pith.science/pith/5XSEF2YMMVEJOEJASDKZLOUXBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XSEF2YMMVEJOEJASDKZLOUXBA/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-07T07:09:31Z","links":{"resolver":"https://pith.science/pith/5XSEF2YMMVEJOEJASDKZLOUXBA","bundle":"https://pith.science/pith/5XSEF2YMMVEJOEJASDKZLOUXBA/bundle.json","state":"https://pith.science/pith/5XSEF2YMMVEJOEJASDKZLOUXBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XSEF2YMMVEJOEJASDKZLOUXBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:5XSEF2YMMVEJOEJASDKZLOUXBA","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":"78704591f382f769dea4193af0cc67d51889d64ea1f3dca0e5863cd741f8593a","cross_cats_sorted":["cs.MA","math.CO"],"license":"","primary_cat":"math.OC","submitted_at":"2006-02-24T16:09:14Z","title_canon_sha256":"36668858321bc53041904e59fe3527876a37c1b4e8dc98276c837f883f8885c7"},"schema_version":"1.0","source":{"id":"math/0602552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0602552","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"math/0602552v1","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602552","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"5XSEF2YMMVEJ","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"pith_short_16","alias_value":"5XSEF2YMMVEJOEJA","created_at":"2026-07-04T14:53:26Z"},{"alias_kind":"pith_short_8","alias_value":"5XSEF2YM","created_at":"2026-07-04T14:53:26Z"}],"graph_snapshots":[{"event_id":"sha256:66d4dc36f1576bd059fc41594bd40018d470562300e86f4b303fcad092064c5c","target":"graph","created_at":"2026-07-04T14:53:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0602552/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices. This incomplete case remains practically unexplored so far. We examine the properties of several known methods and propose one new method. In particular, we test whether these methods obey a new axiom referred to as {\\it Self-Consistent Monotonicity}. Some results are established that characterize solutions of the related optimization problems.","authors_text":"Elena Shamis, Pavel Chebotarev","cross_cats":["cs.MA","math.CO"],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2006-02-24T16:09:14Z","title":"From Incomplete Preferences to Ranking via Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602552","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:52cb208ae27dd82832e8aa116f1608e8150c0dafecd9e92f3a7f6b7176f8926a","target":"record","created_at":"2026-07-04T14:53:26Z","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":"78704591f382f769dea4193af0cc67d51889d64ea1f3dca0e5863cd741f8593a","cross_cats_sorted":["cs.MA","math.CO"],"license":"","primary_cat":"math.OC","submitted_at":"2006-02-24T16:09:14Z","title_canon_sha256":"36668858321bc53041904e59fe3527876a37c1b4e8dc98276c837f883f8885c7"},"schema_version":"1.0","source":{"id":"math/0602552","kind":"arxiv","version":1}},"canonical_sha256":"ede442eb0c654897112090d595ba9708160397fcfe3d3e7962cea0e50829bdff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede442eb0c654897112090d595ba9708160397fcfe3d3e7962cea0e50829bdff","first_computed_at":"2026-07-04T14:53:26.297526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:53:26.297526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rq64fpMpK6BtWbmdsS3NFUCXdB2/y4bPTpnhNcEZIosruKRGNoFSyCG4QcEBNEnAOHACeVXJM4x+BJER0H/kDw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:53:26.297926Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0602552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52cb208ae27dd82832e8aa116f1608e8150c0dafecd9e92f3a7f6b7176f8926a","sha256:66d4dc36f1576bd059fc41594bd40018d470562300e86f4b303fcad092064c5c"],"state_sha256":"73c436289581e3961f6ac46469f3870ab601f5a9e0b494aabdf6d87160f95960"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sLxtJQfeFeBbSNbHBDicCi8PAaBl454vIlTROUBTODoRBKD4s/rp/GsR/14y0lVs02ALujJjrfaqgVWjWUbcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:09:31.929877Z","bundle_sha256":"f675b9e30838aa64e90b5e9cf2fe8d19488b1a4cff1fb25eecd958799e2cc7f3"}}