{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:33GGZF33HHD73IDLG5W35TT3JE","short_pith_number":"pith:33GGZF33","schema_version":"1.0","canonical_sha256":"decc6c977b39c7fda06b376dbece7b491d4bdea8da4e87f6f058a2905028f7ea","source":{"kind":"arxiv","id":"1909.00230","version":1},"attestation_state":"computed","paper":{"title":"Collaborative Policy Learning for Open Knowledge Graph Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Cong Fu, Meng Qu, Tong Chen, Woojeong Jin, Xiang Ren","submitted_at":"2019-08-31T15:46:05Z","abstract_excerpt":"In recent years, there has been a surge of interests in interpretable graph reasoning methods. However, these models often suffer from limited performance when working on sparse and incomplete graphs, due to the lack of evidential paths that can reach target entities. Here we study open knowledge graph reasoning---a task that aims to reason for missing facts over a graph augmented by a background text corpus. A key challenge of the task is to filter out \"irrelevant\" facts extracted from corpus, in order to maintain an effective search space during path inference. We propose a novel reinforceme"},"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":"1909.00230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-08-31T15:46:05Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"0c70b74867b97c4ea03a63ec914a0f926b02f30a46612d8d3a6853dec611f319","abstract_canon_sha256":"86002a9b4e67b3afb5fe86c11c385df3f4b894a30506fb767bb6d9364dd75c32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:19.302792Z","signature_b64":"ScWVF15Yvx9eQb10vJrW0vGSxGM0yjJ4c0S5fklvRdVh54l+fu5Vcs4Pus/6mZi/6sq4SwHH6yvvIm92NY50Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"decc6c977b39c7fda06b376dbece7b491d4bdea8da4e87f6f058a2905028f7ea","last_reissued_at":"2026-07-05T00:04:19.302331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:19.302331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collaborative Policy Learning for Open Knowledge Graph Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Cong Fu, Meng Qu, Tong Chen, Woojeong Jin, Xiang Ren","submitted_at":"2019-08-31T15:46:05Z","abstract_excerpt":"In recent years, there has been a surge of interests in interpretable graph reasoning methods. However, these models often suffer from limited performance when working on sparse and incomplete graphs, due to the lack of evidential paths that can reach target entities. Here we study open knowledge graph reasoning---a task that aims to reason for missing facts over a graph augmented by a background text corpus. A key challenge of the task is to filter out \"irrelevant\" facts extracted from corpus, in order to maintain an effective search space during path inference. We propose a novel reinforceme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00230","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/1909.00230/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":"1909.00230","created_at":"2026-07-05T00:04:19.302382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.00230v1","created_at":"2026-07-05T00:04:19.302382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00230","created_at":"2026-07-05T00:04:19.302382+00:00"},{"alias_kind":"pith_short_12","alias_value":"33GGZF33HHD7","created_at":"2026-07-05T00:04:19.302382+00:00"},{"alias_kind":"pith_short_16","alias_value":"33GGZF33HHD73IDL","created_at":"2026-07-05T00:04:19.302382+00:00"},{"alias_kind":"pith_short_8","alias_value":"33GGZF33","created_at":"2026-07-05T00:04:19.302382+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.04118","citing_title":"AgREE: Agentic Reasoning for Knowledge Graph Completion on Emerging Entities","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE","json":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE.json","graph_json":"https://pith.science/api/pith-number/33GGZF33HHD73IDLG5W35TT3JE/graph.json","events_json":"https://pith.science/api/pith-number/33GGZF33HHD73IDLG5W35TT3JE/events.json","paper":"https://pith.science/paper/33GGZF33"},"agent_actions":{"view_html":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE","download_json":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE.json","view_paper":"https://pith.science/paper/33GGZF33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.00230&json=true","fetch_graph":"https://pith.science/api/pith-number/33GGZF33HHD73IDLG5W35TT3JE/graph.json","fetch_events":"https://pith.science/api/pith-number/33GGZF33HHD73IDLG5W35TT3JE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE/action/storage_attestation","attest_author":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE/action/author_attestation","sign_citation":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE/action/citation_signature","submit_replication":"https://pith.science/pith/33GGZF33HHD73IDLG5W35TT3JE/action/replication_record"}},"created_at":"2026-07-05T00:04:19.302382+00:00","updated_at":"2026-07-05T00:04:19.302382+00:00"}