{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E4XFGZERQLSTG3DL6Z6IVRBIYW","short_pith_number":"pith:E4XFGZER","canonical_record":{"source":{"id":"1902.03285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"64f00630bedb822636f028584cb67a96af0ff7940572016796c6ad470a475b85","abstract_canon_sha256":"3816861c4c241a836736e9a779f0d51de90b447587f247aa9460d1a25dc57b46"},"schema_version":"1.0"},"canonical_sha256":"272e53649182e5336c6bf67c8ac428c5ab92df8f7552d60d5b55407c8a648c15","source":{"kind":"arxiv","id":"1902.03285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03285","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03285v1","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03285","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"E4XFGZERQLST","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4XFGZERQLSTG3DL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4XFGZER","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E4XFGZERQLSTG3DL6Z6IVRBIYW","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"64f00630bedb822636f028584cb67a96af0ff7940572016796c6ad470a475b85","abstract_canon_sha256":"3816861c4c241a836736e9a779f0d51de90b447587f247aa9460d1a25dc57b46"},"schema_version":"1.0"},"canonical_sha256":"272e53649182e5336c6bf67c8ac428c5ab92df8f7552d60d5b55407c8a648c15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:21.374996Z","signature_b64":"XWrHPy9cgUpjEXefW2IzI53lfhGLlv6g6SxsuLO7VKDuJ5y5EyYtuA4XqknvifPmGHlmCvwM5pxb3QgZsWlsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"272e53649182e5336c6bf67c8ac428c5ab92df8f7552d60d5b55407c8a648c15","last_reissued_at":"2026-05-17T23:54:21.374346Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:21.374346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03285","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:54:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhgFc0HxPkmWyefbbt3JyEaNkgAworsANqft9IK9yEnBGJot1i+LeKY7qxTNu8lKfHtH2zPg57Y7yAQl2hnhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:56:16.638083Z"},"content_sha256":"83cf1156bb1bc2a17addb195cc3eb3f5ea1f166ea1d1dd5769841c971722bf1b","schema_version":"1.0","event_id":"sha256:83cf1156bb1bc2a17addb195cc3eb3f5ea1f166ea1d1dd5769841c971722bf1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E4XFGZERQLSTG3DL6Z6IVRBIYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Sequence Segmentation using Log-Linear Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-08T20:42:07Z","abstract_excerpt":"Sequence segmentation is a well-studied problem, where given a sequence of elements, an integer K, and some measure of homogeneity, the task is to split the sequence into K contiguous segments that are maximally homogeneous. A classic approach to find the optimal solution is by using a dynamic program. Unfortunately, the execution time of this program is quadratic with respect to the length of the input sequence. This makes the algorithm slow for a sequence of non-trivial length. In this paper we study segmentations whose measure of goodness is based on log-linear models, a rich family that co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03285","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:54:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHJEb7QBbM8Nce5rY/2VbhgaV+GXsruHfppc54WhN4geROATnc4q26as03LFivS5K/XxeFQuxSd0ACQMl4i/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:56:16.638824Z"},"content_sha256":"53e51cfb8f3cf2cd71cd8a97de2292431a50f8142e89d2eb74da3ce329381b74","schema_version":"1.0","event_id":"sha256:53e51cfb8f3cf2cd71cd8a97de2292431a50f8142e89d2eb74da3ce329381b74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4XFGZERQLSTG3DL6Z6IVRBIYW/bundle.json","state_url":"https://pith.science/pith/E4XFGZERQLSTG3DL6Z6IVRBIYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4XFGZERQLSTG3DL6Z6IVRBIYW/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-26T13:56:16Z","links":{"resolver":"https://pith.science/pith/E4XFGZERQLSTG3DL6Z6IVRBIYW","bundle":"https://pith.science/pith/E4XFGZERQLSTG3DL6Z6IVRBIYW/bundle.json","state":"https://pith.science/pith/E4XFGZERQLSTG3DL6Z6IVRBIYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4XFGZERQLSTG3DL6Z6IVRBIYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E4XFGZERQLSTG3DL6Z6IVRBIYW","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":"3816861c4c241a836736e9a779f0d51de90b447587f247aa9460d1a25dc57b46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:42:07Z","title_canon_sha256":"64f00630bedb822636f028584cb67a96af0ff7940572016796c6ad470a475b85"},"schema_version":"1.0","source":{"id":"1902.03285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03285","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03285v1","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03285","created_at":"2026-05-17T23:54:21Z"},{"alias_kind":"pith_short_12","alias_value":"E4XFGZERQLST","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4XFGZERQLSTG3DL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4XFGZER","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:53e51cfb8f3cf2cd71cd8a97de2292431a50f8142e89d2eb74da3ce329381b74","target":"graph","created_at":"2026-05-17T23:54:21Z","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":"Sequence segmentation is a well-studied problem, where given a sequence of elements, an integer K, and some measure of homogeneity, the task is to split the sequence into K contiguous segments that are maximally homogeneous. A classic approach to find the optimal solution is by using a dynamic program. Unfortunately, the execution time of this program is quadratic with respect to the length of the input sequence. This makes the algorithm slow for a sequence of non-trivial length. In this paper we study segmentations whose measure of goodness is based on log-linear models, a rich family that co","authors_text":"Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:42:07Z","title":"Fast Sequence Segmentation using Log-Linear Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03285","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:83cf1156bb1bc2a17addb195cc3eb3f5ea1f166ea1d1dd5769841c971722bf1b","target":"record","created_at":"2026-05-17T23:54:21Z","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":"3816861c4c241a836736e9a779f0d51de90b447587f247aa9460d1a25dc57b46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-08T20:42:07Z","title_canon_sha256":"64f00630bedb822636f028584cb67a96af0ff7940572016796c6ad470a475b85"},"schema_version":"1.0","source":{"id":"1902.03285","kind":"arxiv","version":1}},"canonical_sha256":"272e53649182e5336c6bf67c8ac428c5ab92df8f7552d60d5b55407c8a648c15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"272e53649182e5336c6bf67c8ac428c5ab92df8f7552d60d5b55407c8a648c15","first_computed_at":"2026-05-17T23:54:21.374346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:21.374346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XWrHPy9cgUpjEXefW2IzI53lfhGLlv6g6SxsuLO7VKDuJ5y5EyYtuA4XqknvifPmGHlmCvwM5pxb3QgZsWlsBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:21.374996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83cf1156bb1bc2a17addb195cc3eb3f5ea1f166ea1d1dd5769841c971722bf1b","sha256:53e51cfb8f3cf2cd71cd8a97de2292431a50f8142e89d2eb74da3ce329381b74"],"state_sha256":"822d9949a2f6710a98f2a03b1b501a1e8e9c0bc1e89d465d17a92bcf47b352d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwzC8D4ehkKDg3M22bVp+9zDpvcgUcCmA7R+j/SHGbccEBzYVueyGrMWGA4uNZLwDb7Ds+zZ5B83i8JhlEGmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:56:16.642431Z","bundle_sha256":"631e0bf2dd0d1166447feb1adb051e58b640c2c142a518a28ac2f73d4481c9b2"}}