{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IIL2UD5KIMUETV5KU7NTIHPI5I","short_pith_number":"pith:IIL2UD5K","schema_version":"1.0","canonical_sha256":"4217aa0faa432849d7aaa7db341de8ea1f1ecf5acc191181043d14d840da1399","source":{"kind":"arxiv","id":"2412.17717","version":2},"attestation_state":"computed","paper":{"title":"Fast Causal Discovery by Approximate Kernel-based Generalized Score Functions with Linear Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Haocheng Zhang, Hao Zhang, Jihong Guan, Shuigeng Zhou, Yewei Xia, Yixin Ren","submitted_at":"2024-12-23T16:51:45Z","abstract_excerpt":"Score-based causal discovery methods can effectively identify causal relationships by evaluating candidate graphs and selecting the one with the highest score. One popular class of scores is kernel-based generalized score functions, which can adapt to a wide range of scenarios and work well in practice because they circumvent assumptions about causal mechanisms and data distributions. Despite these advantages, kernel-based generalized score functions pose serious computational challenges in time and space, with a time complexity of $\\mathcal{O}(n^3)$ and a memory complexity of $\\mathcal{O}(n^2"},"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":"2412.17717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-23T16:51:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fa37cae9b55618f8e95a3f614e6e5548af9b18342abee080386767088343c7d8","abstract_canon_sha256":"2352f938b83b01bff4384b8093bc50dcc2ff50cba6a339eda0009719ae14f38a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:39.430106Z","signature_b64":"+1M88hchORvnGIT5fpe/mayThg2+oNT8iRZqeHVTxB4VpXmByPpjY544ii/cKVZpvuVTCLqEqPX2T/XFKHxGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4217aa0faa432849d7aaa7db341de8ea1f1ecf5acc191181043d14d840da1399","last_reissued_at":"2026-07-05T11:17:39.429617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:39.429617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Causal Discovery by Approximate Kernel-based Generalized Score Functions with Linear Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Haocheng Zhang, Hao Zhang, Jihong Guan, Shuigeng Zhou, Yewei Xia, Yixin Ren","submitted_at":"2024-12-23T16:51:45Z","abstract_excerpt":"Score-based causal discovery methods can effectively identify causal relationships by evaluating candidate graphs and selecting the one with the highest score. One popular class of scores is kernel-based generalized score functions, which can adapt to a wide range of scenarios and work well in practice because they circumvent assumptions about causal mechanisms and data distributions. Despite these advantages, kernel-based generalized score functions pose serious computational challenges in time and space, with a time complexity of $\\mathcal{O}(n^3)$ and a memory complexity of $\\mathcal{O}(n^2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17717","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/2412.17717/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":"2412.17717","created_at":"2026-07-05T11:17:39.429676+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17717v2","created_at":"2026-07-05T11:17:39.429676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17717","created_at":"2026-07-05T11:17:39.429676+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIL2UD5KIMUE","created_at":"2026-07-05T11:17:39.429676+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIL2UD5KIMUETV5K","created_at":"2026-07-05T11:17:39.429676+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIL2UD5K","created_at":"2026-07-05T11:17:39.429676+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/IIL2UD5KIMUETV5KU7NTIHPI5I","json":"https://pith.science/pith/IIL2UD5KIMUETV5KU7NTIHPI5I.json","graph_json":"https://pith.science/api/pith-number/IIL2UD5KIMUETV5KU7NTIHPI5I/graph.json","events_json":"https://pith.science/api/pith-number/IIL2UD5KIMUETV5KU7NTIHPI5I/events.json","paper":"https://pith.science/paper/IIL2UD5K"},"agent_actions":{"view_html":"https://pith.science/pith/IIL2UD5KIMUETV5KU7NTIHPI5I","download_json":"https://pith.science/pith/IIL2UD5KIMUETV5KU7NTIHPI5I.json","view_paper":"https://pith.science/paper/IIL2UD5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17717&json=true","fetch_graph":"https://pith.science/api/pith-number/IIL2UD5KIMUETV5KU7NTIHPI5I/graph.json","fetch_events":"https://pith.science/api/pith-number/IIL2UD5KIMUETV5KU7NTIHPI5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIL2UD5KIMUETV5KU7NTIHPI5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIL2UD5KIMUETV5KU7NTIHPI5I/action/storage_attestation","attest_author":"https://pith.science/pith/IIL2UD5KIMUETV5KU7NTIHPI5I/action/author_attestation","sign_citation":"https://pith.science/pith/IIL2UD5KIMUETV5KU7NTIHPI5I/action/citation_signature","submit_replication":"https://pith.science/pith/IIL2UD5KIMUETV5KU7NTIHPI5I/action/replication_record"}},"created_at":"2026-07-05T11:17:39.429676+00:00","updated_at":"2026-07-05T11:17:39.429676+00:00"}