{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2JT7BTT4FVNZ7V3MVM5F7L37BP","short_pith_number":"pith:2JT7BTT4","canonical_record":{"source":{"id":"1510.02975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T20:49:17Z","cross_cats_sorted":["cs.CV","cs.DC","cs.NA","cs.SY"],"title_canon_sha256":"32e6e3668b7807819c67e8248cd78b5a59cda4e287f87bfdca29073adae6b12a","abstract_canon_sha256":"9425be3644a035ab22155fddb84d342eaf075bd826b7755efd7b2321918d7fa0"},"schema_version":"1.0"},"canonical_sha256":"d267f0ce7c2d5b9fd76cab3a5faf7f0bf3eba5726298dac64aa6607249bdcb4b","source":{"kind":"arxiv","id":"1510.02975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02975","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02975v1","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02975","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"2JT7BTT4FVNZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JT7BTT4FVNZ7V3M","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JT7BTT4","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2JT7BTT4FVNZ7V3MVM5F7L37BP","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T20:49:17Z","cross_cats_sorted":["cs.CV","cs.DC","cs.NA","cs.SY"],"title_canon_sha256":"32e6e3668b7807819c67e8248cd78b5a59cda4e287f87bfdca29073adae6b12a","abstract_canon_sha256":"9425be3644a035ab22155fddb84d342eaf075bd826b7755efd7b2321918d7fa0"},"schema_version":"1.0"},"canonical_sha256":"d267f0ce7c2d5b9fd76cab3a5faf7f0bf3eba5726298dac64aa6607249bdcb4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.574531Z","signature_b64":"8O75hCeb2RiBfYKHm6xZQFcUSJlJOVwiAM/RKjxLWgal0J++djXNlvF748nvV00jH9Uj5TXmoM8ikFyrxepwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d267f0ce7c2d5b9fd76cab3a5faf7f0bf3eba5726298dac64aa6607249bdcb4b","last_reissued_at":"2026-05-18T00:31:00.573997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.573997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02975","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: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":"SgpZfsClsZ1IcWVsoJbsLol1SJMUHY4JiAAJanOm3d313/vW56nuQX9sGQ123+n5Pn0HRV5Fz5/vrqn41jhoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:26:01.992761Z"},"content_sha256":"4985d0f5a27f9899c314ff669a124648dcf17a2ef6b6e3be32f353fc8eb4f7fd","schema_version":"1.0","event_id":"sha256:4985d0f5a27f9899c314ff669a124648dcf17a2ef6b6e3be32f353fc8eb4f7fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2JT7BTT4FVNZ7V3MVM5F7L37BP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Piecewise Linear Function Approximation for GPU-based Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DC","cs.NA","cs.SY"],"primary_cat":"math.OC","authors_text":"Carlos Cuevas, Daniel Berj\\'on, Francisco Mor\\'an, Guillermo Gallego, Narciso Garc\\'ia","submitted_at":"2015-10-10T20:49:17Z","abstract_excerpt":"Many computer vision and human-computer interaction applications developed in recent years need evaluating complex and continuous mathematical functions as an essential step toward proper operation. However, rigorous evaluation of this kind of functions often implies a very high computational cost, unacceptable in real-time applications. To alleviate this problem, functions are commonly approximated by simpler piecewise-polynomial representations. Following this idea, we propose a novel, efficient, and practical technique to evaluate complex and continuous functions using a nearly optimal desi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02975","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: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":"PRYznpr6tZh5CXbrz3IBBVnfou2tFRTv/Bl0/N/afkFClQQWzfq5liEeb7dh8r02Jkq7b9VWzmbMH3fNOCKPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:26:01.993126Z"},"content_sha256":"83ffd612637a294e0958510fcc8459a64d7b3b569f9dde063e1b46b9818f038e","schema_version":"1.0","event_id":"sha256:83ffd612637a294e0958510fcc8459a64d7b3b569f9dde063e1b46b9818f038e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JT7BTT4FVNZ7V3MVM5F7L37BP/bundle.json","state_url":"https://pith.science/pith/2JT7BTT4FVNZ7V3MVM5F7L37BP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JT7BTT4FVNZ7V3MVM5F7L37BP/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-02T17:26:01Z","links":{"resolver":"https://pith.science/pith/2JT7BTT4FVNZ7V3MVM5F7L37BP","bundle":"https://pith.science/pith/2JT7BTT4FVNZ7V3MVM5F7L37BP/bundle.json","state":"https://pith.science/pith/2JT7BTT4FVNZ7V3MVM5F7L37BP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JT7BTT4FVNZ7V3MVM5F7L37BP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2JT7BTT4FVNZ7V3MVM5F7L37BP","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":"9425be3644a035ab22155fddb84d342eaf075bd826b7755efd7b2321918d7fa0","cross_cats_sorted":["cs.CV","cs.DC","cs.NA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T20:49:17Z","title_canon_sha256":"32e6e3668b7807819c67e8248cd78b5a59cda4e287f87bfdca29073adae6b12a"},"schema_version":"1.0","source":{"id":"1510.02975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02975","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02975v1","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02975","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"2JT7BTT4FVNZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JT7BTT4FVNZ7V3M","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JT7BTT4","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:83ffd612637a294e0958510fcc8459a64d7b3b569f9dde063e1b46b9818f038e","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":"Many computer vision and human-computer interaction applications developed in recent years need evaluating complex and continuous mathematical functions as an essential step toward proper operation. However, rigorous evaluation of this kind of functions often implies a very high computational cost, unacceptable in real-time applications. To alleviate this problem, functions are commonly approximated by simpler piecewise-polynomial representations. Following this idea, we propose a novel, efficient, and practical technique to evaluate complex and continuous functions using a nearly optimal desi","authors_text":"Carlos Cuevas, Daniel Berj\\'on, Francisco Mor\\'an, Guillermo Gallego, Narciso Garc\\'ia","cross_cats":["cs.CV","cs.DC","cs.NA","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T20:49:17Z","title":"Optimal Piecewise Linear Function Approximation for GPU-based Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02975","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:4985d0f5a27f9899c314ff669a124648dcf17a2ef6b6e3be32f353fc8eb4f7fd","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":"9425be3644a035ab22155fddb84d342eaf075bd826b7755efd7b2321918d7fa0","cross_cats_sorted":["cs.CV","cs.DC","cs.NA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-10T20:49:17Z","title_canon_sha256":"32e6e3668b7807819c67e8248cd78b5a59cda4e287f87bfdca29073adae6b12a"},"schema_version":"1.0","source":{"id":"1510.02975","kind":"arxiv","version":1}},"canonical_sha256":"d267f0ce7c2d5b9fd76cab3a5faf7f0bf3eba5726298dac64aa6607249bdcb4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d267f0ce7c2d5b9fd76cab3a5faf7f0bf3eba5726298dac64aa6607249bdcb4b","first_computed_at":"2026-05-18T00:31:00.573997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:00.573997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8O75hCeb2RiBfYKHm6xZQFcUSJlJOVwiAM/RKjxLWgal0J++djXNlvF748nvV00jH9Uj5TXmoM8ikFyrxepwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:00.574531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4985d0f5a27f9899c314ff669a124648dcf17a2ef6b6e3be32f353fc8eb4f7fd","sha256:83ffd612637a294e0958510fcc8459a64d7b3b569f9dde063e1b46b9818f038e"],"state_sha256":"023b3cd6e4ecdbe51d67a4a5a24bb8b52d806b8e8f7955ef6d0c2880580ea1f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQdFFnQeQRgky0IXunJyj+mGPbDaBBLdt8RuMJsl/KxMV6g2gU+ytDuR0lraDLfvVJMH4uOuPRPbzhf/lNujBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:26:01.995195Z","bundle_sha256":"6b2eb815f519702097289a97798a750c3fb8940380bc90d56a501d111ee4cd3d"}}