{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UDMM3P4JS3APZKTZHLOMJJCSRR","short_pith_number":"pith:UDMM3P4J","schema_version":"1.0","canonical_sha256":"a0d8cdbf8996c0fcaa793adcc4a4528c460f60244d2194203717b73aa57cb3ca","source":{"kind":"arxiv","id":"2301.08859","version":4},"attestation_state":"computed","paper":{"title":"Logical Message Passing Networks with One-hop Inference on Atomic Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.LG","authors_text":"Ginny Y. Wong, Simon See, Yangqiu Song, Zihao Wang","submitted_at":"2023-01-21T02:34:06Z","abstract_excerpt":"Complex Query Answering (CQA) over Knowledge Graphs (KGs) has attracted a lot of attention to potentially support many applications. Given that KGs are usually incomplete, neural models are proposed to answer the logical queries by parameterizing set operators with complex neural networks. However, such methods usually train neural set operators with a large number of entity and relation embeddings from the zero, where whether and how the embeddings or the neural set operators contribute to the performance remains not clear. In this paper, we propose a simple framework for complex query answer"},"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":"2301.08859","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-21T02:34:06Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9194960625e7c14cefed4dcb6272614da5ba6d0b17588e916c7ae9e8c9e326df","abstract_canon_sha256":"13e94ef4747bb89afc46a176f73522cb5e52ecbaaf9a425854740bbed2c3fa3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:47.687779Z","signature_b64":"DIcaWmAcov8tUIf4mEwit7Wy0KeGtMsl6fhtoLx1OwxwHte8GyYsKj3/Y71+DThk1N5NpuAeXR914KefgIMdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0d8cdbf8996c0fcaa793adcc4a4528c460f60244d2194203717b73aa57cb3ca","last_reissued_at":"2026-07-05T06:44:47.687299Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:47.687299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical Message Passing Networks with One-hop Inference on Atomic Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.LG","authors_text":"Ginny Y. Wong, Simon See, Yangqiu Song, Zihao Wang","submitted_at":"2023-01-21T02:34:06Z","abstract_excerpt":"Complex Query Answering (CQA) over Knowledge Graphs (KGs) has attracted a lot of attention to potentially support many applications. Given that KGs are usually incomplete, neural models are proposed to answer the logical queries by parameterizing set operators with complex neural networks. However, such methods usually train neural set operators with a large number of entity and relation embeddings from the zero, where whether and how the embeddings or the neural set operators contribute to the performance remains not clear. In this paper, we propose a simple framework for complex query answer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08859","kind":"arxiv","version":4},"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/2301.08859/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":"2301.08859","created_at":"2026-07-05T06:44:47.687374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.08859v4","created_at":"2026-07-05T06:44:47.687374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08859","created_at":"2026-07-05T06:44:47.687374+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDMM3P4JS3AP","created_at":"2026-07-05T06:44:47.687374+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDMM3P4JS3APZKTZ","created_at":"2026-07-05T06:44:47.687374+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDMM3P4J","created_at":"2026-07-05T06:44:47.687374+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14224","citing_title":"Top Ten Challenges Towards Agentic Neural Graph Databases","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR","json":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR.json","graph_json":"https://pith.science/api/pith-number/UDMM3P4JS3APZKTZHLOMJJCSRR/graph.json","events_json":"https://pith.science/api/pith-number/UDMM3P4JS3APZKTZHLOMJJCSRR/events.json","paper":"https://pith.science/paper/UDMM3P4J"},"agent_actions":{"view_html":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR","download_json":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR.json","view_paper":"https://pith.science/paper/UDMM3P4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.08859&json=true","fetch_graph":"https://pith.science/api/pith-number/UDMM3P4JS3APZKTZHLOMJJCSRR/graph.json","fetch_events":"https://pith.science/api/pith-number/UDMM3P4JS3APZKTZHLOMJJCSRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR/action/storage_attestation","attest_author":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR/action/author_attestation","sign_citation":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR/action/citation_signature","submit_replication":"https://pith.science/pith/UDMM3P4JS3APZKTZHLOMJJCSRR/action/replication_record"}},"created_at":"2026-07-05T06:44:47.687374+00:00","updated_at":"2026-07-05T06:44:47.687374+00:00"}