{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LNQ6XUPQWOKFYLREY3727SY7DK","short_pith_number":"pith:LNQ6XUPQ","canonical_record":{"source":{"id":"1312.7815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-30T18:39:20Z","cross_cats_sorted":["cs.SY","math.NA"],"title_canon_sha256":"2c7abf3f99aeedd3852f7d66222e470fe5bce562cd253c41b2b2c00bdfdc0270","abstract_canon_sha256":"d443fefa65aac0f6813ba03e80c5708b41c28049a1cc9e59ceb8820102b52ab5"},"schema_version":"1.0"},"canonical_sha256":"5b61ebd1f0b3945c2e24c6ffafcb1f1abfa0e0dbd36d5bf229d9cc0d96731235","source":{"kind":"arxiv","id":"1312.7815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7815","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7815v2","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7815","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"LNQ6XUPQWOKF","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LNQ6XUPQWOKFYLRE","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LNQ6XUPQ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LNQ6XUPQWOKFYLREY3727SY7DK","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-30T18:39:20Z","cross_cats_sorted":["cs.SY","math.NA"],"title_canon_sha256":"2c7abf3f99aeedd3852f7d66222e470fe5bce562cd253c41b2b2c00bdfdc0270","abstract_canon_sha256":"d443fefa65aac0f6813ba03e80c5708b41c28049a1cc9e59ceb8820102b52ab5"},"schema_version":"1.0"},"canonical_sha256":"5b61ebd1f0b3945c2e24c6ffafcb1f1abfa0e0dbd36d5bf229d9cc0d96731235","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.715820Z","signature_b64":"BAKZ3F4gpCOfARhTnvzmV8QEiTWk3TJ/k4ATNPM94hA090L141knJYHwaGASYiNM3exU8TJ3U3ZG3QTEtt98Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b61ebd1f0b3945c2e24c6ffafcb1f1abfa0e0dbd36d5bf229d9cc0d96731235","last_reissued_at":"2026-05-18T00:31:00.715161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.715161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7815","source_version":2,"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:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+K9ydh0MJcGplSLhgtzxMJ8PDj+FV1E/aYh5GaUatzoiFx98tF7fySGxVw8tqtk7MMGUiGmNgnIFCynbMAEbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:42:26.765017Z"},"content_sha256":"c768eb5ddb6dd0bf552a0ad4b94c19a6910bcdaef1e86308b81ede069ecb0a8c","schema_version":"1.0","event_id":"sha256:c768eb5ddb6dd0bf552a0ad4b94c19a6910bcdaef1e86308b81ede069ecb0a8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LNQ6XUPQWOKFYLREY3727SY7DK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal polygonal L1 linearization and fast interpolation of nonlinear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.NA"],"primary_cat":"math.OC","authors_text":"Daniel Berj\\'on, Guillermo Gallego, Narciso Garc\\'ia","submitted_at":"2013-12-30T18:39:20Z","abstract_excerpt":"The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using polygonal (continuous piecewise linear) models under the L1 norm. A thorough error analysis is developed to guide an optimal design of two kinds of polygonal approximations in the asymptotic case of a large budget of evaluation subintervals N. The method allows the user to obtain the level of linearization (N) for a target approximation error and vice versa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7815","kind":"arxiv","version":2},"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:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oigOPBghgreGOZAxhflFeJpd6RXoxErlwdMpRkOrptx2HwIfCF3Y1UTEWH4B/xBn1Vp+jg3Ujx49y/y0u1ObDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:42:26.765695Z"},"content_sha256":"343ddd9b1022b73de5a8dad4a936010a275ef61b2bd11272d4124f646d52d71a","schema_version":"1.0","event_id":"sha256:343ddd9b1022b73de5a8dad4a936010a275ef61b2bd11272d4124f646d52d71a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNQ6XUPQWOKFYLREY3727SY7DK/bundle.json","state_url":"https://pith.science/pith/LNQ6XUPQWOKFYLREY3727SY7DK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNQ6XUPQWOKFYLREY3727SY7DK/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-05T20:42:26Z","links":{"resolver":"https://pith.science/pith/LNQ6XUPQWOKFYLREY3727SY7DK","bundle":"https://pith.science/pith/LNQ6XUPQWOKFYLREY3727SY7DK/bundle.json","state":"https://pith.science/pith/LNQ6XUPQWOKFYLREY3727SY7DK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNQ6XUPQWOKFYLREY3727SY7DK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LNQ6XUPQWOKFYLREY3727SY7DK","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":"d443fefa65aac0f6813ba03e80c5708b41c28049a1cc9e59ceb8820102b52ab5","cross_cats_sorted":["cs.SY","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-30T18:39:20Z","title_canon_sha256":"2c7abf3f99aeedd3852f7d66222e470fe5bce562cd253c41b2b2c00bdfdc0270"},"schema_version":"1.0","source":{"id":"1312.7815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7815","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7815v2","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7815","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"LNQ6XUPQWOKF","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LNQ6XUPQWOKFYLRE","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LNQ6XUPQ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:343ddd9b1022b73de5a8dad4a936010a275ef61b2bd11272d4124f646d52d71a","target":"graph","created_at":"2026-05-18T00:31:00Z","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":"The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using polygonal (continuous piecewise linear) models under the L1 norm. A thorough error analysis is developed to guide an optimal design of two kinds of polygonal approximations in the asymptotic case of a large budget of evaluation subintervals N. The method allows the user to obtain the level of linearization (N) for a target approximation error and vice versa","authors_text":"Daniel Berj\\'on, Guillermo Gallego, Narciso Garc\\'ia","cross_cats":["cs.SY","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-30T18:39:20Z","title":"Optimal polygonal L1 linearization and fast interpolation of nonlinear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7815","kind":"arxiv","version":2},"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:c768eb5ddb6dd0bf552a0ad4b94c19a6910bcdaef1e86308b81ede069ecb0a8c","target":"record","created_at":"2026-05-18T00:31:00Z","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":"d443fefa65aac0f6813ba03e80c5708b41c28049a1cc9e59ceb8820102b52ab5","cross_cats_sorted":["cs.SY","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-30T18:39:20Z","title_canon_sha256":"2c7abf3f99aeedd3852f7d66222e470fe5bce562cd253c41b2b2c00bdfdc0270"},"schema_version":"1.0","source":{"id":"1312.7815","kind":"arxiv","version":2}},"canonical_sha256":"5b61ebd1f0b3945c2e24c6ffafcb1f1abfa0e0dbd36d5bf229d9cc0d96731235","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b61ebd1f0b3945c2e24c6ffafcb1f1abfa0e0dbd36d5bf229d9cc0d96731235","first_computed_at":"2026-05-18T00:31:00.715161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:00.715161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BAKZ3F4gpCOfARhTnvzmV8QEiTWk3TJ/k4ATNPM94hA090L141knJYHwaGASYiNM3exU8TJ3U3ZG3QTEtt98Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:00.715820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c768eb5ddb6dd0bf552a0ad4b94c19a6910bcdaef1e86308b81ede069ecb0a8c","sha256:343ddd9b1022b73de5a8dad4a936010a275ef61b2bd11272d4124f646d52d71a"],"state_sha256":"b5b06d0f6881792e9269c94c3bfafaa83d24629fcfd1be1a4b7068cfde6f949e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/c2D51gowLlcsmiROkvm+HaQV+7ilJum5MEIoY9bG7ejrL7xACg9W6KdhT4RgczrbTw4u4qYwM+e0P4mUlWQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:42:26.768762Z","bundle_sha256":"dcd978933d9694541d6b6cba6e05620e9cc64ea279086b3d53516580444b0624"}}