{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WAWGMKD227ZP2BZNR3SMJV2WIW","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":"5a8c308c06f5cba3fbe1020d2095f1e17981164e12cb66674e104db833ad5906","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2020-01-24T12:56:09Z","title_canon_sha256":"8371ea87e5e9d954eefadf7acf2cd612f506db1c80d2f7029599acec1d73edc4"},"schema_version":"1.0","source":{"id":"2001.08973","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.08973","created_at":"2026-07-05T02:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"2001.08973v3","created_at":"2026-07-05T02:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.08973","created_at":"2026-07-05T02:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"WAWGMKD227ZP","created_at":"2026-07-05T02:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"WAWGMKD227ZP2BZN","created_at":"2026-07-05T02:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"WAWGMKD2","created_at":"2026-07-05T02:05:38Z"}],"graph_snapshots":[{"event_id":"sha256:dabad8ba06d5524db7597f5d0fc0419ab9370883e2f0c160e758f44552b332a3","target":"graph","created_at":"2026-07-05T02:05:38Z","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/2001.08973/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semi-supervised and unsupervised machine learning methods often rely on graphs to model data, prompting research on how theoretical properties of operators on graphs are leveraged in learning problems. While most of the existing literature focuses on undirected graphs, directed graphs are very important in practice, giving models for physical, biological, or transportation networks, among many other applications. In this paper, we propose a new framework for rigorously studying continuum limits of learning algorithms on directed graphs. We use the new framework to study the PageRank algorithm,","authors_text":"Amber Yuan, Braxton Osting, Jeff Calder","cross_cats":["cs.LG","cs.NA","math.NA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2020-01-24T12:56:09Z","title":"A continuum limit for the PageRank algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.08973","kind":"arxiv","version":3},"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:fdb1bd7a4b5dd17251a6df88c45a66035616b616bf3750e8154d701933cc36c3","target":"record","created_at":"2026-07-05T02:05:38Z","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":"5a8c308c06f5cba3fbe1020d2095f1e17981164e12cb66674e104db833ad5906","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2020-01-24T12:56:09Z","title_canon_sha256":"8371ea87e5e9d954eefadf7acf2cd612f506db1c80d2f7029599acec1d73edc4"},"schema_version":"1.0","source":{"id":"2001.08973","kind":"arxiv","version":3}},"canonical_sha256":"b02c66287ad7f2fd072d8ee4c4d75645bfb38ffd21f6dda350d00c73c6d40644","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b02c66287ad7f2fd072d8ee4c4d75645bfb38ffd21f6dda350d00c73c6d40644","first_computed_at":"2026-07-05T02:05:38.711527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:05:38.711527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cKAQ+fc4H/svpSCiZNIDV/jxlLH6mrTvWhwJYDQjwqfWoRCDK3xW8LHDs8QwKLCf+4Nd3NT6lYt8zdc7zxdMBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:05:38.711990Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.08973","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdb1bd7a4b5dd17251a6df88c45a66035616b616bf3750e8154d701933cc36c3","sha256:dabad8ba06d5524db7597f5d0fc0419ab9370883e2f0c160e758f44552b332a3"],"state_sha256":"46da50bb4b3820b20bf40a3f2e70457d61346de47ae89e5734fbafdeed27ade9"}