{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SPDPA65QA35X2I7CGK2XUQZUG7","short_pith_number":"pith:SPDPA65Q","schema_version":"1.0","canonical_sha256":"93c6f07bb006fb7d23e232b57a433437e9644f02be5016501f1568fd3f4693d0","source":{"kind":"arxiv","id":"1906.01450","version":1},"attestation_state":"computed","paper":{"title":"A Fast-Optimal Guaranteed Algorithm For Learning Sub-Interval Relationships in Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anuj Karpatne, Saurabh Agrawal, Saurabh Verma, Snigdhansu Chatterjee, Stefan Liess, Vipin Kumar","submitted_at":"2019-06-03T01:00:47Z","abstract_excerpt":"Traditional approaches focus on finding relationships between two entire time series, however, many interesting relationships exist in small sub-intervals of time and remain feeble during other sub-intervals. We define the notion of a sub-interval relationship (SIR) to capture such interactions that are prominent only in certain sub-intervals of time. To that end, we propose a fast-optimal guaranteed algorithm to find most interesting SIR relationship in a pair of time series. Lastly, we demonstrate the utility of our method in climate science domain based on a real-world dataset along with it"},"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":"1906.01450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T01:00:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b9686a906ac1306e968e2b2323cb3b61645f9ad7ae07aa828b31a1b37c9c5375","abstract_canon_sha256":"fad650c04160e4135681f282f355794f93ae53a49b9815f694171122c7d47b13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:16.553868Z","signature_b64":"cc+rw5PPlojtcskloTz9ERY5hsZBF4wqZtmUF0Ky/OHB28nm/K0ldtiHJpfMEQ6Lt2EiJumRJc+S1f7EYmrpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93c6f07bb006fb7d23e232b57a433437e9644f02be5016501f1568fd3f4693d0","last_reissued_at":"2026-05-17T23:44:16.553345Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:16.553345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast-Optimal Guaranteed Algorithm For Learning Sub-Interval Relationships in Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anuj Karpatne, Saurabh Agrawal, Saurabh Verma, Snigdhansu Chatterjee, Stefan Liess, Vipin Kumar","submitted_at":"2019-06-03T01:00:47Z","abstract_excerpt":"Traditional approaches focus on finding relationships between two entire time series, however, many interesting relationships exist in small sub-intervals of time and remain feeble during other sub-intervals. We define the notion of a sub-interval relationship (SIR) to capture such interactions that are prominent only in certain sub-intervals of time. To that end, we propose a fast-optimal guaranteed algorithm to find most interesting SIR relationship in a pair of time series. Lastly, we demonstrate the utility of our method in climate science domain based on a real-world dataset along with it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01450","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":""},"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":"1906.01450","created_at":"2026-05-17T23:44:16.553432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01450v1","created_at":"2026-05-17T23:44:16.553432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01450","created_at":"2026-05-17T23:44:16.553432+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPDPA65QA35X","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPDPA65QA35X2I7C","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPDPA65Q","created_at":"2026-05-18T12:33:27.125529+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/SPDPA65QA35X2I7CGK2XUQZUG7","json":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7.json","graph_json":"https://pith.science/api/pith-number/SPDPA65QA35X2I7CGK2XUQZUG7/graph.json","events_json":"https://pith.science/api/pith-number/SPDPA65QA35X2I7CGK2XUQZUG7/events.json","paper":"https://pith.science/paper/SPDPA65Q"},"agent_actions":{"view_html":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7","download_json":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7.json","view_paper":"https://pith.science/paper/SPDPA65Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01450&json=true","fetch_graph":"https://pith.science/api/pith-number/SPDPA65QA35X2I7CGK2XUQZUG7/graph.json","fetch_events":"https://pith.science/api/pith-number/SPDPA65QA35X2I7CGK2XUQZUG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/action/storage_attestation","attest_author":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/action/author_attestation","sign_citation":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/action/citation_signature","submit_replication":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/action/replication_record"}},"created_at":"2026-05-17T23:44:16.553432+00:00","updated_at":"2026-05-17T23:44:16.553432+00:00"}