{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YNCFMM3UHVG6CKXJJVN34YV4JD","short_pith_number":"pith:YNCFMM3U","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"},"canonical_sha256":"c3445633743d4de12ae94d5bbe62bc48fc7fab145abcb6018b1199ad7dfefd4f","source":{"kind":"arxiv","id":"1905.08287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08287","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08287v1","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08287","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"YNCFMM3UHVG6","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YNCFMM3UHVG6CKXJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YNCFMM3U","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YNCFMM3UHVG6CKXJJVN34YV4JD","target":"record","payload":{"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"},"canonical_sha256":"c3445633743d4de12ae94d5bbe62bc48fc7fab145abcb6018b1199ad7dfefd4f","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"},"source_kind":"arxiv","source_id":"1905.08287","source_version":1,"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-05-17T23:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiX84NtcJxkOSvEo+llfGbLZkg0zvnGpT6nA1cKObM004asBWPtlLXpDnv4Vbvj8c3JSJ1CrV8ytPsckurQ9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:54:33.079076Z"},"content_sha256":"fb465566d608851d19b377338cb6b52c58e5d3bb76629ceb97601bea2a9d3d04","schema_version":"1.0","event_id":"sha256:fb465566d608851d19b377338cb6b52c58e5d3bb76629ceb97601bea2a9d3d04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YNCFMM3UHVG6CKXJJVN34YV4JD","target":"graph","payload":{"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"},"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-05-17T23:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t12JHrbuZmd1pxu2GvuJJB82UQtQ6UkwNylvlAXa4YFWrQLpLC5HC0FkXwv/dyBmcrdnqxDggwHPyPFF8y8DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:54:33.079437Z"},"content_sha256":"f2c56c918d8fa5b582d3234cc22767a24e9cfb9f64b904b0e020a140f39ed7cc","schema_version":"1.0","event_id":"sha256:f2c56c918d8fa5b582d3234cc22767a24e9cfb9f64b904b0e020a140f39ed7cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/bundle.json","state_url":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/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-06-02T21:54:33Z","links":{"resolver":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD","bundle":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/bundle.json","state":"https://pith.science/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNCFMM3UHVG6CKXJJVN34YV4JD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YNCFMM3UHVG6CKXJJVN34YV4JD","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":"a9b71cdde60568f5a467db168fc6cea3998b6b2f3d248dcb2872d677a4b45279","cross_cats_sorted":["cs.DM","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T18:32:01Z","title_canon_sha256":"4a6c998d1a62edb1669180d96e3a7b635229d26fea6ed44fb707ecdc663f316e"},"schema_version":"1.0","source":{"id":"1905.08287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08287","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08287v1","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08287","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"YNCFMM3UHVG6","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YNCFMM3UHVG6CKXJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YNCFMM3U","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:f2c56c918d8fa5b582d3234cc22767a24e9cfb9f64b904b0e020a140f39ed7cc","target":"graph","created_at":"2026-05-17T23:45:43Z","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":"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","authors_text":"Benjamin J Raphael, Uthsav Chitra","cross_cats":["cs.DM","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T18:32:01Z","title":"Random Walks on Hypergraphs with Edge-Dependent Vertex Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08287","kind":"arxiv","version":1},"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:fb465566d608851d19b377338cb6b52c58e5d3bb76629ceb97601bea2a9d3d04","target":"record","created_at":"2026-05-17T23:45:43Z","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":"a9b71cdde60568f5a467db168fc6cea3998b6b2f3d248dcb2872d677a4b45279","cross_cats_sorted":["cs.DM","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-20T18:32:01Z","title_canon_sha256":"4a6c998d1a62edb1669180d96e3a7b635229d26fea6ed44fb707ecdc663f316e"},"schema_version":"1.0","source":{"id":"1905.08287","kind":"arxiv","version":1}},"canonical_sha256":"c3445633743d4de12ae94d5bbe62bc48fc7fab145abcb6018b1199ad7dfefd4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3445633743d4de12ae94d5bbe62bc48fc7fab145abcb6018b1199ad7dfefd4f","first_computed_at":"2026-05-17T23:45:43.735929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:43.735929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"50D/inecDB1uzUiTC//JexecMbwGCv1amwfn50F5osEbh82AOx5q1REumLuKrir9qsvj77QtRChpc/lBZL36Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:43.736626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb465566d608851d19b377338cb6b52c58e5d3bb76629ceb97601bea2a9d3d04","sha256:f2c56c918d8fa5b582d3234cc22767a24e9cfb9f64b904b0e020a140f39ed7cc"],"state_sha256":"7b75d908449f1784f8eefb5b723ff87d2e992e6cdca52d0f3a6fe0197ea0ac82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4S3wMOaDmgnajHnNJSJIaX2KKipv+UagE2FNfEonosJzlLIWmP//T/Z8Rtv6aGmfA+L7L6/P29FkSFi9PVcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:54:33.081417Z","bundle_sha256":"fa59043d336c29dc823470f13cfa4b9076ee21051caacbd1eb8a3c3797759e63"}}