{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SPDPA65QA35X2I7CGK2XUQZUG7","short_pith_number":"pith:SPDPA65Q","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"},"canonical_sha256":"93c6f07bb006fb7d23e232b57a433437e9644f02be5016501f1568fd3f4693d0","source":{"kind":"arxiv","id":"1906.01450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01450","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01450v1","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01450","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"SPDPA65QA35X","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SPDPA65QA35X2I7C","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SPDPA65Q","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SPDPA65QA35X2I7CGK2XUQZUG7","target":"record","payload":{"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"},"canonical_sha256":"93c6f07bb006fb7d23e232b57a433437e9644f02be5016501f1568fd3f4693d0","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"},"source_kind":"arxiv","source_id":"1906.01450","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-05-17T23:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYN/JnAiAnAIpHKrM/Swd4S8BOaI2JfsAlunLXAm6IKupBlKjUJJiXGD8arlMIcdA9r4N66sy6TYcgrdmBf4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:54:01.728174Z"},"content_sha256":"e619fbebcda0453ba1263c09ed73973dcec9cee9b0a3c65607d50f87721d8b12","schema_version":"1.0","event_id":"sha256:e619fbebcda0453ba1263c09ed73973dcec9cee9b0a3c65607d50f87721d8b12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SPDPA65QA35X2I7CGK2XUQZUG7","target":"graph","payload":{"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"},"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-05-17T23:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQG700Y8IHjQCjSGcMqcQcJsrGa+LOwUlN/vfHbFFHOEUFoXNJpIhI7fAz0lWC074lFLAFsE2E8ZBsYPJP7lAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:54:01.728680Z"},"content_sha256":"ac9752f314ba891e983f1dc8e464bab51be383fc5809a5397b99488699b98a0f","schema_version":"1.0","event_id":"sha256:ac9752f314ba891e983f1dc8e464bab51be383fc5809a5397b99488699b98a0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/bundle.json","state_url":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPDPA65QA35X2I7CGK2XUQZUG7/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-05-27T05:54:01Z","links":{"resolver":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7","bundle":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/bundle.json","state":"https://pith.science/pith/SPDPA65QA35X2I7CGK2XUQZUG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPDPA65QA35X2I7CGK2XUQZUG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SPDPA65QA35X2I7CGK2XUQZUG7","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":"fad650c04160e4135681f282f355794f93ae53a49b9815f694171122c7d47b13","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T01:00:47Z","title_canon_sha256":"b9686a906ac1306e968e2b2323cb3b61645f9ad7ae07aa828b31a1b37c9c5375"},"schema_version":"1.0","source":{"id":"1906.01450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01450","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01450v1","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01450","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"SPDPA65QA35X","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SPDPA65QA35X2I7C","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SPDPA65Q","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:ac9752f314ba891e983f1dc8e464bab51be383fc5809a5397b99488699b98a0f","target":"graph","created_at":"2026-05-17T23:44:16Z","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"},"paper":{"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","authors_text":"Anuj Karpatne, Saurabh Agrawal, Saurabh Verma, Snigdhansu Chatterjee, Stefan Liess, Vipin Kumar","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T01:00:47Z","title":"A Fast-Optimal Guaranteed Algorithm For Learning Sub-Interval Relationships in Time Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01450","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:e619fbebcda0453ba1263c09ed73973dcec9cee9b0a3c65607d50f87721d8b12","target":"record","created_at":"2026-05-17T23:44:16Z","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":"fad650c04160e4135681f282f355794f93ae53a49b9815f694171122c7d47b13","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T01:00:47Z","title_canon_sha256":"b9686a906ac1306e968e2b2323cb3b61645f9ad7ae07aa828b31a1b37c9c5375"},"schema_version":"1.0","source":{"id":"1906.01450","kind":"arxiv","version":1}},"canonical_sha256":"93c6f07bb006fb7d23e232b57a433437e9644f02be5016501f1568fd3f4693d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93c6f07bb006fb7d23e232b57a433437e9644f02be5016501f1568fd3f4693d0","first_computed_at":"2026-05-17T23:44:16.553345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:16.553345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cc+rw5PPlojtcskloTz9ERY5hsZBF4wqZtmUF0Ky/OHB28nm/K0ldtiHJpfMEQ6Lt2EiJumRJc+S1f7EYmrpAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:16.553868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e619fbebcda0453ba1263c09ed73973dcec9cee9b0a3c65607d50f87721d8b12","sha256:ac9752f314ba891e983f1dc8e464bab51be383fc5809a5397b99488699b98a0f"],"state_sha256":"78eb2f7446591ddde1aafdc288bbe558606c1ce93baa66ad326034a09f728fa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuZGzqNG7n2MxA59579qQNxG1OvM4cxvWoqgLp3KEI+5vbF/eplSLd62OM2OdAFyReil5ziAwGeeq9BaRCEoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:54:01.731025Z","bundle_sha256":"805f7e04008010e6b18fed88401968a62ace4a224d3d934be98958fd6e0c9a51"}}