{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P3IOU2MDBY2STFCQJ6UOSNKMWC","short_pith_number":"pith:P3IOU2MD","schema_version":"1.0","canonical_sha256":"7ed0ea69830e352994504fa8e9354cb09643f8e02019eef724c4e6a20e527a40","source":{"kind":"arxiv","id":"2507.13966","version":2},"attestation_state":"computed","paper":{"title":"Bottom-up Domain-specific Superintelligence: A Reliable Knowledge Graph is What We Need","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bhishma Dedhia, Niraj K. Jha, Yuval Kansal","submitted_at":"2025-07-18T14:30:08Z","abstract_excerpt":"Language models traditionally used for cross-domain generalization have recently demonstrated task-specific reasoning. However, their top-down training approach on general corpora is insufficient for acquiring abstractions needed for deep domain expertise. This may require a bottom-up approach that acquires expertise by learning to compose simple domain concepts into more complex ones. A knowledge graph (KG) provides this compositional structure, where domain primitives are represented as head-relation-tail edges and their paths encode higher-level concepts. We present a task generation pipeli"},"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":"2507.13966","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-07-18T14:30:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7d1023f1224cdb32be26cd5e88a642da398c1c3ed31dc60f495d8b8a13d46b4e","abstract_canon_sha256":"f979d08514076afd4c20b91cdcc06cdcfb524d22f531c576915f043076f218c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:48.603032Z","signature_b64":"HTCBKYO6P/yBbWu2qh418fQQPCgU39oh2IwIGU95F1J7AOMSxxXGyoItd5wqtn1GzZzjxUQSyMqNMtLTYYVICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ed0ea69830e352994504fa8e9354cb09643f8e02019eef724c4e6a20e527a40","last_reissued_at":"2026-07-05T12:02:48.602398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:48.602398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bottom-up Domain-specific Superintelligence: A Reliable Knowledge Graph is What We Need","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bhishma Dedhia, Niraj K. Jha, Yuval Kansal","submitted_at":"2025-07-18T14:30:08Z","abstract_excerpt":"Language models traditionally used for cross-domain generalization have recently demonstrated task-specific reasoning. However, their top-down training approach on general corpora is insufficient for acquiring abstractions needed for deep domain expertise. This may require a bottom-up approach that acquires expertise by learning to compose simple domain concepts into more complex ones. A knowledge graph (KG) provides this compositional structure, where domain primitives are represented as head-relation-tail edges and their paths encode higher-level concepts. We present a task generation pipeli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13966","kind":"arxiv","version":2},"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/2507.13966/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":"2507.13966","created_at":"2026-07-05T12:02:48.602501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13966v2","created_at":"2026-07-05T12:02:48.602501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13966","created_at":"2026-07-05T12:02:48.602501+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3IOU2MDBY2S","created_at":"2026-07-05T12:02:48.602501+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3IOU2MDBY2STFCQ","created_at":"2026-07-05T12:02:48.602501+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3IOU2MD","created_at":"2026-07-05T12:02:48.602501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25183","citing_title":"Knowledge Graph-Driven Expert-Level Reasoning for Neuroscience","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2509.23330","citing_title":"Structured In-context Environment Scaling for Large Language Model Reasoning","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2602.12705","citing_title":"MedXIAOHE: A Comprehensive Recipe for Building Medical MLLMs","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC","json":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC.json","graph_json":"https://pith.science/api/pith-number/P3IOU2MDBY2STFCQJ6UOSNKMWC/graph.json","events_json":"https://pith.science/api/pith-number/P3IOU2MDBY2STFCQJ6UOSNKMWC/events.json","paper":"https://pith.science/paper/P3IOU2MD"},"agent_actions":{"view_html":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC","download_json":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC.json","view_paper":"https://pith.science/paper/P3IOU2MD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13966&json=true","fetch_graph":"https://pith.science/api/pith-number/P3IOU2MDBY2STFCQJ6UOSNKMWC/graph.json","fetch_events":"https://pith.science/api/pith-number/P3IOU2MDBY2STFCQJ6UOSNKMWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC/action/storage_attestation","attest_author":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC/action/author_attestation","sign_citation":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC/action/citation_signature","submit_replication":"https://pith.science/pith/P3IOU2MDBY2STFCQJ6UOSNKMWC/action/replication_record"}},"created_at":"2026-07-05T12:02:48.602501+00:00","updated_at":"2026-07-05T12:02:48.602501+00:00"}