{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LAUGMXNRSHZD5JGYIZZEN6HYFL","short_pith_number":"pith:LAUGMXNR","schema_version":"1.0","canonical_sha256":"5828665db191f23ea4d8467246f8f82aeaa43fa6c9fa098e52cdd1d02d3dc1a2","source":{"kind":"arxiv","id":"2507.07898","version":1},"attestation_state":"computed","paper":{"title":"Efficient Causal Discovery for Autoregressive Time Series","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.LG","authors_text":"Achintya Gopal, Mohammad Fesanghary","submitted_at":"2025-07-10T16:27:33Z","abstract_excerpt":"In this study, we present a novel constraint-based algorithm for causal structure learning specifically designed for nonlinear autoregressive time series. Our algorithm significantly reduces computational complexity compared to existing methods, making it more efficient and scalable to larger problems. We rigorously evaluate its performance on synthetic datasets, demonstrating that our algorithm not only outperforms current techniques, but also excels in scenarios with limited data availability. These results highlight its potential for practical applications in fields requiring efficient and "},"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.07898","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-10T16:27:33Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"ccecc4fb554de338e797e8d9d39000faf299647d5b6e3826a6a3c319f74e8921","abstract_canon_sha256":"0ac80686882996bf61b293e701dfc79f0158d9196c3cfc5d08bd429d84631183"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:06.794350Z","signature_b64":"HwmriDWDAv8Sh+Ae1atVmHqdVe7Oa8XCsJt+hE8p1jOzdfYRJ9hsTi4IjJS35FIjTFlRz5gSyOJcUay/R4SHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5828665db191f23ea4d8467246f8f82aeaa43fa6c9fa098e52cdd1d02d3dc1a2","last_reissued_at":"2026-07-05T11:35:06.793800Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:06.793800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Causal Discovery for Autoregressive Time Series","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.LG","authors_text":"Achintya Gopal, Mohammad Fesanghary","submitted_at":"2025-07-10T16:27:33Z","abstract_excerpt":"In this study, we present a novel constraint-based algorithm for causal structure learning specifically designed for nonlinear autoregressive time series. Our algorithm significantly reduces computational complexity compared to existing methods, making it more efficient and scalable to larger problems. We rigorously evaluate its performance on synthetic datasets, demonstrating that our algorithm not only outperforms current techniques, but also excels in scenarios with limited data availability. These results highlight its potential for practical applications in fields requiring efficient and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07898","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/2507.07898/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.07898","created_at":"2026-07-05T11:35:06.793865+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.07898v1","created_at":"2026-07-05T11:35:06.793865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07898","created_at":"2026-07-05T11:35:06.793865+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAUGMXNRSHZD","created_at":"2026-07-05T11:35:06.793865+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAUGMXNRSHZD5JGY","created_at":"2026-07-05T11:35:06.793865+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAUGMXNR","created_at":"2026-07-05T11:35:06.793865+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23880","citing_title":"GRACE: Gated Refinement for Accurate Causal Edge Discovery in High-Dimensional Time Series","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL","json":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL.json","graph_json":"https://pith.science/api/pith-number/LAUGMXNRSHZD5JGYIZZEN6HYFL/graph.json","events_json":"https://pith.science/api/pith-number/LAUGMXNRSHZD5JGYIZZEN6HYFL/events.json","paper":"https://pith.science/paper/LAUGMXNR"},"agent_actions":{"view_html":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL","download_json":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL.json","view_paper":"https://pith.science/paper/LAUGMXNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.07898&json=true","fetch_graph":"https://pith.science/api/pith-number/LAUGMXNRSHZD5JGYIZZEN6HYFL/graph.json","fetch_events":"https://pith.science/api/pith-number/LAUGMXNRSHZD5JGYIZZEN6HYFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/action/storage_attestation","attest_author":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/action/author_attestation","sign_citation":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/action/citation_signature","submit_replication":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/action/replication_record"}},"created_at":"2026-07-05T11:35:06.793865+00:00","updated_at":"2026-07-05T11:35:06.793865+00:00"}