{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PIX343ODLEMFPYKL4WTCOBB23R","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":"e893c5e4cf7ad49d64d481b198a5f06de79c798ce5d76586f3dbc15090946663","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-11-08T06:41:43Z","title_canon_sha256":"b466652bcdd0b4dabf1a9a4e7ec454f6e1c7fa280187d4919e5b5fed4477edba"},"schema_version":"1.0","source":{"id":"1011.1716","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1716","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1716v4","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1716","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"PIX343ODLEMF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PIX343ODLEMFPYKL","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PIX343OD","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:6e227c20596738db192209d35598475f09404ef167cec06d071d93d132b8ec9c","target":"graph","created_at":"2026-05-18T04:14:05Z","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"},"paper":{"abstract_excerpt":"Given a set of alternatives to be ranked, and some pairwise comparison data, ranking is a least squares computation on a graph. The vertices are the alternatives, and the edge values comprise the comparison data. The basic idea is very simple and old: come up with values on vertices such that their differences match the given edge data. Since an exact match will usually be impossible, one settles for matching in a least squares sense. This formulation was first described by Leake in 1976 for rankingfootball teams and appears as an example in Professor Gilbert Strang's classic linear algebra te","authors_text":"Anil N. Hirani, Kaushik Kalyanaraman, Seth Watts","cross_cats":["cs.LG","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-11-08T06:41:43Z","title":"Least Squares Ranking on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1716","kind":"arxiv","version":4},"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:2a09c22b97919e181e4d0d3c2cf4c9e32938b6bd1bd0e483d083d50133fd4299","target":"record","created_at":"2026-05-18T04:14:05Z","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":"e893c5e4cf7ad49d64d481b198a5f06de79c798ce5d76586f3dbc15090946663","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-11-08T06:41:43Z","title_canon_sha256":"b466652bcdd0b4dabf1a9a4e7ec454f6e1c7fa280187d4919e5b5fed4477edba"},"schema_version":"1.0","source":{"id":"1011.1716","kind":"arxiv","version":4}},"canonical_sha256":"7a2fbe6dc3591857e14be5a627043adc7988d8b02989d34fe62886e6b68e48a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a2fbe6dc3591857e14be5a627043adc7988d8b02989d34fe62886e6b68e48a0","first_computed_at":"2026-05-18T04:14:05.889836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:05.889836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MiGWRHbKttreQsX6ESG+8vRYflt6cuXKv3Lf/LAmtHTjpu1IXBOoBh9kJgumiDtCuxl+J8C4tj3sX3KfFHm7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:05.890341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1716","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a09c22b97919e181e4d0d3c2cf4c9e32938b6bd1bd0e483d083d50133fd4299","sha256:6e227c20596738db192209d35598475f09404ef167cec06d071d93d132b8ec9c"],"state_sha256":"bfca5a3c32ce8cb91b740492edff2a0c438703b13412a22fd73813ebc87f3c27"}