{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CWUBUPP7262V6C5CFFVWUIB27D","short_pith_number":"pith:CWUBUPP7","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"},"canonical_sha256":"15a81a3dffd7b55f0ba2296b6a203af8ee0f824671e378292fa2484e9ded2502","source":{"kind":"arxiv","id":"2501.07731","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07731","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07731v1","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07731","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"CWUBUPP7262V","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"pith_short_16","alias_value":"CWUBUPP7262V6C5C","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"pith_short_8","alias_value":"CWUBUPP7","created_at":"2026-07-05T10:00:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CWUBUPP7262V6C5CFFVWUIB27D","target":"record","payload":{"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"},"canonical_sha256":"15a81a3dffd7b55f0ba2296b6a203af8ee0f824671e378292fa2484e9ded2502","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"},"source_kind":"arxiv","source_id":"2501.07731","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-07-05T10:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdlLbCJ40e5Wzno6WMpX8fEDFQ7viSK90QfIQ3NITQYEneixxxiekSIzAx6cUiHx8i/Qe7+MjyQxJ1DE8h23BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:07:33.587170Z"},"content_sha256":"decd07deb42f9c3d0d4de117a8faf84d4312d375d91d8f1d1b54774aeab5d775","schema_version":"1.0","event_id":"sha256:decd07deb42f9c3d0d4de117a8faf84d4312d375d91d8f1d1b54774aeab5d775"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CWUBUPP7262V6C5CFFVWUIB27D","target":"graph","payload":{"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"},"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-07-05T10:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPUnGXAfujgreJjRF6WfrDloWTrEqGrUY+fIKLYmrueHxlfNaoCq4DX0HQKPVfmvV17Zwc/udUtDXmoFq7m4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:07:33.587561Z"},"content_sha256":"62e72d4319c4b4d905746e3c6fca262944dee3a193da6c2b350ebae8f6609a04","schema_version":"1.0","event_id":"sha256:62e72d4319c4b4d905746e3c6fca262944dee3a193da6c2b350ebae8f6609a04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/bundle.json","state_url":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWUBUPP7262V6C5CFFVWUIB27D/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-07-07T07:07:33Z","links":{"resolver":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D","bundle":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/bundle.json","state":"https://pith.science/pith/CWUBUPP7262V6C5CFFVWUIB27D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWUBUPP7262V6C5CFFVWUIB27D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CWUBUPP7262V6C5CFFVWUIB27D","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":"179c7bcbcdf0b66f5721058977ef0da32378bba9a0cfadb766b4fe706c478f16","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-13T22:46:24Z","title_canon_sha256":"b607013708c7a8153a0538c5aae2008c7c78a55e86564767ca949329366d20cb"},"schema_version":"1.0","source":{"id":"2501.07731","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.07731","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"2501.07731v1","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07731","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"CWUBUPP7262V","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"pith_short_16","alias_value":"CWUBUPP7262V6C5C","created_at":"2026-07-05T10:00:49Z"},{"alias_kind":"pith_short_8","alias_value":"CWUBUPP7","created_at":"2026-07-05T10:00:49Z"}],"graph_snapshots":[{"event_id":"sha256:62e72d4319c4b4d905746e3c6fca262944dee3a193da6c2b350ebae8f6609a04","target":"graph","created_at":"2026-07-05T10:00:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.07731/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Josh Vekhter, Keshav Pingali, Sepideh Maleki","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-13T22:46:24Z","title":"HyperQuery: Beyond Binary Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07731","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:decd07deb42f9c3d0d4de117a8faf84d4312d375d91d8f1d1b54774aeab5d775","target":"record","created_at":"2026-07-05T10:00:49Z","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":"179c7bcbcdf0b66f5721058977ef0da32378bba9a0cfadb766b4fe706c478f16","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-13T22:46:24Z","title_canon_sha256":"b607013708c7a8153a0538c5aae2008c7c78a55e86564767ca949329366d20cb"},"schema_version":"1.0","source":{"id":"2501.07731","kind":"arxiv","version":1}},"canonical_sha256":"15a81a3dffd7b55f0ba2296b6a203af8ee0f824671e378292fa2484e9ded2502","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15a81a3dffd7b55f0ba2296b6a203af8ee0f824671e378292fa2484e9ded2502","first_computed_at":"2026-07-05T10:00:49.158772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:00:49.158772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ia1roGV/Uso7lShnYuoze4rGCysnVzq7dgdArliAsyJvLx/VgJwd8/FaN/8QJElrcq/bvWboJxlpebHCt6gcAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:00:49.159205Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.07731","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:decd07deb42f9c3d0d4de117a8faf84d4312d375d91d8f1d1b54774aeab5d775","sha256:62e72d4319c4b4d905746e3c6fca262944dee3a193da6c2b350ebae8f6609a04"],"state_sha256":"bae71950e8d46a7d04209fb8cecb6965982ab7fc3b8dc778b8bdb3fbd70ac3ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"keNh9M3kSVlKapD9iY7fsxAVL3Axnvx6SSm9+MhmvbXusSvT9dJPHR1bid6U82VLdQl4O9hDL5njEtuMG9qRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:07:33.589508Z","bundle_sha256":"2653027fdff1e789006faca8f383c93c489de928aff3ab4fb9fd0b333b284b58"}}