{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:G4QDBCX47VW6RTX4EPK2HC3QLK","short_pith_number":"pith:G4QDBCX4","schema_version":"1.0","canonical_sha256":"3720308afcfd6de8cefc23d5a38b705abea0aee9a2b8c3384dadc8cf384f7e3c","source":{"kind":"arxiv","id":"2005.00804","version":3},"attestation_state":"computed","paper":{"title":"Knowledge Base Completion: Baseline strikes back (Again)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mausam, Prachi Jain, Soumen Chakrabarti, Sushant Rathi","submitted_at":"2020-05-02T11:53:22Z","abstract_excerpt":"Knowledge Base Completion (KBC) has been a very active area lately. Several recent KBCpapers propose architectural changes, new training methods, or even new formulations. KBC systems are usually evaluated on standard benchmark datasets: FB15k, FB15k-237, WN18, WN18RR, and Yago3-10. Most existing methods train with a small number of negative samples for each positive instance in these datasets to save computational costs. This paper discusses how recent developments allow us to use all available negative samples for training. We show that Complex, when trained using all available negative samp"},"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":"2005.00804","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-02T11:53:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1a80982dea4088a824d920ea52d810ad511ec957e668baf49cfb0177be91f2f2","abstract_canon_sha256":"9cdcee8fe76a304a6db92272a3c1cd68bab338e0523473d000266e8ecf11431c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:42:52.975543Z","signature_b64":"GeZZFcTtC5ciKLc1Hy+sFsMRIBAKSmyXNBHLjjtO/tVCkJ4M1oJQdU+BJ6m3XGd2LvO06AXTxSHaZRlMvcjYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3720308afcfd6de8cefc23d5a38b705abea0aee9a2b8c3384dadc8cf384f7e3c","last_reissued_at":"2026-07-05T04:42:52.975142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:42:52.975142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge Base Completion: Baseline strikes back (Again)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mausam, Prachi Jain, Soumen Chakrabarti, Sushant Rathi","submitted_at":"2020-05-02T11:53:22Z","abstract_excerpt":"Knowledge Base Completion (KBC) has been a very active area lately. Several recent KBCpapers propose architectural changes, new training methods, or even new formulations. KBC systems are usually evaluated on standard benchmark datasets: FB15k, FB15k-237, WN18, WN18RR, and Yago3-10. Most existing methods train with a small number of negative samples for each positive instance in these datasets to save computational costs. This paper discusses how recent developments allow us to use all available negative samples for training. We show that Complex, when trained using all available negative samp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.00804","kind":"arxiv","version":3},"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/2005.00804/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":"2005.00804","created_at":"2026-07-05T04:42:52.975194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.00804v3","created_at":"2026-07-05T04:42:52.975194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.00804","created_at":"2026-07-05T04:42:52.975194+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4QDBCX47VW6","created_at":"2026-07-05T04:42:52.975194+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4QDBCX47VW6RTX4","created_at":"2026-07-05T04:42:52.975194+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4QDBCX4","created_at":"2026-07-05T04:42:52.975194+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14801","citing_title":"Extending TWIG: Zero-Shot Predictive Hyperparameter Selection for KGEs based on Graph Structure","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK","json":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK.json","graph_json":"https://pith.science/api/pith-number/G4QDBCX47VW6RTX4EPK2HC3QLK/graph.json","events_json":"https://pith.science/api/pith-number/G4QDBCX47VW6RTX4EPK2HC3QLK/events.json","paper":"https://pith.science/paper/G4QDBCX4"},"agent_actions":{"view_html":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK","download_json":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK.json","view_paper":"https://pith.science/paper/G4QDBCX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.00804&json=true","fetch_graph":"https://pith.science/api/pith-number/G4QDBCX47VW6RTX4EPK2HC3QLK/graph.json","fetch_events":"https://pith.science/api/pith-number/G4QDBCX47VW6RTX4EPK2HC3QLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK/action/storage_attestation","attest_author":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK/action/author_attestation","sign_citation":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK/action/citation_signature","submit_replication":"https://pith.science/pith/G4QDBCX47VW6RTX4EPK2HC3QLK/action/replication_record"}},"created_at":"2026-07-05T04:42:52.975194+00:00","updated_at":"2026-07-05T04:42:52.975194+00:00"}