{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4BSOL6L43FMOOJYH72IHOG22MV","short_pith_number":"pith:4BSOL6L4","schema_version":"1.0","canonical_sha256":"e064e5f97cd958e72707fe90771b5a655330c91017d408a1ddfd261a4f178686","source":{"kind":"arxiv","id":"1810.03235","version":1},"attestation_state":"computed","paper":{"title":"Entity-Relationship Search over the Web","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Carlos Soares, Eduarda Mendes Rodrigues, Natasa Milic-Frayling, Pedro Saleiro","submitted_at":"2018-10-08T00:35:55Z","abstract_excerpt":"Entity-Relationship (E-R) Search is a complex case of Entity Search where the goal is to search for multiple unknown entities and relationships connecting them. We assume that a E-R query can be decomposed as a sequence of sub-queries each containing keywords related to a specific entity or relationship. We adopt a probabilistic formulation of the E-R search problem. When creating specific representations for entities (e.g. context terms) and for pairs of entities (i.e. relationships) it is possible to create a graph of probabilistic dependencies between sub-queries and entity plus relationshi"},"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":"1810.03235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-10-08T00:35:55Z","cross_cats_sorted":[],"title_canon_sha256":"9b23dfc41dcb392131295e6981955b8cad2e58279c536ea9da8f42ae6e6a3f08","abstract_canon_sha256":"5d40d42fad06bcac6d5c03f59ced8fbc740e3ee1f2ede71fea4b83e74c976b38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:54.080994Z","signature_b64":"fqRWfYmFc39R/n6Ex05ixKd5s81jSHDdTyTorI1hfioC4BpfVQhiJceZMsIgSnNe07leVb9O0xBKlcDMuD5cCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e064e5f97cd958e72707fe90771b5a655330c91017d408a1ddfd261a4f178686","last_reissued_at":"2026-05-18T00:03:54.080428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:54.080428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entity-Relationship Search over the Web","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Carlos Soares, Eduarda Mendes Rodrigues, Natasa Milic-Frayling, Pedro Saleiro","submitted_at":"2018-10-08T00:35:55Z","abstract_excerpt":"Entity-Relationship (E-R) Search is a complex case of Entity Search where the goal is to search for multiple unknown entities and relationships connecting them. We assume that a E-R query can be decomposed as a sequence of sub-queries each containing keywords related to a specific entity or relationship. We adopt a probabilistic formulation of the E-R search problem. When creating specific representations for entities (e.g. context terms) and for pairs of entities (i.e. relationships) it is possible to create a graph of probabilistic dependencies between sub-queries and entity plus relationshi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03235","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":""},"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":"1810.03235","created_at":"2026-05-18T00:03:54.080512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03235v1","created_at":"2026-05-18T00:03:54.080512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03235","created_at":"2026-05-18T00:03:54.080512+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BSOL6L43FMO","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BSOL6L43FMOOJYH","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BSOL6L4","created_at":"2026-05-18T12:32:05.422762+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/4BSOL6L43FMOOJYH72IHOG22MV","json":"https://pith.science/pith/4BSOL6L43FMOOJYH72IHOG22MV.json","graph_json":"https://pith.science/api/pith-number/4BSOL6L43FMOOJYH72IHOG22MV/graph.json","events_json":"https://pith.science/api/pith-number/4BSOL6L43FMOOJYH72IHOG22MV/events.json","paper":"https://pith.science/paper/4BSOL6L4"},"agent_actions":{"view_html":"https://pith.science/pith/4BSOL6L43FMOOJYH72IHOG22MV","download_json":"https://pith.science/pith/4BSOL6L43FMOOJYH72IHOG22MV.json","view_paper":"https://pith.science/paper/4BSOL6L4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03235&json=true","fetch_graph":"https://pith.science/api/pith-number/4BSOL6L43FMOOJYH72IHOG22MV/graph.json","fetch_events":"https://pith.science/api/pith-number/4BSOL6L43FMOOJYH72IHOG22MV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BSOL6L43FMOOJYH72IHOG22MV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BSOL6L43FMOOJYH72IHOG22MV/action/storage_attestation","attest_author":"https://pith.science/pith/4BSOL6L43FMOOJYH72IHOG22MV/action/author_attestation","sign_citation":"https://pith.science/pith/4BSOL6L43FMOOJYH72IHOG22MV/action/citation_signature","submit_replication":"https://pith.science/pith/4BSOL6L43FMOOJYH72IHOG22MV/action/replication_record"}},"created_at":"2026-05-18T00:03:54.080512+00:00","updated_at":"2026-05-18T00:03:54.080512+00:00"}