{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YEDJXVTC2IZJISRDUSFQZ7GLTT","short_pith_number":"pith:YEDJXVTC","canonical_record":{"source":{"id":"2510.27011","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-10-30T21:24:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1a1448776c6c4f1435603dbc513a85380dc3c574dc939546d91a88616c8dfc19","abstract_canon_sha256":"1abffe6bf18426f61b1649cd97025ebfb99b0d9a6a420ef96ab0b2e1c7235b61"},"schema_version":"1.0"},"canonical_sha256":"c1069bd662d232944a23a48b0cfccb9cd27d7d3cbc81ea2dbe74ae98ea10a701","source":{"kind":"arxiv","id":"2510.27011","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.27011","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"2510.27011v4","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27011","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"YEDJXVTC2IZJ","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"pith_short_16","alias_value":"YEDJXVTC2IZJISRD","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"pith_short_8","alias_value":"YEDJXVTC","created_at":"2026-05-25T02:02:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YEDJXVTC2IZJISRDUSFQZ7GLTT","target":"record","payload":{"canonical_record":{"source":{"id":"2510.27011","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-10-30T21:24:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1a1448776c6c4f1435603dbc513a85380dc3c574dc939546d91a88616c8dfc19","abstract_canon_sha256":"1abffe6bf18426f61b1649cd97025ebfb99b0d9a6a420ef96ab0b2e1c7235b61"},"schema_version":"1.0"},"canonical_sha256":"c1069bd662d232944a23a48b0cfccb9cd27d7d3cbc81ea2dbe74ae98ea10a701","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:09.858880Z","signature_b64":"IIlOz2BiHbmHvJEEB0LbgK0OtxXMJtkLGR9GR0SgQW/7D8X1vX+02kdFzYQkJ5CXNSLRcGWe62zzOqEVCQ7SAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1069bd662d232944a23a48b0cfccb9cd27d7d3cbc81ea2dbe74ae98ea10a701","last_reissued_at":"2026-05-25T02:02:09.858151Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:09.858151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.27011","source_version":4,"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-25T02:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTmEqNF5mE1BCuYYXPKU/Udd3t/mWv4IQ+x/fSbI+Vwqd3DkrxFi9TolZBmrAEDKGzWcMB4AHQUHwsSKmuyfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:36:01.701496Z"},"content_sha256":"b4348f93e7d770ce77e645982d1c4967a5a07e955c521ae637dc5f5645787f36","schema_version":"1.0","event_id":"sha256:b4348f93e7d770ce77e645982d1c4967a5a07e955c521ae637dc5f5645787f36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YEDJXVTC2IZJISRDUSFQZ7GLTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Refined thresholds for inconsistency: The effect of the graph associated with incomplete pairwise comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Inconsistency thresholds for incomplete pairwise comparisons depend on the graph of known comparisons.","cross_cats":["math.OC"],"primary_cat":"stat.ME","authors_text":"Kolos Csaba \\'Agoston, L\\'aszl\\'o Csat\\'o","submitted_at":"2025-10-30T21:24:34Z","abstract_excerpt":"The inconsistency of pairwise comparisons remains difficult to interpret in the absence of acceptability thresholds. The popular 10% cut-off rule proposed by Saaty has recently been applied to incomplete pairwise comparison matrices, which contain some unknown comparisons. This paper refines these inconsistency thresholds: we uncover that they depend not only on the size of the matrix and the number of missing entries, but also on the undirected graph whose edges represent the known pairwise comparisons. Therefore, using our exact thresholds is especially important if the filling in patterns c"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We uncover that they depend not only on the size of the matrix and the number of missing entries, but also on the undirected graph whose edges represent the known pairwise comparisons.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The inconsistency measure permits exact, graph-dependent thresholds that can be precomputed from the spectral radius without additional fitting or post-hoc adjustments for each matrix.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Inconsistency thresholds for incomplete pairwise comparisons depend on the spectral radius of the graph formed by known entries, beyond matrix size and missing count.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Inconsistency thresholds for incomplete pairwise comparisons depend on the graph of known comparisons.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3c7a1ceb57f7633c1496db30cacf84ab413a207807700fc7e3dd20fe99e058b3"},"source":{"id":"2510.27011","kind":"arxiv","version":4},"verdict":{"id":"30373967-d0fb-4c9d-8e66-b51edf4deba9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T02:20:27.167166Z","strongest_claim":"We uncover that they depend not only on the size of the matrix and the number of missing entries, but also on the undirected graph whose edges represent the known pairwise comparisons.","one_line_summary":"Inconsistency thresholds for incomplete pairwise comparisons depend on the spectral radius of the graph formed by known entries, beyond matrix size and missing count.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The inconsistency measure permits exact, graph-dependent thresholds that can be precomputed from the spectral radius without additional fitting or post-hoc adjustments for each matrix.","pith_extraction_headline":"Inconsistency thresholds for incomplete pairwise comparisons depend on the graph of known comparisons."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.27011/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":1,"snapshot_sha256":"aa0843822dec7de35a58c9af80e9dda7021453695240599f6359f89ab081bc33"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"30373967-d0fb-4c9d-8e66-b51edf4deba9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RVx0ZkgVQrLawnrYW6eaPY6O/u5NIwHzPybAAe9kvLBfUGzFGWTfhQXi+HJfpJv4CYTAvJO2UNzUX4JxiVjQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:36:01.701968Z"},"content_sha256":"e411769420e0030319895c431fc480b0339584513ea0435087ad4f2b0230856f","schema_version":"1.0","event_id":"sha256:e411769420e0030319895c431fc480b0339584513ea0435087ad4f2b0230856f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEDJXVTC2IZJISRDUSFQZ7GLTT/bundle.json","state_url":"https://pith.science/pith/YEDJXVTC2IZJISRDUSFQZ7GLTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEDJXVTC2IZJISRDUSFQZ7GLTT/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-06-01T10:36:01Z","links":{"resolver":"https://pith.science/pith/YEDJXVTC2IZJISRDUSFQZ7GLTT","bundle":"https://pith.science/pith/YEDJXVTC2IZJISRDUSFQZ7GLTT/bundle.json","state":"https://pith.science/pith/YEDJXVTC2IZJISRDUSFQZ7GLTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEDJXVTC2IZJISRDUSFQZ7GLTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YEDJXVTC2IZJISRDUSFQZ7GLTT","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":"1abffe6bf18426f61b1649cd97025ebfb99b0d9a6a420ef96ab0b2e1c7235b61","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-10-30T21:24:34Z","title_canon_sha256":"1a1448776c6c4f1435603dbc513a85380dc3c574dc939546d91a88616c8dfc19"},"schema_version":"1.0","source":{"id":"2510.27011","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.27011","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"2510.27011v4","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.27011","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"YEDJXVTC2IZJ","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"pith_short_16","alias_value":"YEDJXVTC2IZJISRD","created_at":"2026-05-25T02:02:09Z"},{"alias_kind":"pith_short_8","alias_value":"YEDJXVTC","created_at":"2026-05-25T02:02:09Z"}],"graph_snapshots":[{"event_id":"sha256:e411769420e0030319895c431fc480b0339584513ea0435087ad4f2b0230856f","target":"graph","created_at":"2026-05-25T02:02:09Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We uncover that they depend not only on the size of the matrix and the number of missing entries, but also on the undirected graph whose edges represent the known pairwise comparisons."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The inconsistency measure permits exact, graph-dependent thresholds that can be precomputed from the spectral radius without additional fitting or post-hoc adjustments for each matrix."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Inconsistency thresholds for incomplete pairwise comparisons depend on the spectral radius of the graph formed by known entries, beyond matrix size and missing count."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Inconsistency thresholds for incomplete pairwise comparisons depend on the graph of known comparisons."}],"snapshot_sha256":"3c7a1ceb57f7633c1496db30cacf84ab413a207807700fc7e3dd20fe99e058b3"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"aa0843822dec7de35a58c9af80e9dda7021453695240599f6359f89ab081bc33"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.27011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The inconsistency of pairwise comparisons remains difficult to interpret in the absence of acceptability thresholds. The popular 10% cut-off rule proposed by Saaty has recently been applied to incomplete pairwise comparison matrices, which contain some unknown comparisons. This paper refines these inconsistency thresholds: we uncover that they depend not only on the size of the matrix and the number of missing entries, but also on the undirected graph whose edges represent the known pairwise comparisons. Therefore, using our exact thresholds is especially important if the filling in patterns c","authors_text":"Kolos Csaba \\'Agoston, L\\'aszl\\'o Csat\\'o","cross_cats":["math.OC"],"headline":"Inconsistency thresholds for incomplete pairwise comparisons depend on the graph of known comparisons.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-10-30T21:24:34Z","title":"Refined thresholds for inconsistency: The effect of the graph associated with incomplete pairwise comparisons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.27011","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-18T02:20:27.167166Z","id":"30373967-d0fb-4c9d-8e66-b51edf4deba9","model_set":{"reader":"grok-4.3"},"one_line_summary":"Inconsistency thresholds for incomplete pairwise comparisons depend on the spectral radius of the graph formed by known entries, beyond matrix size and missing count.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Inconsistency thresholds for incomplete pairwise comparisons depend on the graph of known comparisons.","strongest_claim":"We uncover that they depend not only on the size of the matrix and the number of missing entries, but also on the undirected graph whose edges represent the known pairwise comparisons.","weakest_assumption":"The inconsistency measure permits exact, graph-dependent thresholds that can be precomputed from the spectral radius without additional fitting or post-hoc adjustments for each matrix."}},"verdict_id":"30373967-d0fb-4c9d-8e66-b51edf4deba9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4348f93e7d770ce77e645982d1c4967a5a07e955c521ae637dc5f5645787f36","target":"record","created_at":"2026-05-25T02:02:09Z","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":"1abffe6bf18426f61b1649cd97025ebfb99b0d9a6a420ef96ab0b2e1c7235b61","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-10-30T21:24:34Z","title_canon_sha256":"1a1448776c6c4f1435603dbc513a85380dc3c574dc939546d91a88616c8dfc19"},"schema_version":"1.0","source":{"id":"2510.27011","kind":"arxiv","version":4}},"canonical_sha256":"c1069bd662d232944a23a48b0cfccb9cd27d7d3cbc81ea2dbe74ae98ea10a701","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1069bd662d232944a23a48b0cfccb9cd27d7d3cbc81ea2dbe74ae98ea10a701","first_computed_at":"2026-05-25T02:02:09.858151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:09.858151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IIlOz2BiHbmHvJEEB0LbgK0OtxXMJtkLGR9GR0SgQW/7D8X1vX+02kdFzYQkJ5CXNSLRcGWe62zzOqEVCQ7SAQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:09.858880Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.27011","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4348f93e7d770ce77e645982d1c4967a5a07e955c521ae637dc5f5645787f36","sha256:e411769420e0030319895c431fc480b0339584513ea0435087ad4f2b0230856f"],"state_sha256":"5f9dca8bcf6e7d945c8c0c289ea00a88c8c4c3e11f08e5b840f09e5d7c65e739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CT2E3oVSYzEuv3tX9oTHS0vykxGjTbS0Eboc2DuJKCPVeH9aG4cnBvKNbmDEdwirwG9p7ZqnXe+Iw+uH5cXHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:36:01.704386Z","bundle_sha256":"f3406c4c60178f91d90c96c9681076b45ef4cec6c90a99141a59abad5f1ac7d7"}}