{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UF2RBADVUMXEHJSH6BOW2F3WAE","short_pith_number":"pith:UF2RBADV","schema_version":"1.0","canonical_sha256":"a175108075a32e43a647f05d6d1776011559e857d5bf5913c28c4f2d6f18844e","source":{"kind":"arxiv","id":"1407.3685","version":1},"attestation_state":"computed","paper":{"title":"Finding Motif Sets in Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Anthony Bagnall, Jason Lines, Jon Hills","submitted_at":"2014-07-14T15:01:57Z","abstract_excerpt":"Time-series motifs are representative subsequences that occur frequently in a time series; a motif set is the set of subsequences deemed to be instances of a given motif. We focus on finding motif sets. Our motivation is to detect motif sets in household electricity-usage profiles, representing repeated patterns of household usage.\n  We propose three algorithms for finding motif sets. Two are greedy algorithms based on pairwise comparison, and the third uses a heuristic measure of set quality to find the motif set directly. We compare these algorithms on simulated datasets and on electricity-u"},"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":"1407.3685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-14T15:01:57Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"deb4668e0ff85d5f4f4c05823b509bda01ca7f1d7bdca29905226eda75a36e05","abstract_canon_sha256":"7b0aac3deba1e4c450d768ccc938eaca33e2a029b5156848fc6fd00f32c36b83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:42.005778Z","signature_b64":"2m3AEO4HljUf1F4Xe0BsUvfXxmwDR10V9zdua8KIvVXpB8DB+ObMOe7IaHoV//Bs8SKNudy8AbK/kKMRA+4ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a175108075a32e43a647f05d6d1776011559e857d5bf5913c28c4f2d6f18844e","last_reissued_at":"2026-05-18T02:47:42.005033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:42.005033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Motif Sets in Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Anthony Bagnall, Jason Lines, Jon Hills","submitted_at":"2014-07-14T15:01:57Z","abstract_excerpt":"Time-series motifs are representative subsequences that occur frequently in a time series; a motif set is the set of subsequences deemed to be instances of a given motif. We focus on finding motif sets. Our motivation is to detect motif sets in household electricity-usage profiles, representing repeated patterns of household usage.\n  We propose three algorithms for finding motif sets. Two are greedy algorithms based on pairwise comparison, and the third uses a heuristic measure of set quality to find the motif set directly. We compare these algorithms on simulated datasets and on electricity-u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3685","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":"1407.3685","created_at":"2026-05-18T02:47:42.005168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3685v1","created_at":"2026-05-18T02:47:42.005168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3685","created_at":"2026-05-18T02:47:42.005168+00:00"},{"alias_kind":"pith_short_12","alias_value":"UF2RBADVUMXE","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UF2RBADVUMXEHJSH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UF2RBADV","created_at":"2026-05-18T12:28:52.271510+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/UF2RBADVUMXEHJSH6BOW2F3WAE","json":"https://pith.science/pith/UF2RBADVUMXEHJSH6BOW2F3WAE.json","graph_json":"https://pith.science/api/pith-number/UF2RBADVUMXEHJSH6BOW2F3WAE/graph.json","events_json":"https://pith.science/api/pith-number/UF2RBADVUMXEHJSH6BOW2F3WAE/events.json","paper":"https://pith.science/paper/UF2RBADV"},"agent_actions":{"view_html":"https://pith.science/pith/UF2RBADVUMXEHJSH6BOW2F3WAE","download_json":"https://pith.science/pith/UF2RBADVUMXEHJSH6BOW2F3WAE.json","view_paper":"https://pith.science/paper/UF2RBADV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3685&json=true","fetch_graph":"https://pith.science/api/pith-number/UF2RBADVUMXEHJSH6BOW2F3WAE/graph.json","fetch_events":"https://pith.science/api/pith-number/UF2RBADVUMXEHJSH6BOW2F3WAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UF2RBADVUMXEHJSH6BOW2F3WAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UF2RBADVUMXEHJSH6BOW2F3WAE/action/storage_attestation","attest_author":"https://pith.science/pith/UF2RBADVUMXEHJSH6BOW2F3WAE/action/author_attestation","sign_citation":"https://pith.science/pith/UF2RBADVUMXEHJSH6BOW2F3WAE/action/citation_signature","submit_replication":"https://pith.science/pith/UF2RBADVUMXEHJSH6BOW2F3WAE/action/replication_record"}},"created_at":"2026-05-18T02:47:42.005168+00:00","updated_at":"2026-05-18T02:47:42.005168+00:00"}