{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZZDXSSOG27JXDL2HM3BCTRLAKD","short_pith_number":"pith:ZZDXSSOG","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"},"canonical_sha256":"ce477949c6d7d371af4766c229c56050fea56e963727efe8d9b6270d58e1b184","source":{"kind":"arxiv","id":"1912.00275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.00275","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1912.00275v1","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00275","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZZDXSSOG27JX","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZZDXSSOG27JXDL2H","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZZDXSSOG","created_at":"2026-07-05T00:23:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZZDXSSOG27JXDL2HM3BCTRLAKD","target":"record","payload":{"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"},"canonical_sha256":"ce477949c6d7d371af4766c229c56050fea56e963727efe8d9b6270d58e1b184","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"},"source_kind":"arxiv","source_id":"1912.00275","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-05T00:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5WDYrBBDN6eR3+1Qcb6ERQ5jMu9v/DD/o5wQS+oWhPVQfseSqAPUXTSGFdxRz5ZyzmyxV8AqHrBiqpV1AYDkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:26:46.518623Z"},"content_sha256":"23a982bc8c3172b1c93a02e33ee8008eb8dc250357ef849232e01356371e85a5","schema_version":"1.0","event_id":"sha256:23a982bc8c3172b1c93a02e33ee8008eb8dc250357ef849232e01356371e85a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZZDXSSOG27JXDL2HM3BCTRLAKD","target":"graph","payload":{"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"},"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-05T00:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIgRd3fDBJYxgMKMLb4Av9MhpKkHN26HeC7KAYBMyq2c6Oi64RHnrOrrjunsJRFgnllav5N3e19f/X56C1KaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:26:46.519009Z"},"content_sha256":"1dc1cc25f4fa9808952f14b8c24ea76fc3da6fe7892e21937f4a019f2e86f7a9","schema_version":"1.0","event_id":"sha256:1dc1cc25f4fa9808952f14b8c24ea76fc3da6fe7892e21937f4a019f2e86f7a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/bundle.json","state_url":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/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-07T13:26:46Z","links":{"resolver":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD","bundle":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/bundle.json","state":"https://pith.science/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZDXSSOG27JXDL2HM3BCTRLAKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZZDXSSOG27JXDL2HM3BCTRLAKD","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":"5fc77c192466e8e1afa81a3dabee4c662b0902280fd3cc6294d26a4ff66ba548","cross_cats_sorted":["math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-30T22:33:08Z","title_canon_sha256":"e275dda10caa337bdba59339520d3ea50cdee890e371f28c4fa400ab882793b7"},"schema_version":"1.0","source":{"id":"1912.00275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.00275","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1912.00275v1","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00275","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZZDXSSOG27JX","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZZDXSSOG27JXDL2H","created_at":"2026-07-05T00:23:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZZDXSSOG","created_at":"2026-07-05T00:23:11Z"}],"graph_snapshots":[{"event_id":"sha256:1dc1cc25f4fa9808952f14b8c24ea76fc3da6fe7892e21937f4a019f2e86f7a9","target":"graph","created_at":"2026-07-05T00:23:11Z","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/1912.00275/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amy N. Langville, Heather C. Smith, Thomas R. Cameron","cross_cats":["math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-30T22:33:08Z","title":"On the Graph Laplacian and the Rankability of Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00275","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:23a982bc8c3172b1c93a02e33ee8008eb8dc250357ef849232e01356371e85a5","target":"record","created_at":"2026-07-05T00:23:11Z","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":"5fc77c192466e8e1afa81a3dabee4c662b0902280fd3cc6294d26a4ff66ba548","cross_cats_sorted":["math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-30T22:33:08Z","title_canon_sha256":"e275dda10caa337bdba59339520d3ea50cdee890e371f28c4fa400ab882793b7"},"schema_version":"1.0","source":{"id":"1912.00275","kind":"arxiv","version":1}},"canonical_sha256":"ce477949c6d7d371af4766c229c56050fea56e963727efe8d9b6270d58e1b184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce477949c6d7d371af4766c229c56050fea56e963727efe8d9b6270d58e1b184","first_computed_at":"2026-07-05T00:23:11.565013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:23:11.565013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MJ2U91QZ091CltWloZT+shffGKD9HGCbRCFxbvny5SZp/1iLun25bZrnQgXoYZ21d8o+gKTmlO/8SNkhu05oCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:23:11.565362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.00275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23a982bc8c3172b1c93a02e33ee8008eb8dc250357ef849232e01356371e85a5","sha256:1dc1cc25f4fa9808952f14b8c24ea76fc3da6fe7892e21937f4a019f2e86f7a9"],"state_sha256":"4ff097d7494f541860f9ee70b829c004e2f805e28dbe5e2228833d44d42e0e68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4SEnEViejzJ0QpPbNRy+aSosKClBV4ObvXdI/xUWxkYBKhSRhzuqPzKyiJjtorWLqbKB7Ybn2z2EP+eVArlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:26:46.520867Z","bundle_sha256":"2dec71461aee033e4bbb5bf14dc9a8f785af1294ac7584c85931a5b8d121d2c4"}}