{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:H24O4RUC25INJIIO6HDGYZCIBQ","short_pith_number":"pith:H24O4RUC","canonical_record":{"source":{"id":"2503.16755","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-21T00:13:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"57d8808370f36b2d080978e8c0b4e0ee99b196dcf2e83539466c796cd2f06b2c","abstract_canon_sha256":"a7c9296617f8458d9195df804d062a2589a043407ea1352fcd41291ec818ce8a"},"schema_version":"1.0"},"canonical_sha256":"3eb8ee4682d750d4a10ef1c66c64480c1858c31fbe5b2e1e5737496e52c61a61","source":{"kind":"arxiv","id":"2503.16755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.16755","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"arxiv_version","alias_value":"2503.16755v2","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.16755","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"pith_short_12","alias_value":"H24O4RUC25IN","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"H24O4RUC25INJIIO","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"H24O4RUC","created_at":"2026-07-05T11:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:H24O4RUC25INJIIO6HDGYZCIBQ","target":"record","payload":{"canonical_record":{"source":{"id":"2503.16755","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-21T00:13:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"57d8808370f36b2d080978e8c0b4e0ee99b196dcf2e83539466c796cd2f06b2c","abstract_canon_sha256":"a7c9296617f8458d9195df804d062a2589a043407ea1352fcd41291ec818ce8a"},"schema_version":"1.0"},"canonical_sha256":"3eb8ee4682d750d4a10ef1c66c64480c1858c31fbe5b2e1e5737496e52c61a61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:04.404510Z","signature_b64":"Lg76B1hOXC++yLr1Q19gngBK+/etUrG+BaVRub4tgRkt5l7/Ykdwq/4MaF7NbLbp24t4FAn0bNORh4nihXWTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eb8ee4682d750d4a10ef1c66c64480c1858c31fbe5b2e1e5737496e52c61a61","last_reissued_at":"2026-07-05T11:33:04.404029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:04.404029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.16755","source_version":2,"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-05T11:33:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMsDF6dib27k0aL8mgYlNwx+UQI1uNcK8AbwU/bj100f6R0sAHV0N2+B6Ro33QLjcJ0cpoUw7c0mvEraE7vfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T00:33:58.283142Z"},"content_sha256":"32f91ec772ccb2d6a9be94ab0ed645d8e436a08ebb0aef5e3148bd63c5bb9d36","schema_version":"1.0","event_id":"sha256:32f91ec772ccb2d6a9be94ab0ed645d8e436a08ebb0aef5e3148bd63c5bb9d36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:H24O4RUC25INJIIO6HDGYZCIBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast online node labeling with graph subsampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ertai Luo, Reza Babenezhad, Yifan Sun, Yushen Huang","submitted_at":"2025-03-21T00:13:16Z","abstract_excerpt":"Large data applications rely on storing data in massive, sparse graphs with millions to trillions of nodes. Graph-based methods, such as node prediction, aim for computational efficiency regardless of graph size. Techniques like localized approximate personalized page rank (APPR) solve sparse linear systems with complexity independent of graph size, but is in terms of the maximum node degree, which can be much larger in practice than the average node degree for real-world large graphs. In this paper, we consider an \\emph{online subsampled APPR method}, where messages are intentionally dropped "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.16755","kind":"arxiv","version":2},"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/2503.16755/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-05T11:33:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufFbXpEsdqAiS3sZ0HwX/29BqkFSOguADe0QwXxwRlRQZKCRH5Xb/VOjqh/ymt0xZEKjbxVskBZn4iZJ5zMaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T00:33:58.283519Z"},"content_sha256":"0c6fa30d4c80b98d60b5a2c5fec8881ed2d15d2b07c80b16db601004df2f8ab0","schema_version":"1.0","event_id":"sha256:0c6fa30d4c80b98d60b5a2c5fec8881ed2d15d2b07c80b16db601004df2f8ab0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H24O4RUC25INJIIO6HDGYZCIBQ/bundle.json","state_url":"https://pith.science/pith/H24O4RUC25INJIIO6HDGYZCIBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H24O4RUC25INJIIO6HDGYZCIBQ/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-20T00:33:58Z","links":{"resolver":"https://pith.science/pith/H24O4RUC25INJIIO6HDGYZCIBQ","bundle":"https://pith.science/pith/H24O4RUC25INJIIO6HDGYZCIBQ/bundle.json","state":"https://pith.science/pith/H24O4RUC25INJIIO6HDGYZCIBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H24O4RUC25INJIIO6HDGYZCIBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:H24O4RUC25INJIIO6HDGYZCIBQ","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":"a7c9296617f8458d9195df804d062a2589a043407ea1352fcd41291ec818ce8a","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-21T00:13:16Z","title_canon_sha256":"57d8808370f36b2d080978e8c0b4e0ee99b196dcf2e83539466c796cd2f06b2c"},"schema_version":"1.0","source":{"id":"2503.16755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.16755","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"arxiv_version","alias_value":"2503.16755v2","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.16755","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"pith_short_12","alias_value":"H24O4RUC25IN","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"H24O4RUC25INJIIO","created_at":"2026-07-05T11:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"H24O4RUC","created_at":"2026-07-05T11:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:0c6fa30d4c80b98d60b5a2c5fec8881ed2d15d2b07c80b16db601004df2f8ab0","target":"graph","created_at":"2026-07-05T11:33:04Z","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/2503.16755/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large data applications rely on storing data in massive, sparse graphs with millions to trillions of nodes. Graph-based methods, such as node prediction, aim for computational efficiency regardless of graph size. Techniques like localized approximate personalized page rank (APPR) solve sparse linear systems with complexity independent of graph size, but is in terms of the maximum node degree, which can be much larger in practice than the average node degree for real-world large graphs. In this paper, we consider an \\emph{online subsampled APPR method}, where messages are intentionally dropped ","authors_text":"Ertai Luo, Reza Babenezhad, Yifan Sun, Yushen Huang","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-21T00:13:16Z","title":"Fast online node labeling with graph subsampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.16755","kind":"arxiv","version":2},"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:32f91ec772ccb2d6a9be94ab0ed645d8e436a08ebb0aef5e3148bd63c5bb9d36","target":"record","created_at":"2026-07-05T11:33:04Z","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":"a7c9296617f8458d9195df804d062a2589a043407ea1352fcd41291ec818ce8a","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-21T00:13:16Z","title_canon_sha256":"57d8808370f36b2d080978e8c0b4e0ee99b196dcf2e83539466c796cd2f06b2c"},"schema_version":"1.0","source":{"id":"2503.16755","kind":"arxiv","version":2}},"canonical_sha256":"3eb8ee4682d750d4a10ef1c66c64480c1858c31fbe5b2e1e5737496e52c61a61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3eb8ee4682d750d4a10ef1c66c64480c1858c31fbe5b2e1e5737496e52c61a61","first_computed_at":"2026-07-05T11:33:04.404029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:04.404029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lg76B1hOXC++yLr1Q19gngBK+/etUrG+BaVRub4tgRkt5l7/Ykdwq/4MaF7NbLbp24t4FAn0bNORh4nihXWTCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:04.404510Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.16755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32f91ec772ccb2d6a9be94ab0ed645d8e436a08ebb0aef5e3148bd63c5bb9d36","sha256:0c6fa30d4c80b98d60b5a2c5fec8881ed2d15d2b07c80b16db601004df2f8ab0"],"state_sha256":"1c9c5d647d6143107a7eeecebe7e8473cfae3973a4bbfc49bb47941c3d4c5bb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oK1rwupyu6Re84ODHo7gJ+Ou+5mFIOsRkpE7DJjYZljwAJPWOYXJ3nVFJpqLYRSTmF1A9z4a/K3ywiQvouUBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-20T00:33:58.285674Z","bundle_sha256":"6e0b8452be86fc2964f6652c93c1f1ea34916549bc6aa87140a68535e0eb8360"}}