{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CU6RNGANX4TR4PYHOTP3KT65NK","short_pith_number":"pith:CU6RNGAN","canonical_record":{"source":{"id":"1605.08638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-27T13:45:27Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"7f90c06b8fb90504d8399cbe32dfb0eb73076f1c262788bc587bffe1dde0f636","abstract_canon_sha256":"daf9686a27e444d1aa8c141305fa63c3a9fa4cc5cc3a648a6ff9ce6279ce0fbf"},"schema_version":"1.0"},"canonical_sha256":"153d16980dbf271e3f0774dfb54fdd6ab5686af9fb37719918b0d7c3bf70862f","source":{"kind":"arxiv","id":"1605.08638","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08638","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08638v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08638","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"CU6RNGANX4TR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CU6RNGANX4TR4PYH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CU6RNGAN","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CU6RNGANX4TR4PYHOTP3KT65NK","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-27T13:45:27Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"7f90c06b8fb90504d8399cbe32dfb0eb73076f1c262788bc587bffe1dde0f636","abstract_canon_sha256":"daf9686a27e444d1aa8c141305fa63c3a9fa4cc5cc3a648a6ff9ce6279ce0fbf"},"schema_version":"1.0"},"canonical_sha256":"153d16980dbf271e3f0774dfb54fdd6ab5686af9fb37719918b0d7c3bf70862f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.416117Z","signature_b64":"lQNvufYteqXAMJGyIcc/TjMZaJf8Ir+IQPj1RuwMI3g+nxEvG/YGSyO5CTMsGFoWDEi09exXAWpDrf/v65n/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"153d16980dbf271e3f0774dfb54fdd6ab5686af9fb37719918b0d7c3bf70862f","last_reissued_at":"2026-05-18T01:13:29.415510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.415510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08638","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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8BDy4CHHGXEvUz9OAxs/PIhsn3vtfwRjOdp2YjpG6FiPa5xlJy3h5aC3aqlVY8ufNkUTPYfDdoNRqYSy7EyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:38:56.602680Z"},"content_sha256":"f56f71ee893fd6ea26ed6a9921a94008709f9e2369b393573edad0886b4fc9a2","schema_version":"1.0","event_id":"sha256:f56f71ee893fd6ea26ed6a9921a94008709f9e2369b393573edad0886b4fc9a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CU6RNGANX4TR4PYHOTP3KT65NK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate implicitization using linear algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.NA","authors_text":"Oliver J. D. Barrowclough, Tor Dokken","submitted_at":"2016-05-27T13:45:27Z","abstract_excerpt":"In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating point implementation in computer aided geometric design (CAGD) systems. We unify the approaches under the names of commonly known polynomial basis functions, and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08638","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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCEWzLsEB4SrnTGNatKdJbqUbgh6GFWaT0Yqla1vTReG1PEzpewL4VezOKCWmHA99WoDfCVmfnIVR+gmk/+mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:38:56.603031Z"},"content_sha256":"519f7ad96f4467fd55da27b6be0bd49d0c11d5983ee66d42683c1f27fdbb233d","schema_version":"1.0","event_id":"sha256:519f7ad96f4467fd55da27b6be0bd49d0c11d5983ee66d42683c1f27fdbb233d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CU6RNGANX4TR4PYHOTP3KT65NK/bundle.json","state_url":"https://pith.science/pith/CU6RNGANX4TR4PYHOTP3KT65NK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CU6RNGANX4TR4PYHOTP3KT65NK/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-02T03:38:56Z","links":{"resolver":"https://pith.science/pith/CU6RNGANX4TR4PYHOTP3KT65NK","bundle":"https://pith.science/pith/CU6RNGANX4TR4PYHOTP3KT65NK/bundle.json","state":"https://pith.science/pith/CU6RNGANX4TR4PYHOTP3KT65NK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CU6RNGANX4TR4PYHOTP3KT65NK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CU6RNGANX4TR4PYHOTP3KT65NK","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":"daf9686a27e444d1aa8c141305fa63c3a9fa4cc5cc3a648a6ff9ce6279ce0fbf","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-27T13:45:27Z","title_canon_sha256":"7f90c06b8fb90504d8399cbe32dfb0eb73076f1c262788bc587bffe1dde0f636"},"schema_version":"1.0","source":{"id":"1605.08638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08638","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08638v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08638","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"CU6RNGANX4TR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CU6RNGANX4TR4PYH","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CU6RNGAN","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:519f7ad96f4467fd55da27b6be0bd49d0c11d5983ee66d42683c1f27fdbb233d","target":"graph","created_at":"2026-05-18T01:13:29Z","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 consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating point implementation in computer aided geometric design (CAGD) systems. We unify the approaches under the names of commonly known polynomial basis functions, and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomi","authors_text":"Oliver J. D. Barrowclough, Tor Dokken","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-27T13:45:27Z","title":"Approximate implicitization using linear algebra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08638","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:f56f71ee893fd6ea26ed6a9921a94008709f9e2369b393573edad0886b4fc9a2","target":"record","created_at":"2026-05-18T01:13:29Z","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":"daf9686a27e444d1aa8c141305fa63c3a9fa4cc5cc3a648a6ff9ce6279ce0fbf","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-27T13:45:27Z","title_canon_sha256":"7f90c06b8fb90504d8399cbe32dfb0eb73076f1c262788bc587bffe1dde0f636"},"schema_version":"1.0","source":{"id":"1605.08638","kind":"arxiv","version":1}},"canonical_sha256":"153d16980dbf271e3f0774dfb54fdd6ab5686af9fb37719918b0d7c3bf70862f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"153d16980dbf271e3f0774dfb54fdd6ab5686af9fb37719918b0d7c3bf70862f","first_computed_at":"2026-05-18T01:13:29.415510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.415510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lQNvufYteqXAMJGyIcc/TjMZaJf8Ir+IQPj1RuwMI3g+nxEvG/YGSyO5CTMsGFoWDEi09exXAWpDrf/v65n/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.416117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f56f71ee893fd6ea26ed6a9921a94008709f9e2369b393573edad0886b4fc9a2","sha256:519f7ad96f4467fd55da27b6be0bd49d0c11d5983ee66d42683c1f27fdbb233d"],"state_sha256":"4c5cfb41a2300976c6b1b17d27ffc55db320e5d1adb971e35afb2f1d47b1fe71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUomPUJ2XXEw622qnJFsuY5Sx0lT5SuDpQqsTQv3q+GFz5erbAl2VfvMuKXH16BgJ2gdmAof4PlIVKhLWEEoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:38:56.605005Z","bundle_sha256":"af5957966ecc61df1ec23a9a78c11386443132db1d63498f26661fc4460daf3d"}}