{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RAFNDVNSFLHJD5YSULRZW2HT63","short_pith_number":"pith:RAFNDVNS","schema_version":"1.0","canonical_sha256":"880ad1d5b22ace91f712a2e39b68f3f6f39bafa6f5c077619018b7be11ff073b","source":{"kind":"arxiv","id":"1609.08201","version":1},"attestation_state":"computed","paper":{"title":"Robust Time-Series Retrieval Using Probabilistic Adaptive Segmental Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.DB","authors_text":"Shahriar Shariat, Vladimir Pavlovic","submitted_at":"2016-09-26T21:53:42Z","abstract_excerpt":"Traditional pairwise sequence alignment is based on matching individual samples from two sequences, under time monotonicity constraints. However, in many application settings matching subsequences (segments) instead of individual samples may bring in additional robustness to noise or local non-causal perturbations. This paper presents an approach to segmental sequence alignment that jointly segments and aligns two sequences, generalizing the traditional per-sample alignment. To accomplish this task, we introduce a distance metric between segments based on average pairwise distances and then pr"},"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":"1609.08201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-26T21:53:42Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"c6f3a7d63bc0d598186f832977b8495267a25f0ac269a50131668c8fd423750e","abstract_canon_sha256":"d4c9cee33c6c6938e148c94d70af59e4e77b0d23fa7952cfe9b6062e50afa03a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:46.419989Z","signature_b64":"cwQXgxStaPZgTBT6LTcZobX68VV8TRdogeINAYwZa2ZHe3nBkezM53ccoY5+aPSn/iXQoN+wrVfFCRzuE14HDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"880ad1d5b22ace91f712a2e39b68f3f6f39bafa6f5c077619018b7be11ff073b","last_reissued_at":"2026-05-18T01:03:46.419377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:46.419377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Time-Series Retrieval Using Probabilistic Adaptive Segmental Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.DB","authors_text":"Shahriar Shariat, Vladimir Pavlovic","submitted_at":"2016-09-26T21:53:42Z","abstract_excerpt":"Traditional pairwise sequence alignment is based on matching individual samples from two sequences, under time monotonicity constraints. However, in many application settings matching subsequences (segments) instead of individual samples may bring in additional robustness to noise or local non-causal perturbations. This paper presents an approach to segmental sequence alignment that jointly segments and aligns two sequences, generalizing the traditional per-sample alignment. To accomplish this task, we introduce a distance metric between segments based on average pairwise distances and then pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08201","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":"1609.08201","created_at":"2026-05-18T01:03:46.419476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08201v1","created_at":"2026-05-18T01:03:46.419476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08201","created_at":"2026-05-18T01:03:46.419476+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAFNDVNSFLHJ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAFNDVNSFLHJD5YS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAFNDVNS","created_at":"2026-05-18T12:30:41.710351+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/RAFNDVNSFLHJD5YSULRZW2HT63","json":"https://pith.science/pith/RAFNDVNSFLHJD5YSULRZW2HT63.json","graph_json":"https://pith.science/api/pith-number/RAFNDVNSFLHJD5YSULRZW2HT63/graph.json","events_json":"https://pith.science/api/pith-number/RAFNDVNSFLHJD5YSULRZW2HT63/events.json","paper":"https://pith.science/paper/RAFNDVNS"},"agent_actions":{"view_html":"https://pith.science/pith/RAFNDVNSFLHJD5YSULRZW2HT63","download_json":"https://pith.science/pith/RAFNDVNSFLHJD5YSULRZW2HT63.json","view_paper":"https://pith.science/paper/RAFNDVNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08201&json=true","fetch_graph":"https://pith.science/api/pith-number/RAFNDVNSFLHJD5YSULRZW2HT63/graph.json","fetch_events":"https://pith.science/api/pith-number/RAFNDVNSFLHJD5YSULRZW2HT63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAFNDVNSFLHJD5YSULRZW2HT63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAFNDVNSFLHJD5YSULRZW2HT63/action/storage_attestation","attest_author":"https://pith.science/pith/RAFNDVNSFLHJD5YSULRZW2HT63/action/author_attestation","sign_citation":"https://pith.science/pith/RAFNDVNSFLHJD5YSULRZW2HT63/action/citation_signature","submit_replication":"https://pith.science/pith/RAFNDVNSFLHJD5YSULRZW2HT63/action/replication_record"}},"created_at":"2026-05-18T01:03:46.419476+00:00","updated_at":"2026-05-18T01:03:46.419476+00:00"}