{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CWUBUPP7262V6C5CFFVWUIB27D","short_pith_number":"pith:CWUBUPP7","schema_version":"1.0","canonical_sha256":"15a81a3dffd7b55f0ba2296b6a203af8ee0f824671e378292fa2484e9ded2502","source":{"kind":"arxiv","id":"2501.07731","version":1},"attestation_state":"computed","paper":{"title":"HyperQuery: Beyond Binary Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Josh Vekhter, Keshav Pingali, Sepideh Maleki","submitted_at":"2025-01-13T22:46:24Z","abstract_excerpt":"Groups with complex set intersection relations are a natural way to model a wide array of data, from the formation of social groups to the complex protein interactions which form the basis of biological life. One approach to representing such higher order relationships is as a hypergraph. However, efforts to apply machine learning techniques to hypergraph structured datasets have been limited thus far. In this paper, we address the problem of link prediction in knowledge hypergraphs as well as simple hypergraphs and develop a novel, simple, and effective optimization architecture that addresse"},"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":"2501.07731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-13T22:46:24Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b607013708c7a8153a0538c5aae2008c7c78a55e86564767ca949329366d20cb","abstract_canon_sha256":"179c7bcbcdf0b66f5721058977ef0da32378bba9a0cfadb766b4fe706c478f16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:49.159205Z","signature_b64":"Ia1roGV/Uso7lShnYuoze4rGCysnVzq7dgdArliAsyJvLx/VgJwd8/FaN/8QJElrcq/bvWboJxlpebHCt6gcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15a81a3dffd7b55f0ba2296b6a203af8ee0f824671e378292fa2484e9ded2502","last_reissued_at":"2026-07-05T10:00:49.158772Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:49.158772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HyperQuery: Beyond Binary Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Josh Vekhter, Keshav Pingali, Sepideh Maleki","submitted_at":"2025-01-13T22:46:24Z","abstract_excerpt":"Groups with complex set intersection relations are a natural way to model a wide array of data, from the formation of social groups to the complex protein interactions which form the basis of biological life. One approach to representing such higher order relationships is as a hypergraph. However, efforts to apply machine learning techniques to hypergraph structured datasets have been limited thus far. In this paper, we address the problem of link prediction in knowledge hypergraphs as well as simple hypergraphs and develop a novel, simple, and effective optimization architecture that addresse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07731","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.07731/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":"2501.07731","created_at":"2026-07-05T10:00:49.158829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07731v1","created_at":"2026-07-05T10:00:49.158829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07731","created_at":"2026-07-05T10:00:49.158829+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWUBUPP7262V","created_at":"2026-07-05T10:00:49.158829+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWUBUPP7262V6C5C","created_at":"2026-07-05T10:00:49.158829+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWUBUPP7","created_at":"2026-07-05T10:00:49.158829+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/CWUBUPP7262V6C5CFFVWUIB27D","json":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D.json","graph_json":"https://pith.science/api/pith-number/CWUBUPP7262V6C5CFFVWUIB27D/graph.json","events_json":"https://pith.science/api/pith-number/CWUBUPP7262V6C5CFFVWUIB27D/events.json","paper":"https://pith.science/paper/CWUBUPP7"},"agent_actions":{"view_html":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D","download_json":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D.json","view_paper":"https://pith.science/paper/CWUBUPP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07731&json=true","fetch_graph":"https://pith.science/api/pith-number/CWUBUPP7262V6C5CFFVWUIB27D/graph.json","fetch_events":"https://pith.science/api/pith-number/CWUBUPP7262V6C5CFFVWUIB27D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/action/storage_attestation","attest_author":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/action/author_attestation","sign_citation":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/action/citation_signature","submit_replication":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/action/replication_record"}},"created_at":"2026-07-05T10:00:49.158829+00:00","updated_at":"2026-07-05T10:00:49.158829+00:00"}