{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6UQUAVQQQK45VGHP7NZ7WKZ2GP","short_pith_number":"pith:6UQUAVQQ","canonical_record":{"source":{"id":"2104.05816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-04-12T21:05:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1e2cf80ca0b2ecc1b1803250d45fe98ae278f77686741265d155d74b1b3d8724","abstract_canon_sha256":"1a254a6abf848b9c1b07dc9456941f9a034db6592f53cbc4d2f6c8030dc45b11"},"schema_version":"1.0"},"canonical_sha256":"f52140561082b9da98effb73fb2b3a33fd56ee2092439746420118d241e45ca2","source":{"kind":"arxiv","id":"2104.05816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.05816","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"arxiv_version","alias_value":"2104.05816v1","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.05816","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"pith_short_12","alias_value":"6UQUAVQQQK45","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"pith_short_16","alias_value":"6UQUAVQQQK45VGHP","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"pith_short_8","alias_value":"6UQUAVQQ","created_at":"2026-07-05T02:31:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6UQUAVQQQK45VGHP7NZ7WKZ2GP","target":"record","payload":{"canonical_record":{"source":{"id":"2104.05816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-04-12T21:05:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1e2cf80ca0b2ecc1b1803250d45fe98ae278f77686741265d155d74b1b3d8724","abstract_canon_sha256":"1a254a6abf848b9c1b07dc9456941f9a034db6592f53cbc4d2f6c8030dc45b11"},"schema_version":"1.0"},"canonical_sha256":"f52140561082b9da98effb73fb2b3a33fd56ee2092439746420118d241e45ca2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:25.453255Z","signature_b64":"Nm/TP06wLfMKQM57Rh8JUUDHvI8j56DNG+iM6qvsNs1k73ST1Ar5nbbW8hsaA+VTqgjzMJ1su3bkfqtIfMVBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f52140561082b9da98effb73fb2b3a33fd56ee2092439746420118d241e45ca2","last_reissued_at":"2026-07-05T02:31:25.452894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:25.452894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.05816","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-05T02:31:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pWgU5k3K71al8Oy6ky6/eH7oycBB7u8DhK1QkBI5maecyAiTjaCrY2nwcyH45nHBzx5qcY+QMk9TbTID8kZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:57:14.294016Z"},"content_sha256":"bd447749e19dba7a026795734e231e23f37753e37bf1dc6fc015e2988009922f","schema_version":"1.0","event_id":"sha256:bd447749e19dba7a026795734e231e23f37753e37bf1dc6fc015e2988009922f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6UQUAVQQQK45VGHP7NZ7WKZ2GP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Linear Ordering Problem and the Rankability of Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Jonad Pulaj, Sebastian Charmot, Thomas R. Cameron","submitted_at":"2021-04-12T21:05:17Z","abstract_excerpt":"In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review of the linear ordering problem (LOP) and then use it to analyze the rankability of data. Specifically, the degree of linearity is used to quantify what percentage of the data aligns with an optimal ranking. In a sports context, this is analogous to the number of games that a ranking can correctly predict in hindsight. In fact, under the appropriate objective function, we show that the optimal rankings computed via th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.05816","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/2104.05816/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-05T02:31:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGMc5uujjlwqU54HM4FygWECQSLRa7Kp+C9GFdxRBhWYY3N2ryR4o/GA8b6z4G/vJH/x6FIJHb51zMbDt2joDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:57:14.294400Z"},"content_sha256":"305c486c338e75f666cf6d442d3e5a72e26819b09348c0e41139892a879d9505","schema_version":"1.0","event_id":"sha256:305c486c338e75f666cf6d442d3e5a72e26819b09348c0e41139892a879d9505"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/bundle.json","state_url":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/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-07T11:57:14Z","links":{"resolver":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP","bundle":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/bundle.json","state":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6UQUAVQQQK45VGHP7NZ7WKZ2GP","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":"1a254a6abf848b9c1b07dc9456941f9a034db6592f53cbc4d2f6c8030dc45b11","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-04-12T21:05:17Z","title_canon_sha256":"1e2cf80ca0b2ecc1b1803250d45fe98ae278f77686741265d155d74b1b3d8724"},"schema_version":"1.0","source":{"id":"2104.05816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.05816","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"arxiv_version","alias_value":"2104.05816v1","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.05816","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"pith_short_12","alias_value":"6UQUAVQQQK45","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"pith_short_16","alias_value":"6UQUAVQQQK45VGHP","created_at":"2026-07-05T02:31:25Z"},{"alias_kind":"pith_short_8","alias_value":"6UQUAVQQ","created_at":"2026-07-05T02:31:25Z"}],"graph_snapshots":[{"event_id":"sha256:305c486c338e75f666cf6d442d3e5a72e26819b09348c0e41139892a879d9505","target":"graph","created_at":"2026-07-05T02:31:25Z","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/2104.05816/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review of the linear ordering problem (LOP) and then use it to analyze the rankability of data. Specifically, the degree of linearity is used to quantify what percentage of the data aligns with an optimal ranking. In a sports context, this is analogous to the number of games that a ranking can correctly predict in hindsight. In fact, under the appropriate objective function, we show that the optimal rankings computed via th","authors_text":"Jonad Pulaj, Sebastian Charmot, Thomas R. Cameron","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-04-12T21:05:17Z","title":"On the Linear Ordering Problem and the Rankability of Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.05816","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:bd447749e19dba7a026795734e231e23f37753e37bf1dc6fc015e2988009922f","target":"record","created_at":"2026-07-05T02:31:25Z","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":"1a254a6abf848b9c1b07dc9456941f9a034db6592f53cbc4d2f6c8030dc45b11","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-04-12T21:05:17Z","title_canon_sha256":"1e2cf80ca0b2ecc1b1803250d45fe98ae278f77686741265d155d74b1b3d8724"},"schema_version":"1.0","source":{"id":"2104.05816","kind":"arxiv","version":1}},"canonical_sha256":"f52140561082b9da98effb73fb2b3a33fd56ee2092439746420118d241e45ca2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f52140561082b9da98effb73fb2b3a33fd56ee2092439746420118d241e45ca2","first_computed_at":"2026-07-05T02:31:25.452894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:31:25.452894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nm/TP06wLfMKQM57Rh8JUUDHvI8j56DNG+iM6qvsNs1k73ST1Ar5nbbW8hsaA+VTqgjzMJ1su3bkfqtIfMVBBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:31:25.453255Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.05816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd447749e19dba7a026795734e231e23f37753e37bf1dc6fc015e2988009922f","sha256:305c486c338e75f666cf6d442d3e5a72e26819b09348c0e41139892a879d9505"],"state_sha256":"91ba6f93b88e0fd05cebde1020e6611d5fa318bcaa5d5550d7b0b0d3f5e3fd26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdyRueauN7zuGMoMQL5EZtIuD218u6W3M9a9lS1Ut7oh4RDW4SuJtnBBb89ORzKCfNjy7xp6hHizLRIVAZO5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:57:14.296381Z","bundle_sha256":"1687380b10b7ca9de58a4159f37927d0cbe7c29b128722b6cf1252d1a5f8deac"}}