{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RTSHXHVGWHQ4TZE7J33DSS5ROU","short_pith_number":"pith:RTSHXHVG","schema_version":"1.0","canonical_sha256":"8ce47b9ea6b1e1c9e49f4ef6394bb1750c8a6e5b10a89c8525800917d4ddfd28","source":{"kind":"arxiv","id":"2102.09557","version":1},"attestation_state":"computed","paper":{"title":"Knowledge Hypergraph Embedding Meets Relational Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bahare Fatemi, David Poole, David Vazquez, Perouz Taslakian","submitted_at":"2021-02-18T18:57:44Z","abstract_excerpt":"Embedding-based methods for reasoning in knowledge hypergraphs learn a representation for each entity and relation. Current methods do not capture the procedural rules underlying the relations in the graph. We propose a simple embedding-based model called ReAlE that performs link prediction in knowledge hypergraphs (generalized knowledge graphs) and can represent high-level abstractions in terms of relational algebra operations. We show theoretically that ReAlE is fully expressive and provide proofs and empirical evidence that it can represent a large subset of the primitive relational algebra"},"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":"2102.09557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-18T18:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"85c84ff61b391d4462b269f3f7200cdb88d2fc048127e24dd6b0be2c3752428b","abstract_canon_sha256":"9ad43f54632332ee87446bf55c65552e06c3cf5bdd7db3bc9dcd3d122f3bf34e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:24.072006Z","signature_b64":"KM85JeORWlHaurtYyA7wbDwlTV/PgbUkr9sXhDsL1WS7l7VpwOvb2GuRs883Cahq3A6JVbnGSnNHKntiYPIlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ce47b9ea6b1e1c9e49f4ef6394bb1750c8a6e5b10a89c8525800917d4ddfd28","last_reissued_at":"2026-07-05T02:16:24.071567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:24.071567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge Hypergraph Embedding Meets Relational Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bahare Fatemi, David Poole, David Vazquez, Perouz Taslakian","submitted_at":"2021-02-18T18:57:44Z","abstract_excerpt":"Embedding-based methods for reasoning in knowledge hypergraphs learn a representation for each entity and relation. Current methods do not capture the procedural rules underlying the relations in the graph. We propose a simple embedding-based model called ReAlE that performs link prediction in knowledge hypergraphs (generalized knowledge graphs) and can represent high-level abstractions in terms of relational algebra operations. We show theoretically that ReAlE is fully expressive and provide proofs and empirical evidence that it can represent a large subset of the primitive relational algebra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.09557","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/2102.09557/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":"2102.09557","created_at":"2026-07-05T02:16:24.071619+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.09557v1","created_at":"2026-07-05T02:16:24.071619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.09557","created_at":"2026-07-05T02:16:24.071619+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTSHXHVGWHQ4","created_at":"2026-07-05T02:16:24.071619+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTSHXHVGWHQ4TZE7","created_at":"2026-07-05T02:16:24.071619+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTSHXHVG","created_at":"2026-07-05T02:16:24.071619+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16537","citing_title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU","json":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU.json","graph_json":"https://pith.science/api/pith-number/RTSHXHVGWHQ4TZE7J33DSS5ROU/graph.json","events_json":"https://pith.science/api/pith-number/RTSHXHVGWHQ4TZE7J33DSS5ROU/events.json","paper":"https://pith.science/paper/RTSHXHVG"},"agent_actions":{"view_html":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU","download_json":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU.json","view_paper":"https://pith.science/paper/RTSHXHVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.09557&json=true","fetch_graph":"https://pith.science/api/pith-number/RTSHXHVGWHQ4TZE7J33DSS5ROU/graph.json","fetch_events":"https://pith.science/api/pith-number/RTSHXHVGWHQ4TZE7J33DSS5ROU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU/action/storage_attestation","attest_author":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU/action/author_attestation","sign_citation":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU/action/citation_signature","submit_replication":"https://pith.science/pith/RTSHXHVGWHQ4TZE7J33DSS5ROU/action/replication_record"}},"created_at":"2026-07-05T02:16:24.071619+00:00","updated_at":"2026-07-05T02:16:24.071619+00:00"}