{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LAUGMXNRSHZD5JGYIZZEN6HYFL","short_pith_number":"pith:LAUGMXNR","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"},"canonical_sha256":"5828665db191f23ea4d8467246f8f82aeaa43fa6c9fa098e52cdd1d02d3dc1a2","source":{"kind":"arxiv","id":"2507.07898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07898","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07898v1","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07898","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"pith_short_12","alias_value":"LAUGMXNRSHZD","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"pith_short_16","alias_value":"LAUGMXNRSHZD5JGY","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"pith_short_8","alias_value":"LAUGMXNR","created_at":"2026-07-05T11:35:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LAUGMXNRSHZD5JGYIZZEN6HYFL","target":"record","payload":{"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"},"canonical_sha256":"5828665db191f23ea4d8467246f8f82aeaa43fa6c9fa098e52cdd1d02d3dc1a2","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"},"source_kind":"arxiv","source_id":"2507.07898","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:35:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsRz9/bRCPGpFKh3Qq0m9qYZlxLijjMR7nZhvtruHaqSyxf3HY8ik9exjx/Aetb/sE1coLiW3CqnzOvx3UBaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:50:42.604739Z"},"content_sha256":"eff63aafe5d7ce06b1fea125c8b737f7df18cfac7b62ed6809ac9d62e73c6f20","schema_version":"1.0","event_id":"sha256:eff63aafe5d7ce06b1fea125c8b737f7df18cfac7b62ed6809ac9d62e73c6f20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LAUGMXNRSHZD5JGYIZZEN6HYFL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:35:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iu3VVz5nDOU8EqP9cGiGS4WsXpLw8iCyqbDZcXqEAJU0paHnK6ZfXMYikbJYltt49KMGW8yuj+n4NefXLKc9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:50:42.605106Z"},"content_sha256":"573c653499ac486b158b42f542edc6fbe1dd089928e093dfad1a71ef30dde075","schema_version":"1.0","event_id":"sha256:573c653499ac486b158b42f542edc6fbe1dd089928e093dfad1a71ef30dde075"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/bundle.json","state_url":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T20:50:42Z","links":{"resolver":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL","bundle":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/bundle.json","state":"https://pith.science/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAUGMXNRSHZD5JGYIZZEN6HYFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LAUGMXNRSHZD5JGYIZZEN6HYFL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0ac80686882996bf61b293e701dfc79f0158d9196c3cfc5d08bd429d84631183","cross_cats_sorted":["stat.AP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-10T16:27:33Z","title_canon_sha256":"ccecc4fb554de338e797e8d9d39000faf299647d5b6e3826a6a3c319f74e8921"},"schema_version":"1.0","source":{"id":"2507.07898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07898","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07898v1","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07898","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"pith_short_12","alias_value":"LAUGMXNRSHZD","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"pith_short_16","alias_value":"LAUGMXNRSHZD5JGY","created_at":"2026-07-05T11:35:06Z"},{"alias_kind":"pith_short_8","alias_value":"LAUGMXNR","created_at":"2026-07-05T11:35:06Z"}],"graph_snapshots":[{"event_id":"sha256:573c653499ac486b158b42f542edc6fbe1dd089928e093dfad1a71ef30dde075","target":"graph","created_at":"2026-07-05T11:35:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.07898/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Achintya Gopal, Mohammad Fesanghary","cross_cats":["stat.AP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-10T16:27:33Z","title":"Efficient Causal Discovery for Autoregressive Time Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07898","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eff63aafe5d7ce06b1fea125c8b737f7df18cfac7b62ed6809ac9d62e73c6f20","target":"record","created_at":"2026-07-05T11:35:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0ac80686882996bf61b293e701dfc79f0158d9196c3cfc5d08bd429d84631183","cross_cats_sorted":["stat.AP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-10T16:27:33Z","title_canon_sha256":"ccecc4fb554de338e797e8d9d39000faf299647d5b6e3826a6a3c319f74e8921"},"schema_version":"1.0","source":{"id":"2507.07898","kind":"arxiv","version":1}},"canonical_sha256":"5828665db191f23ea4d8467246f8f82aeaa43fa6c9fa098e52cdd1d02d3dc1a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5828665db191f23ea4d8467246f8f82aeaa43fa6c9fa098e52cdd1d02d3dc1a2","first_computed_at":"2026-07-05T11:35:06.793800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:35:06.793800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HwmriDWDAv8Sh+Ae1atVmHqdVe7Oa8XCsJt+hE8p1jOzdfYRJ9hsTi4IjJS35FIjTFlRz5gSyOJcUay/R4SHBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:35:06.794350Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.07898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eff63aafe5d7ce06b1fea125c8b737f7df18cfac7b62ed6809ac9d62e73c6f20","sha256:573c653499ac486b158b42f542edc6fbe1dd089928e093dfad1a71ef30dde075"],"state_sha256":"75da2cd9ab1c178f41244b2a688461fb1cdfd3534ec9f70bebe6797f71b755a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8zjcJWQQ7rA3iOu1O/JW+JqbDW5ZGiPjYqlhqMD9dXddSnVUItiQtCE9jrGQptWGA9/8z298lNIgKLarlImAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:50:42.607106Z","bundle_sha256":"081c7ec2dbfa0941c540fd632d364cf4bfab392c8106ff34c2c7dbf736893d28"}}