{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YNCFMM3UHVG6CKXJJVN34YV4JD","short_pith_number":"pith:YNCFMM3U","schema_version":"1.0","canonical_sha256":"c3445633743d4de12ae94d5bbe62bc48fc7fab145abcb6018b1199ad7dfefd4f","source":{"kind":"arxiv","id":"1905.08287","version":1},"attestation_state":"computed","paper":{"title":"Random Walks on Hypergraphs with Edge-Dependent Vertex Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin J Raphael, Uthsav Chitra","submitted_at":"2019-05-20T18:32:01Z","abstract_excerpt":"Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random walks to develop a spectral theory for hypergraphs with edge-dependent vertex weights: hypergraphs where every vertex $v$ has a weight $\\gamma_e(v)$ for each incident hyperedge $e$ that describes the contribution of $v$ to the hyperedge $e$. We derive a random walk-based hypergraph Laplacian, and bound the mixing time of random walks on such hypergraphs. More"},"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":"1905.08287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T18:32:01Z","cross_cats_sorted":["cs.DM","cs.SI","stat.ML"],"title_canon_sha256":"4a6c998d1a62edb1669180d96e3a7b635229d26fea6ed44fb707ecdc663f316e","abstract_canon_sha256":"a9b71cdde60568f5a467db168fc6cea3998b6b2f3d248dcb2872d677a4b45279"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:43.736626Z","signature_b64":"50D/inecDB1uzUiTC//JexecMbwGCv1amwfn50F5osEbh82AOx5q1REumLuKrir9qsvj77QtRChpc/lBZL36Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3445633743d4de12ae94d5bbe62bc48fc7fab145abcb6018b1199ad7dfefd4f","last_reissued_at":"2026-05-17T23:45:43.735929Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:43.735929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Walks on Hypergraphs with Edge-Dependent Vertex Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin J Raphael, Uthsav Chitra","submitted_at":"2019-05-20T18:32:01Z","abstract_excerpt":"Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random walks to develop a spectral theory for hypergraphs with edge-dependent vertex weights: hypergraphs where every vertex $v$ has a weight $\\gamma_e(v)$ for each incident hyperedge $e$ that describes the contribution of $v$ to the hyperedge $e$. We derive a random walk-based hypergraph Laplacian, and bound the mixing time of random walks on such hypergraphs. More"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08287","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":""},"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":"1905.08287","created_at":"2026-05-17T23:45:43.736033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08287v1","created_at":"2026-05-17T23:45:43.736033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08287","created_at":"2026-05-17T23:45:43.736033+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNCFMM3UHVG6","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNCFMM3UHVG6CKXJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNCFMM3U","created_at":"2026-05-18T12:33:33.725879+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/YNCFMM3UHVG6CKXJJVN34YV4JD","json":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD.json","graph_json":"https://pith.science/api/pith-number/YNCFMM3UHVG6CKXJJVN34YV4JD/graph.json","events_json":"https://pith.science/api/pith-number/YNCFMM3UHVG6CKXJJVN34YV4JD/events.json","paper":"https://pith.science/paper/YNCFMM3U"},"agent_actions":{"view_html":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD","download_json":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD.json","view_paper":"https://pith.science/paper/YNCFMM3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08287&json=true","fetch_graph":"https://pith.science/api/pith-number/YNCFMM3UHVG6CKXJJVN34YV4JD/graph.json","fetch_events":"https://pith.science/api/pith-number/YNCFMM3UHVG6CKXJJVN34YV4JD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/action/storage_attestation","attest_author":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/action/author_attestation","sign_citation":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/action/citation_signature","submit_replication":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/action/replication_record"}},"created_at":"2026-05-17T23:45:43.736033+00:00","updated_at":"2026-05-17T23:45:43.736033+00:00"}