{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZZDXSSOG27JXDL2HM3BCTRLAKD","short_pith_number":"pith:ZZDXSSOG","schema_version":"1.0","canonical_sha256":"ce477949c6d7d371af4766c229c56050fea56e963727efe8d9b6270d58e1b184","source":{"kind":"arxiv","id":"1912.00275","version":1},"attestation_state":"computed","paper":{"title":"On the Graph Laplacian and the Rankability of Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Amy N. Langville, Heather C. Smith, Thomas R. Cameron","submitted_at":"2019-11-30T22:33:08Z","abstract_excerpt":"Recently, Anderson et al. (2019) proposed the concept of rankability, which refers to a dataset's inherent ability to produce a meaningful ranking of its items. In the same paper, they proposed a rankability measure that is based on a integer program for computing the minimum number of edge changes made to a directed graph in order to obtain a complete dominance graph, i.e., an acyclic tournament graph. In this article, we prove a spectral-degree characterization of complete dominance graphs and apply this characterization to produce a new measure of rankability that is cost-effective and more"},"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":"1912.00275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-30T22:33:08Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"e275dda10caa337bdba59339520d3ea50cdee890e371f28c4fa400ab882793b7","abstract_canon_sha256":"5fc77c192466e8e1afa81a3dabee4c662b0902280fd3cc6294d26a4ff66ba548"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:23:11.565362Z","signature_b64":"MJ2U91QZ091CltWloZT+shffGKD9HGCbRCFxbvny5SZp/1iLun25bZrnQgXoYZ21d8o+gKTmlO/8SNkhu05oCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce477949c6d7d371af4766c229c56050fea56e963727efe8d9b6270d58e1b184","last_reissued_at":"2026-07-05T00:23:11.565013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:23:11.565013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Graph Laplacian and the Rankability of Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Amy N. Langville, Heather C. Smith, Thomas R. Cameron","submitted_at":"2019-11-30T22:33:08Z","abstract_excerpt":"Recently, Anderson et al. (2019) proposed the concept of rankability, which refers to a dataset's inherent ability to produce a meaningful ranking of its items. In the same paper, they proposed a rankability measure that is based on a integer program for computing the minimum number of edge changes made to a directed graph in order to obtain a complete dominance graph, i.e., an acyclic tournament graph. In this article, we prove a spectral-degree characterization of complete dominance graphs and apply this characterization to produce a new measure of rankability that is cost-effective and more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00275","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/1912.00275/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":"1912.00275","created_at":"2026-07-05T00:23:11.565069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.00275v1","created_at":"2026-07-05T00:23:11.565069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00275","created_at":"2026-07-05T00:23:11.565069+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZDXSSOG27JX","created_at":"2026-07-05T00:23:11.565069+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZDXSSOG27JXDL2H","created_at":"2026-07-05T00:23:11.565069+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZDXSSOG","created_at":"2026-07-05T00:23:11.565069+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD","json":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD.json","graph_json":"https://pith.science/api/pith-number/ZZDXSSOG27JXDL2HM3BCTRLAKD/graph.json","events_json":"https://pith.science/api/pith-number/ZZDXSSOG27JXDL2HM3BCTRLAKD/events.json","paper":"https://pith.science/paper/ZZDXSSOG"},"agent_actions":{"view_html":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD","download_json":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD.json","view_paper":"https://pith.science/paper/ZZDXSSOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.00275&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZDXSSOG27JXDL2HM3BCTRLAKD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZDXSSOG27JXDL2HM3BCTRLAKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/action/storage_attestation","attest_author":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/action/author_attestation","sign_citation":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/action/citation_signature","submit_replication":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/action/replication_record"}},"created_at":"2026-07-05T00:23:11.565069+00:00","updated_at":"2026-07-05T00:23:11.565069+00:00"}