{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E6VYPU6RG2OVCVRODYYEOCPFIL","short_pith_number":"pith:E6VYPU6R","canonical_record":{"source":{"id":"1704.02577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2017-04-09T09:15:15Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"a59d37bbe1905effdde08e632563d39dff025f5df6d9a5fcf93709cca4fdeb8b","abstract_canon_sha256":"f4bb2b9272a2c55921e17647fd80154f39de959b786e655022af6881b7be4ba6"},"schema_version":"1.0"},"canonical_sha256":"27ab87d3d1369d51562e1e304709e542c0e5c4969c28de6a69341ec51798155e","source":{"kind":"arxiv","id":"1704.02577","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02577","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02577v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02577","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"E6VYPU6RG2OV","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E6VYPU6RG2OVCVRO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E6VYPU6R","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E6VYPU6RG2OVCVRODYYEOCPFIL","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2017-04-09T09:15:15Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"a59d37bbe1905effdde08e632563d39dff025f5df6d9a5fcf93709cca4fdeb8b","abstract_canon_sha256":"f4bb2b9272a2c55921e17647fd80154f39de959b786e655022af6881b7be4ba6"},"schema_version":"1.0"},"canonical_sha256":"27ab87d3d1369d51562e1e304709e542c0e5c4969c28de6a69341ec51798155e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:45.071555Z","signature_b64":"zJf6tYPIR60dtTx1LFiPCBjAeEA0WHeP89btG9nJwM3TCLH78z/eziuAZTBcmAO4Tz09fSTbrCqcHmaKrC+pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27ab87d3d1369d51562e1e304709e542c0e5c4969c28de6a69341ec51798155e","last_reissued_at":"2026-05-18T00:46:45.070790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:45.070790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02577","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-18T00:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYTZWg0xpnupXgwGYsyv2YmkHyc4huUIS1VfiMT/Td4P0gn+B9Yw9eHZ7rVMQTyJnlJFQOa8DGycGDmzQlJoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:47:19.298108Z"},"content_sha256":"96bfdcd302d3efcde3a3c9b5e14758dd20a09800b66b82fe56b77401de68bd4e","schema_version":"1.0","event_id":"sha256:96bfdcd302d3efcde3a3c9b5e14758dd20a09800b66b82fe56b77401de68bd4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E6VYPU6RG2OVCVRODYYEOCPFIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Robust Polylinear Analysis of Noisy Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"q-bio.QM","authors_text":"Myrl G. Marmarelis","submitted_at":"2017-04-09T09:15:15Z","abstract_excerpt":"A method is proposed to generate an optimal fit of a number of connected linear trend segments onto time-series data. To be able to efficiently handle many lines, the method employs a stochastic search procedure to determine optimal transition point locations. Traditional methods use exhaustive grid searches, which severely limit the scale of the problems for which they can be utilized. The proposed approach is tried against time series with severe noise to demonstrate its robustness, and then it is applied to real medical data as an illustrative example."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02577","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-18T00:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3hI5ksWCf6O/x0x9vtk3hQSKvtluccEh4fUNZLKH555zmbqkwtnlGGUjsBzilBIepbSsD+JeSTw736wFvS4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:47:19.298501Z"},"content_sha256":"bce6f9bcd5b6f8cd11e83d1da027a5560f0756b00564a5fec0d3d3a7cd9afe3b","schema_version":"1.0","event_id":"sha256:bce6f9bcd5b6f8cd11e83d1da027a5560f0756b00564a5fec0d3d3a7cd9afe3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6VYPU6RG2OVCVRODYYEOCPFIL/bundle.json","state_url":"https://pith.science/pith/E6VYPU6RG2OVCVRODYYEOCPFIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6VYPU6RG2OVCVRODYYEOCPFIL/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-06-21T20:47:19Z","links":{"resolver":"https://pith.science/pith/E6VYPU6RG2OVCVRODYYEOCPFIL","bundle":"https://pith.science/pith/E6VYPU6RG2OVCVRODYYEOCPFIL/bundle.json","state":"https://pith.science/pith/E6VYPU6RG2OVCVRODYYEOCPFIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6VYPU6RG2OVCVRODYYEOCPFIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E6VYPU6RG2OVCVRODYYEOCPFIL","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":"f4bb2b9272a2c55921e17647fd80154f39de959b786e655022af6881b7be4ba6","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2017-04-09T09:15:15Z","title_canon_sha256":"a59d37bbe1905effdde08e632563d39dff025f5df6d9a5fcf93709cca4fdeb8b"},"schema_version":"1.0","source":{"id":"1704.02577","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02577","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02577v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02577","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"E6VYPU6RG2OV","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E6VYPU6RG2OVCVRO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E6VYPU6R","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:bce6f9bcd5b6f8cd11e83d1da027a5560f0756b00564a5fec0d3d3a7cd9afe3b","target":"graph","created_at":"2026-05-18T00:46:45Z","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":"A method is proposed to generate an optimal fit of a number of connected linear trend segments onto time-series data. To be able to efficiently handle many lines, the method employs a stochastic search procedure to determine optimal transition point locations. Traditional methods use exhaustive grid searches, which severely limit the scale of the problems for which they can be utilized. The proposed approach is tried against time series with severe noise to demonstrate its robustness, and then it is applied to real medical data as an illustrative example.","authors_text":"Myrl G. Marmarelis","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2017-04-09T09:15:15Z","title":"Efficient and Robust Polylinear Analysis of Noisy Time Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02577","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:96bfdcd302d3efcde3a3c9b5e14758dd20a09800b66b82fe56b77401de68bd4e","target":"record","created_at":"2026-05-18T00:46:45Z","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":"f4bb2b9272a2c55921e17647fd80154f39de959b786e655022af6881b7be4ba6","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2017-04-09T09:15:15Z","title_canon_sha256":"a59d37bbe1905effdde08e632563d39dff025f5df6d9a5fcf93709cca4fdeb8b"},"schema_version":"1.0","source":{"id":"1704.02577","kind":"arxiv","version":1}},"canonical_sha256":"27ab87d3d1369d51562e1e304709e542c0e5c4969c28de6a69341ec51798155e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27ab87d3d1369d51562e1e304709e542c0e5c4969c28de6a69341ec51798155e","first_computed_at":"2026-05-18T00:46:45.070790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:45.070790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zJf6tYPIR60dtTx1LFiPCBjAeEA0WHeP89btG9nJwM3TCLH78z/eziuAZTBcmAO4Tz09fSTbrCqcHmaKrC+pCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:45.071555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02577","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96bfdcd302d3efcde3a3c9b5e14758dd20a09800b66b82fe56b77401de68bd4e","sha256:bce6f9bcd5b6f8cd11e83d1da027a5560f0756b00564a5fec0d3d3a7cd9afe3b"],"state_sha256":"f6c34f21501a4f143b2c8c9f0cfe41cfc4697876580448d1f00f7a7a7580a819"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tv76TaCjVGbqAhxhxUwLM66Aayje7AbI9TlvlHjO2XjO53//yryYW1jGY+QP6lxaIcQGg53yBF+w5Fe9zGGYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:47:19.300621Z","bundle_sha256":"4322279507c6e5d1efa0c7afbf45dc67da8f09a32c610be1e34ffc40d0395834"}}