{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T3HXXBQCDKH4O77Y5DZQMQ7BNC","short_pith_number":"pith:T3HXXBQC","canonical_record":{"source":{"id":"1610.07435","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T14:42:43Z","cross_cats_sorted":[],"title_canon_sha256":"6d22153d24f1d1adde5e49287391a08e5b72bf96d9dc063130524d2078abac41","abstract_canon_sha256":"feab4dbe629fbef9a1f7aaae123c42f73103a7e3935c44af6dd77f33992370d9"},"schema_version":"1.0"},"canonical_sha256":"9ecf7b86021a8fc77ff8e8f30643e1689a0fc0be8d51e951636cf2bbb6f94fe8","source":{"kind":"arxiv","id":"1610.07435","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07435","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07435v6","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07435","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"T3HXXBQCDKH4","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3HXXBQCDKH4O77Y","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3HXXBQC","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T3HXXBQCDKH4O77Y5DZQMQ7BNC","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07435","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T14:42:43Z","cross_cats_sorted":[],"title_canon_sha256":"6d22153d24f1d1adde5e49287391a08e5b72bf96d9dc063130524d2078abac41","abstract_canon_sha256":"feab4dbe629fbef9a1f7aaae123c42f73103a7e3935c44af6dd77f33992370d9"},"schema_version":"1.0"},"canonical_sha256":"9ecf7b86021a8fc77ff8e8f30643e1689a0fc0be8d51e951636cf2bbb6f94fe8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:24.482532Z","signature_b64":"RaEaSVj1kvv+/k8MCnYNR5OfU2in0r8al9YhrFy0JEC2k5ScfXuJkItUaD0phcBVkuXDPpZBaOKdlGCKXjDPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ecf7b86021a8fc77ff8e8f30643e1689a0fc0be8d51e951636cf2bbb6f94fe8","last_reissued_at":"2026-05-18T00:17:24.481875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:24.481875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07435","source_version":6,"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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DEp7c+Ry0CFNIXp8C+W8TfnY228HpAi5rtShEXsa2ZYHnHfSDok2AQeGWVRXYUdCWhrHDdGv9vwfzvWlc9XFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:38:30.825288Z"},"content_sha256":"6beb986dfa35621a5ee005e56d8c2462077eec6ce5e694b8b0da952bfe02ee0c","schema_version":"1.0","event_id":"sha256:6beb986dfa35621a5ee005e56d8c2462077eec6ce5e694b8b0da952bfe02ee0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T3HXXBQCDKH4O77Y5DZQMQ7BNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Gaussian Segmentation of Multivariate Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Hallac, Peter Nystrup, Stephen Boyd","submitted_at":"2016-10-24T14:42:43Z","abstract_excerpt":"We consider the problem of breaking a multivariate (vector) time series into segments over which the data is well explained as independent samples from a Gaussian distribution. We formulate this as a covariance-regularized maximum likelihood problem, which can be reduced to a combinatorial optimization problem of searching over the possible breakpoints, or segment boundaries. This problem can be solved using dynamic programming, with complexity that grows with the square of the time series length. We propose a heuristic method that approximately solves the problem in linear time with respect t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07435","kind":"arxiv","version":6},"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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfB1KIRaOOMtj1AnY0r//5x04kjIZXYgVldYDuquHBZ7HiHm/hg6jt37CSwILweud64W6bmpLakbvJ+mCgmsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:38:30.825900Z"},"content_sha256":"f3fe4dc401c818fb334662b0299671431e2331c273cbd105c61a7b2f59b648f3","schema_version":"1.0","event_id":"sha256:f3fe4dc401c818fb334662b0299671431e2331c273cbd105c61a7b2f59b648f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3HXXBQCDKH4O77Y5DZQMQ7BNC/bundle.json","state_url":"https://pith.science/pith/T3HXXBQCDKH4O77Y5DZQMQ7BNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3HXXBQCDKH4O77Y5DZQMQ7BNC/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-07T06:38:30Z","links":{"resolver":"https://pith.science/pith/T3HXXBQCDKH4O77Y5DZQMQ7BNC","bundle":"https://pith.science/pith/T3HXXBQCDKH4O77Y5DZQMQ7BNC/bundle.json","state":"https://pith.science/pith/T3HXXBQCDKH4O77Y5DZQMQ7BNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3HXXBQCDKH4O77Y5DZQMQ7BNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T3HXXBQCDKH4O77Y5DZQMQ7BNC","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":"feab4dbe629fbef9a1f7aaae123c42f73103a7e3935c44af6dd77f33992370d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T14:42:43Z","title_canon_sha256":"6d22153d24f1d1adde5e49287391a08e5b72bf96d9dc063130524d2078abac41"},"schema_version":"1.0","source":{"id":"1610.07435","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07435","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07435v6","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07435","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"T3HXXBQCDKH4","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3HXXBQCDKH4O77Y","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3HXXBQC","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:f3fe4dc401c818fb334662b0299671431e2331c273cbd105c61a7b2f59b648f3","target":"graph","created_at":"2026-05-18T00:17:24Z","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":"We consider the problem of breaking a multivariate (vector) time series into segments over which the data is well explained as independent samples from a Gaussian distribution. We formulate this as a covariance-regularized maximum likelihood problem, which can be reduced to a combinatorial optimization problem of searching over the possible breakpoints, or segment boundaries. This problem can be solved using dynamic programming, with complexity that grows with the square of the time series length. We propose a heuristic method that approximately solves the problem in linear time with respect t","authors_text":"David Hallac, Peter Nystrup, Stephen Boyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T14:42:43Z","title":"Greedy Gaussian Segmentation of Multivariate Time Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07435","kind":"arxiv","version":6},"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:6beb986dfa35621a5ee005e56d8c2462077eec6ce5e694b8b0da952bfe02ee0c","target":"record","created_at":"2026-05-18T00:17:24Z","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":"feab4dbe629fbef9a1f7aaae123c42f73103a7e3935c44af6dd77f33992370d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T14:42:43Z","title_canon_sha256":"6d22153d24f1d1adde5e49287391a08e5b72bf96d9dc063130524d2078abac41"},"schema_version":"1.0","source":{"id":"1610.07435","kind":"arxiv","version":6}},"canonical_sha256":"9ecf7b86021a8fc77ff8e8f30643e1689a0fc0be8d51e951636cf2bbb6f94fe8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ecf7b86021a8fc77ff8e8f30643e1689a0fc0be8d51e951636cf2bbb6f94fe8","first_computed_at":"2026-05-18T00:17:24.481875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:24.481875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RaEaSVj1kvv+/k8MCnYNR5OfU2in0r8al9YhrFy0JEC2k5ScfXuJkItUaD0phcBVkuXDPpZBaOKdlGCKXjDPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:24.482532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07435","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6beb986dfa35621a5ee005e56d8c2462077eec6ce5e694b8b0da952bfe02ee0c","sha256:f3fe4dc401c818fb334662b0299671431e2331c273cbd105c61a7b2f59b648f3"],"state_sha256":"9ca5bd50802929deb0b72931eff11408844d2ef37f17f53c0c506d48e052fea2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjv3pLpKw/inJQ8PCy3SaJx3Rbro8HoOnexOxRROiRCquqC0qgf6QycsyE2KqlC1ZYx0qdsSnh+IOiSl14RvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:38:30.830051Z","bundle_sha256":"4477ce124b9bcb85941aec6d58bfc70ae4aedb3ccd5c64b4fdd744cce4c70506"}}