{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XV7T3CNRNWNYRNJRF3LVGYQKNL","short_pith_number":"pith:XV7T3CNR","canonical_record":{"source":{"id":"1802.03773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-11T17:18:18Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"fca4b117a00b29b948a4fcfa92a4ff518c6270fbbe74c9858e41f0c26edbe10d","abstract_canon_sha256":"4bd48cea6166a30e39b3b02826720409fcdccfe1cb0d922e3e86de858dcd4fe3"},"schema_version":"1.0"},"canonical_sha256":"bd7f3d89b16d9b88b5312ed753620a6adb9b5daaa088bbe8484e24eb158a66ae","source":{"kind":"arxiv","id":"1802.03773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03773","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03773v1","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03773","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"XV7T3CNRNWNY","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XV7T3CNRNWNYRNJR","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XV7T3CNR","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XV7T3CNRNWNYRNJRF3LVGYQKNL","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-11T17:18:18Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"fca4b117a00b29b948a4fcfa92a4ff518c6270fbbe74c9858e41f0c26edbe10d","abstract_canon_sha256":"4bd48cea6166a30e39b3b02826720409fcdccfe1cb0d922e3e86de858dcd4fe3"},"schema_version":"1.0"},"canonical_sha256":"bd7f3d89b16d9b88b5312ed753620a6adb9b5daaa088bbe8484e24eb158a66ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:50.459003Z","signature_b64":"f8MwxrQn+2uV1bSZ+52bYdULR1lqyJ+CdgblDVq4eoJngb9JesRxNJM6VED7ZD8pN+D3EpqhKckYJBNGmDujDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd7f3d89b16d9b88b5312ed753620a6adb9b5daaa088bbe8484e24eb158a66ae","last_reissued_at":"2026-05-18T00:23:50.458508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:50.458508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03773","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:23:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBgpt4WPNu0nvzoCuJB7rZUi6TTvKqVWmFgf5Yk+8zAuP3AkafOijVprP7hDllF71jhWDcbi7SgifAK7yIT1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:40:49.666787Z"},"content_sha256":"a22b55dc8a039c282ba10b7dde20cd8f58014c1fce8740124e00ee2ecde25c18","schema_version":"1.0","event_id":"sha256:a22b55dc8a039c282ba10b7dde20cd8f58014c1fce8740124e00ee2ecde25c18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XV7T3CNRNWNYRNJRF3LVGYQKNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QRkit: Sparse, Composable QR Decompositions for Efficient and Stable Solutions to Problems in Computer Vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Andrew Fitzgibbon, Jan Svoboda, Thomas Cashman","submitted_at":"2018-02-11T17:18:18Z","abstract_excerpt":"Embedded computer vision applications increasingly require the speed and power benefits of single-precision (32 bit) floating point. However, applications which make use of Levenberg-like optimization can lose significant accuracy when reducing to single precision, sometimes unrecoverably so. This accuracy can be regained using solvers based on QR rather than Cholesky decomposition, but the absence of sparse QR solvers for common sparsity patterns found in computer vision means that many applications cannot benefit. We introduce an open-source suite of solvers for Eigen, which efficiently comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03773","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:23:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsdmuImcHfy4T16RZbRQC8g47r1EP1sqk4tlmpQvxZQuuEnG0gwG0PLGlgql0fSu1kV+bIkCyDpaFC9m9/XaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:40:49.667117Z"},"content_sha256":"d2d90087184134896ab284f38c58f3dbc7f85e421375849ca32d00d447892903","schema_version":"1.0","event_id":"sha256:d2d90087184134896ab284f38c58f3dbc7f85e421375849ca32d00d447892903"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XV7T3CNRNWNYRNJRF3LVGYQKNL/bundle.json","state_url":"https://pith.science/pith/XV7T3CNRNWNYRNJRF3LVGYQKNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XV7T3CNRNWNYRNJRF3LVGYQKNL/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-26T17:40:49Z","links":{"resolver":"https://pith.science/pith/XV7T3CNRNWNYRNJRF3LVGYQKNL","bundle":"https://pith.science/pith/XV7T3CNRNWNYRNJRF3LVGYQKNL/bundle.json","state":"https://pith.science/pith/XV7T3CNRNWNYRNJRF3LVGYQKNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XV7T3CNRNWNYRNJRF3LVGYQKNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XV7T3CNRNWNYRNJRF3LVGYQKNL","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":"4bd48cea6166a30e39b3b02826720409fcdccfe1cb0d922e3e86de858dcd4fe3","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-11T17:18:18Z","title_canon_sha256":"fca4b117a00b29b948a4fcfa92a4ff518c6270fbbe74c9858e41f0c26edbe10d"},"schema_version":"1.0","source":{"id":"1802.03773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03773","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03773v1","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03773","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"XV7T3CNRNWNY","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XV7T3CNRNWNYRNJR","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XV7T3CNR","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:d2d90087184134896ab284f38c58f3dbc7f85e421375849ca32d00d447892903","target":"graph","created_at":"2026-05-18T00:23:50Z","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":"Embedded computer vision applications increasingly require the speed and power benefits of single-precision (32 bit) floating point. However, applications which make use of Levenberg-like optimization can lose significant accuracy when reducing to single precision, sometimes unrecoverably so. This accuracy can be regained using solvers based on QR rather than Cholesky decomposition, but the absence of sparse QR solvers for common sparsity patterns found in computer vision means that many applications cannot benefit. We introduce an open-source suite of solvers for Eigen, which efficiently comp","authors_text":"Andrew Fitzgibbon, Jan Svoboda, Thomas Cashman","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-11T17:18:18Z","title":"QRkit: Sparse, Composable QR Decompositions for Efficient and Stable Solutions to Problems in Computer Vision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03773","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:a22b55dc8a039c282ba10b7dde20cd8f58014c1fce8740124e00ee2ecde25c18","target":"record","created_at":"2026-05-18T00:23:50Z","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":"4bd48cea6166a30e39b3b02826720409fcdccfe1cb0d922e3e86de858dcd4fe3","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2018-02-11T17:18:18Z","title_canon_sha256":"fca4b117a00b29b948a4fcfa92a4ff518c6270fbbe74c9858e41f0c26edbe10d"},"schema_version":"1.0","source":{"id":"1802.03773","kind":"arxiv","version":1}},"canonical_sha256":"bd7f3d89b16d9b88b5312ed753620a6adb9b5daaa088bbe8484e24eb158a66ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd7f3d89b16d9b88b5312ed753620a6adb9b5daaa088bbe8484e24eb158a66ae","first_computed_at":"2026-05-18T00:23:50.458508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:50.458508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f8MwxrQn+2uV1bSZ+52bYdULR1lqyJ+CdgblDVq4eoJngb9JesRxNJM6VED7ZD8pN+D3EpqhKckYJBNGmDujDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:50.459003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a22b55dc8a039c282ba10b7dde20cd8f58014c1fce8740124e00ee2ecde25c18","sha256:d2d90087184134896ab284f38c58f3dbc7f85e421375849ca32d00d447892903"],"state_sha256":"119a7e95aaaafdca475731817724a60c9a42c0f5d46443b45d8096b002b7cae3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAKak70abJ/5Y5TSfpFZO7tREmiYqjdWSB4lqhNQDog/gqAmQxZebQ3iNxxESA1+6k9vqyRc7L/2gIRLwEy1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T17:40:49.668935Z","bundle_sha256":"9bdbb7314816ced673ff143399bc49675834c418c9c44aa4b7daa806b3750a81"}}