{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:URKBOV7EJSJOWFUOQAELSXRXAE","short_pith_number":"pith:URKBOV7E","schema_version":"1.0","canonical_sha256":"a4541757e44c92eb168e8008b95e37013718027f3478b8c5321117daeb0775af","source":{"kind":"arxiv","id":"2410.03208","version":2},"attestation_state":"computed","paper":{"title":"SPHINX: Structural Prediction using Hypergraph Inference Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Iulia Duta, Pietro Li\\`o","submitted_at":"2024-10-04T07:49:57Z","abstract_excerpt":"The importance of higher-order relations is widely recognized in a large number of real-world systems. However, annotating them is a tedious and sometimes impossible task. Consequently, current approaches for data modelling either ignore the higher-order interactions altogether or simplify them into pairwise connections. In order to facilitate higher-order processing, even when a hypergraph structure is not available, we introduce Structural Prediction using Hypergraph Inference Network (SPHINX), a model that learns to infer a latent hypergraph structure in an unsupervised way, solely from the"},"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":"2410.03208","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-04T07:49:57Z","cross_cats_sorted":[],"title_canon_sha256":"bbac443c8734b719cb1c05c691a35a232ffef4751c10ae106b925768bfb8a982","abstract_canon_sha256":"303808ab750f3bcf0da780bf70614b0dd82987386753e41212ee079b3781f41c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:03.836044Z","signature_b64":"uyBeTS89JTp48FqOu3S8YV2MMme98lqfYNnD24IOQyVDqXlT3IcxA8QEd6vyCM3D36m9vNyIVq3nZnsV/iXIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4541757e44c92eb168e8008b95e37013718027f3478b8c5321117daeb0775af","last_reissued_at":"2026-07-05T11:16:03.835516Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:03.835516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPHINX: Structural Prediction using Hypergraph Inference Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Iulia Duta, Pietro Li\\`o","submitted_at":"2024-10-04T07:49:57Z","abstract_excerpt":"The importance of higher-order relations is widely recognized in a large number of real-world systems. However, annotating them is a tedious and sometimes impossible task. Consequently, current approaches for data modelling either ignore the higher-order interactions altogether or simplify them into pairwise connections. In order to facilitate higher-order processing, even when a hypergraph structure is not available, we introduce Structural Prediction using Hypergraph Inference Network (SPHINX), a model that learns to infer a latent hypergraph structure in an unsupervised way, solely from the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03208","kind":"arxiv","version":2},"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/2410.03208/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":"2410.03208","created_at":"2026-07-05T11:16:03.835592+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03208v2","created_at":"2026-07-05T11:16:03.835592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03208","created_at":"2026-07-05T11:16:03.835592+00:00"},{"alias_kind":"pith_short_12","alias_value":"URKBOV7EJSJO","created_at":"2026-07-05T11:16:03.835592+00:00"},{"alias_kind":"pith_short_16","alias_value":"URKBOV7EJSJOWFUO","created_at":"2026-07-05T11:16:03.835592+00:00"},{"alias_kind":"pith_short_8","alias_value":"URKBOV7E","created_at":"2026-07-05T11:16:03.835592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09365","citing_title":"Simple Path Structural Encoding for Graph Transformers","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE","json":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE.json","graph_json":"https://pith.science/api/pith-number/URKBOV7EJSJOWFUOQAELSXRXAE/graph.json","events_json":"https://pith.science/api/pith-number/URKBOV7EJSJOWFUOQAELSXRXAE/events.json","paper":"https://pith.science/paper/URKBOV7E"},"agent_actions":{"view_html":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE","download_json":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE.json","view_paper":"https://pith.science/paper/URKBOV7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03208&json=true","fetch_graph":"https://pith.science/api/pith-number/URKBOV7EJSJOWFUOQAELSXRXAE/graph.json","fetch_events":"https://pith.science/api/pith-number/URKBOV7EJSJOWFUOQAELSXRXAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE/action/storage_attestation","attest_author":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE/action/author_attestation","sign_citation":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE/action/citation_signature","submit_replication":"https://pith.science/pith/URKBOV7EJSJOWFUOQAELSXRXAE/action/replication_record"}},"created_at":"2026-07-05T11:16:03.835592+00:00","updated_at":"2026-07-05T11:16:03.835592+00:00"}