{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MAIGHXRXAMWL35APTWIQSPZZOJ","short_pith_number":"pith:MAIGHXRX","schema_version":"1.0","canonical_sha256":"601063de37032cbdf40f9d91093f39725408944a8ec09cf357c36cbf36bcc03e","source":{"kind":"arxiv","id":"2106.06666","version":3},"attestation_state":"computed","paper":{"title":"Learnable Hypergraph Laplacian for Hypergraph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiying Zhang, Runiu Lu, Shu-Tao Xia, Xi Xiao, Yuzhao Chen","submitted_at":"2021-06-12T02:07:07Z","abstract_excerpt":"Hypergraph Convolutional Neural Networks (HGCNNs) have demonstrated their potential in modeling high-order relations preserved in graph-structured data. However, most existing convolution filters are localized and determined by the pre-defined initial hypergraph topology, neglecting to explore implicit and long-range relations in real-world data. In this paper, we propose the first learning-based method tailored for constructing adaptive hypergraph structure, termed HypERgrAph Laplacian aDaptor (HERALD), which serves as a generic plug-and-play module for improving the representational power of"},"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":"2106.06666","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-12T02:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"483dc5ab927f746d142a533d583d66fab178830ba53a4d4fb1a530fd4665b513","abstract_canon_sha256":"07ed6bdd7286daa01f046c0d2c4878961e1f3ecd56e99e9a0fe76a0173e5e41c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:14:37.668096Z","signature_b64":"YnyWHw9cEADgWEZ82pJeiSV5UYYnc18bNnO91iOz7tJkL8oa8KdeJDX7AHfgR6dlFF40JM8IbfRyvGLtaaxgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"601063de37032cbdf40f9d91093f39725408944a8ec09cf357c36cbf36bcc03e","last_reissued_at":"2026-07-05T04:14:37.667728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:14:37.667728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learnable Hypergraph Laplacian for Hypergraph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiying Zhang, Runiu Lu, Shu-Tao Xia, Xi Xiao, Yuzhao Chen","submitted_at":"2021-06-12T02:07:07Z","abstract_excerpt":"Hypergraph Convolutional Neural Networks (HGCNNs) have demonstrated their potential in modeling high-order relations preserved in graph-structured data. However, most existing convolution filters are localized and determined by the pre-defined initial hypergraph topology, neglecting to explore implicit and long-range relations in real-world data. In this paper, we propose the first learning-based method tailored for constructing adaptive hypergraph structure, termed HypERgrAph Laplacian aDaptor (HERALD), which serves as a generic plug-and-play module for improving the representational power of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06666","kind":"arxiv","version":3},"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/2106.06666/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":"2106.06666","created_at":"2026-07-05T04:14:37.667788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.06666v3","created_at":"2026-07-05T04:14:37.667788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06666","created_at":"2026-07-05T04:14:37.667788+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAIGHXRXAMWL","created_at":"2026-07-05T04:14:37.667788+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAIGHXRXAMWL35AP","created_at":"2026-07-05T04:14:37.667788+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAIGHXRX","created_at":"2026-07-05T04:14:37.667788+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19227","citing_title":"Multi-view Fake News Detection Model Based on Dynamic Hypergraph","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ","json":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ.json","graph_json":"https://pith.science/api/pith-number/MAIGHXRXAMWL35APTWIQSPZZOJ/graph.json","events_json":"https://pith.science/api/pith-number/MAIGHXRXAMWL35APTWIQSPZZOJ/events.json","paper":"https://pith.science/paper/MAIGHXRX"},"agent_actions":{"view_html":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ","download_json":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ.json","view_paper":"https://pith.science/paper/MAIGHXRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.06666&json=true","fetch_graph":"https://pith.science/api/pith-number/MAIGHXRXAMWL35APTWIQSPZZOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MAIGHXRXAMWL35APTWIQSPZZOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ/action/storage_attestation","attest_author":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ/action/author_attestation","sign_citation":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ/action/citation_signature","submit_replication":"https://pith.science/pith/MAIGHXRXAMWL35APTWIQSPZZOJ/action/replication_record"}},"created_at":"2026-07-05T04:14:37.667788+00:00","updated_at":"2026-07-05T04:14:37.667788+00:00"}