{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EOI2IRNZWHIYJXOORHZNVFFCX5","short_pith_number":"pith:EOI2IRNZ","schema_version":"1.0","canonical_sha256":"2391a445b9b1d184ddce89f2da94a2bf7d001bcc6b063f9f080890fa1afe18f5","source":{"kind":"arxiv","id":"2105.14629","version":2},"attestation_state":"computed","paper":{"title":"$\\ell_2$-norm Flow Diffusion in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Di Wang, Li Chen, Richard Peng","submitted_at":"2021-05-30T21:27:58Z","abstract_excerpt":"Diffusion is a fundamental graph procedure and has been a basic building block in a wide range of theoretical and empirical applications such as graph partitioning and semi-supervised learning on graphs. In this paper, we study computationally efficient diffusion primitives beyond random walk.\n  We design an $\\widetilde{O}(m)$-time randomized algorithm for the $\\ell_2$-norm flow diffusion problem, a recently proposed diffusion model based on network flow with demonstrated graph clustering related applications both in theory and in practice. Examples include finding locally-biased low conductan"},"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":"2105.14629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-30T21:27:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5be3ca6cb19ce39e57237ed183ddf932f81273e1cf622d37d7e46876c2b28ae5","abstract_canon_sha256":"3f69ac4e40e772412f9d59e8fbd6355141d57bd85983e4dd97b5ac29ef740ff0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:14.293841Z","signature_b64":"6Kx0yf85rGeg46aQG9WjTmHEHBkXjyqqVgotG5XUNIj3rcDztuzWmu3fxIQwCVJfFDTgoV5YhUewq32OqxcWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2391a445b9b1d184ddce89f2da94a2bf7d001bcc6b063f9f080890fa1afe18f5","last_reissued_at":"2026-07-05T02:46:14.293396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:14.293396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\ell_2$-norm Flow Diffusion in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Di Wang, Li Chen, Richard Peng","submitted_at":"2021-05-30T21:27:58Z","abstract_excerpt":"Diffusion is a fundamental graph procedure and has been a basic building block in a wide range of theoretical and empirical applications such as graph partitioning and semi-supervised learning on graphs. In this paper, we study computationally efficient diffusion primitives beyond random walk.\n  We design an $\\widetilde{O}(m)$-time randomized algorithm for the $\\ell_2$-norm flow diffusion problem, a recently proposed diffusion model based on network flow with demonstrated graph clustering related applications both in theory and in practice. Examples include finding locally-biased low conductan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.14629","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/2105.14629/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":"2105.14629","created_at":"2026-07-05T02:46:14.293451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.14629v2","created_at":"2026-07-05T02:46:14.293451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.14629","created_at":"2026-07-05T02:46:14.293451+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOI2IRNZWHIY","created_at":"2026-07-05T02:46:14.293451+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOI2IRNZWHIYJXOO","created_at":"2026-07-05T02:46:14.293451+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOI2IRNZ","created_at":"2026-07-05T02:46:14.293451+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/EOI2IRNZWHIYJXOORHZNVFFCX5","json":"https://pith.science/pith/EOI2IRNZWHIYJXOORHZNVFFCX5.json","graph_json":"https://pith.science/api/pith-number/EOI2IRNZWHIYJXOORHZNVFFCX5/graph.json","events_json":"https://pith.science/api/pith-number/EOI2IRNZWHIYJXOORHZNVFFCX5/events.json","paper":"https://pith.science/paper/EOI2IRNZ"},"agent_actions":{"view_html":"https://pith.science/pith/EOI2IRNZWHIYJXOORHZNVFFCX5","download_json":"https://pith.science/pith/EOI2IRNZWHIYJXOORHZNVFFCX5.json","view_paper":"https://pith.science/paper/EOI2IRNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.14629&json=true","fetch_graph":"https://pith.science/api/pith-number/EOI2IRNZWHIYJXOORHZNVFFCX5/graph.json","fetch_events":"https://pith.science/api/pith-number/EOI2IRNZWHIYJXOORHZNVFFCX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOI2IRNZWHIYJXOORHZNVFFCX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOI2IRNZWHIYJXOORHZNVFFCX5/action/storage_attestation","attest_author":"https://pith.science/pith/EOI2IRNZWHIYJXOORHZNVFFCX5/action/author_attestation","sign_citation":"https://pith.science/pith/EOI2IRNZWHIYJXOORHZNVFFCX5/action/citation_signature","submit_replication":"https://pith.science/pith/EOI2IRNZWHIYJXOORHZNVFFCX5/action/replication_record"}},"created_at":"2026-07-05T02:46:14.293451+00:00","updated_at":"2026-07-05T02:46:14.293451+00:00"}