{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZOIWYVXASLQFTFPHMFTUETZZP7","short_pith_number":"pith:ZOIWYVXA","canonical_record":{"source":{"id":"1205.6717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-30T15:10:58Z","cross_cats_sorted":[],"title_canon_sha256":"bf94f59198ad1243d3fb1a9354d2ce2ef32bbf707f28036b6ce6ce329c689a3e","abstract_canon_sha256":"9174e278d8ae358f17a9145575f2808c84a719ea38f373ac34cdd0da9210b966"},"schema_version":"1.0"},"canonical_sha256":"cb916c56e092e05995e76167424f397ff3d6fa076bfa08ac42e6cc9ff91b600b","source":{"kind":"arxiv","id":"1205.6717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6717","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6717v1","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6717","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZOIWYVXASLQF","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZOIWYVXASLQFTFPH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZOIWYVXA","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZOIWYVXASLQFTFPHMFTUETZZP7","target":"record","payload":{"canonical_record":{"source":{"id":"1205.6717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-30T15:10:58Z","cross_cats_sorted":[],"title_canon_sha256":"bf94f59198ad1243d3fb1a9354d2ce2ef32bbf707f28036b6ce6ce329c689a3e","abstract_canon_sha256":"9174e278d8ae358f17a9145575f2808c84a719ea38f373ac34cdd0da9210b966"},"schema_version":"1.0"},"canonical_sha256":"cb916c56e092e05995e76167424f397ff3d6fa076bfa08ac42e6cc9ff91b600b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:38.083133Z","signature_b64":"In8YLNRp5ABn/rkp7bxWHvTFsMc8woR/XVtOY9j9Y28kjOGzWE8GvfAed9NKUVQL4oFcBXX2ZT4hVZGpv5IFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb916c56e092e05995e76167424f397ff3d6fa076bfa08ac42e6cc9ff91b600b","last_reissued_at":"2026-05-18T03:54:38.082646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:38.082646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.6717","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-18T03:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Rl/fst4SLZOZnAXjJDe8mvCTIVjZLkZEnvZ2r34ZLXyWHz7ys3tslnABjV+ZJOUIanUZpmwJeK8lszH3sbvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:19:52.731043Z"},"content_sha256":"2009d7bc4b5dc8e698716a6a3aac3e2a26c4921f020e768b12214c895660f0a6","schema_version":"1.0","event_id":"sha256:2009d7bc4b5dc8e698716a6a3aac3e2a26c4921f020e768b12214c895660f0a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZOIWYVXASLQFTFPHMFTUETZZP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Non-Parametric Data Approximation of Pointsets via Data Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexandre Leblanc, Jason Morrison, Matthew Skala, Stephane Durocher","submitted_at":"2012-05-30T15:10:58Z","abstract_excerpt":"In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential data in the plane. We consider the problem of minimizing the average length of sequences of consecutive input points that lie on any one side of the simplified curve. Specifically, given a sequence $P$ of $n$ points in the plane that determine a simple polygonal chain consisting of $n-1$ segments, we describe algorithms for selecting an ordered subset $Q \\subset P$ (including the first and last points of $P$) that d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6717","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-18T03:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LydHRZl+UICxrlx1tovlQN7Etgye05MLG/AVnPDdJQ3t0YTroex8Odxublx4DP0Y8pBzaAgF1h/Zz9oJRcBeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:19:52.731413Z"},"content_sha256":"263059f871a940e0730eaac2f06dbc25f1c1e686dfe52df20c72c540398f3e6d","schema_version":"1.0","event_id":"sha256:263059f871a940e0730eaac2f06dbc25f1c1e686dfe52df20c72c540398f3e6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOIWYVXASLQFTFPHMFTUETZZP7/bundle.json","state_url":"https://pith.science/pith/ZOIWYVXASLQFTFPHMFTUETZZP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOIWYVXASLQFTFPHMFTUETZZP7/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-02T04:19:52Z","links":{"resolver":"https://pith.science/pith/ZOIWYVXASLQFTFPHMFTUETZZP7","bundle":"https://pith.science/pith/ZOIWYVXASLQFTFPHMFTUETZZP7/bundle.json","state":"https://pith.science/pith/ZOIWYVXASLQFTFPHMFTUETZZP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOIWYVXASLQFTFPHMFTUETZZP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZOIWYVXASLQFTFPHMFTUETZZP7","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":"9174e278d8ae358f17a9145575f2808c84a719ea38f373ac34cdd0da9210b966","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-30T15:10:58Z","title_canon_sha256":"bf94f59198ad1243d3fb1a9354d2ce2ef32bbf707f28036b6ce6ce329c689a3e"},"schema_version":"1.0","source":{"id":"1205.6717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6717","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6717v1","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6717","created_at":"2026-05-18T03:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZOIWYVXASLQF","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZOIWYVXASLQFTFPH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZOIWYVXA","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:263059f871a940e0730eaac2f06dbc25f1c1e686dfe52df20c72c540398f3e6d","target":"graph","created_at":"2026-05-18T03:54:38Z","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":"In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential data in the plane. We consider the problem of minimizing the average length of sequences of consecutive input points that lie on any one side of the simplified curve. Specifically, given a sequence $P$ of $n$ points in the plane that determine a simple polygonal chain consisting of $n-1$ segments, we describe algorithms for selecting an ordered subset $Q \\subset P$ (including the first and last points of $P$) that d","authors_text":"Alexandre Leblanc, Jason Morrison, Matthew Skala, Stephane Durocher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-30T15:10:58Z","title":"Robust Non-Parametric Data Approximation of Pointsets via Data Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6717","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:2009d7bc4b5dc8e698716a6a3aac3e2a26c4921f020e768b12214c895660f0a6","target":"record","created_at":"2026-05-18T03:54:38Z","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":"9174e278d8ae358f17a9145575f2808c84a719ea38f373ac34cdd0da9210b966","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-30T15:10:58Z","title_canon_sha256":"bf94f59198ad1243d3fb1a9354d2ce2ef32bbf707f28036b6ce6ce329c689a3e"},"schema_version":"1.0","source":{"id":"1205.6717","kind":"arxiv","version":1}},"canonical_sha256":"cb916c56e092e05995e76167424f397ff3d6fa076bfa08ac42e6cc9ff91b600b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb916c56e092e05995e76167424f397ff3d6fa076bfa08ac42e6cc9ff91b600b","first_computed_at":"2026-05-18T03:54:38.082646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:38.082646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"In8YLNRp5ABn/rkp7bxWHvTFsMc8woR/XVtOY9j9Y28kjOGzWE8GvfAed9NKUVQL4oFcBXX2ZT4hVZGpv5IFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:38.083133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2009d7bc4b5dc8e698716a6a3aac3e2a26c4921f020e768b12214c895660f0a6","sha256:263059f871a940e0730eaac2f06dbc25f1c1e686dfe52df20c72c540398f3e6d"],"state_sha256":"48121db004833a5cf99d31037932c97a53c6626aaeb02bff368877173c741c08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QcQJESRwI+eyY6gcvVFJeGOsakKkH62BR+OmD+oPAxvRFs8f6WPismGK3YG9Vu1//d4rL0c4GWtkW9G05dfcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:19:52.733491Z","bundle_sha256":"5fcb76a853be4f93a2a7492a6e6055bb4c850b7bfa56a6e557a0f9c066ee478f"}}