{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6UQUAVQQQK45VGHP7NZ7WKZ2GP","short_pith_number":"pith:6UQUAVQQ","schema_version":"1.0","canonical_sha256":"f52140561082b9da98effb73fb2b3a33fd56ee2092439746420118d241e45ca2","source":{"kind":"arxiv","id":"2104.05816","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.05816","created_at":"2026-07-05T02:31:25.452949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.05816v1","created_at":"2026-07-05T02:31:25.452949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.05816","created_at":"2026-07-05T02:31:25.452949+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UQUAVQQQK45","created_at":"2026-07-05T02:31:25.452949+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UQUAVQQQK45VGHP","created_at":"2026-07-05T02:31:25.452949+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UQUAVQQ","created_at":"2026-07-05T02:31:25.452949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.04947","citing_title":"SUMMIR: A Hallucination-Aware Framework for Ranking Sports Insights from LLMs","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP","json":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP.json","graph_json":"https://pith.science/api/pith-number/6UQUAVQQQK45VGHP7NZ7WKZ2GP/graph.json","events_json":"https://pith.science/api/pith-number/6UQUAVQQQK45VGHP7NZ7WKZ2GP/events.json","paper":"https://pith.science/paper/6UQUAVQQ"},"agent_actions":{"view_html":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP","download_json":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP.json","view_paper":"https://pith.science/paper/6UQUAVQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.05816&json=true","fetch_graph":"https://pith.science/api/pith-number/6UQUAVQQQK45VGHP7NZ7WKZ2GP/graph.json","fetch_events":"https://pith.science/api/pith-number/6UQUAVQQQK45VGHP7NZ7WKZ2GP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/action/storage_attestation","attest_author":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/action/author_attestation","sign_citation":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/action/citation_signature","submit_replication":"https://pith.science/pith/6UQUAVQQQK45VGHP7NZ7WKZ2GP/action/replication_record"}},"created_at":"2026-07-05T02:31:25.452949+00:00","updated_at":"2026-07-05T02:31:25.452949+00:00"}