{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UD3JM77U727VQ4S3BGBPOGGFTV","short_pith_number":"pith:UD3JM77U","canonical_record":{"source":{"id":"1312.3134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T12:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"c86f511440607f64e621924da95d235f66c0b570edad82129b268aa575adcf3c","abstract_canon_sha256":"aba26bd135b5dd61df9cfd3a0681cdbdba376dbe048cd2ae7a1f1af22155d3b6"},"schema_version":"1.0"},"canonical_sha256":"a0f6967ff4febf58725b0982f718c59d4e5457a946fad099e4f4211944b67604","source":{"kind":"arxiv","id":"1312.3134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3134","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3134v1","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3134","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"UD3JM77U727V","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UD3JM77U727VQ4S3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UD3JM77U","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UD3JM77U727VQ4S3BGBPOGGFTV","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T12:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"c86f511440607f64e621924da95d235f66c0b570edad82129b268aa575adcf3c","abstract_canon_sha256":"aba26bd135b5dd61df9cfd3a0681cdbdba376dbe048cd2ae7a1f1af22155d3b6"},"schema_version":"1.0"},"canonical_sha256":"a0f6967ff4febf58725b0982f718c59d4e5457a946fad099e4f4211944b67604","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.504564Z","signature_b64":"sO50VnJj/6vjQ3S6oCdj9kGBa8dTpKFlrs+S+2mNgvkbx6p/ZZBcbu/LX9HbFpy5xzbdOwDz1kwhPB7J8PwECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0f6967ff4febf58725b0982f718c59d4e5457a946fad099e4f4211944b67604","last_reissued_at":"2026-05-18T00:59:03.504013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.504013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3134","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:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1QOHeJvgmhA/ntdrnOQJpA14z4KMbqx90aw/5cVtNjXAC7WywksskyaM2QXlcRmv3Dohq8I1aS/s7BS9HrYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:29:25.546644Z"},"content_sha256":"7db98544ac0e85c40ab7e4efabb0f44e35429824b1f7f61703b4112d1551cd9b","schema_version":"1.0","event_id":"sha256:7db98544ac0e85c40ab7e4efabb0f44e35429824b1f7f61703b4112d1551cd9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UD3JM77U727VQ4S3BGBPOGGFTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph Unterrieder, Mario Huemer, Michael Lunglmayr","submitted_at":"2013-12-11T12:14:08Z","abstract_excerpt":"We present a novel iterative algorithm for approximating the linear least squares solution with low complexity. After a motivation of the algorithm we discuss the algorithm's properties including its complexity, and we present theoretical results as well as simulation based performance results. We describe the analysis of its convergence behavior and show that in the noise free case the algorithm converges to the least squares solution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3134","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:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0DZo/dgxbcrcVTgnyxTRfz3tQrTGasffmFMl9h97zFEQ2OHZ1vOJJIRf8CUjkOSHq2gFLJmNDruCaMOWUxMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:29:25.547346Z"},"content_sha256":"4e6413526cb52f127b199980660481f32e04675c34989b2eaa4a4c41669db75c","schema_version":"1.0","event_id":"sha256:4e6413526cb52f127b199980660481f32e04675c34989b2eaa4a4c41669db75c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UD3JM77U727VQ4S3BGBPOGGFTV/bundle.json","state_url":"https://pith.science/pith/UD3JM77U727VQ4S3BGBPOGGFTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UD3JM77U727VQ4S3BGBPOGGFTV/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-11T05:29:25Z","links":{"resolver":"https://pith.science/pith/UD3JM77U727VQ4S3BGBPOGGFTV","bundle":"https://pith.science/pith/UD3JM77U727VQ4S3BGBPOGGFTV/bundle.json","state":"https://pith.science/pith/UD3JM77U727VQ4S3BGBPOGGFTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UD3JM77U727VQ4S3BGBPOGGFTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UD3JM77U727VQ4S3BGBPOGGFTV","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":"aba26bd135b5dd61df9cfd3a0681cdbdba376dbe048cd2ae7a1f1af22155d3b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T12:14:08Z","title_canon_sha256":"c86f511440607f64e621924da95d235f66c0b570edad82129b268aa575adcf3c"},"schema_version":"1.0","source":{"id":"1312.3134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3134","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3134v1","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3134","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"UD3JM77U727V","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UD3JM77U727VQ4S3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UD3JM77U","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:4e6413526cb52f127b199980660481f32e04675c34989b2eaa4a4c41669db75c","target":"graph","created_at":"2026-05-18T00:59:03Z","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":"We present a novel iterative algorithm for approximating the linear least squares solution with low complexity. After a motivation of the algorithm we discuss the algorithm's properties including its complexity, and we present theoretical results as well as simulation based performance results. We describe the analysis of its convergence behavior and show that in the noise free case the algorithm converges to the least squares solution.","authors_text":"Christoph Unterrieder, Mario Huemer, Michael Lunglmayr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T12:14:08Z","title":"Approximate Least Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3134","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:7db98544ac0e85c40ab7e4efabb0f44e35429824b1f7f61703b4112d1551cd9b","target":"record","created_at":"2026-05-18T00:59:03Z","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":"aba26bd135b5dd61df9cfd3a0681cdbdba376dbe048cd2ae7a1f1af22155d3b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-11T12:14:08Z","title_canon_sha256":"c86f511440607f64e621924da95d235f66c0b570edad82129b268aa575adcf3c"},"schema_version":"1.0","source":{"id":"1312.3134","kind":"arxiv","version":1}},"canonical_sha256":"a0f6967ff4febf58725b0982f718c59d4e5457a946fad099e4f4211944b67604","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0f6967ff4febf58725b0982f718c59d4e5457a946fad099e4f4211944b67604","first_computed_at":"2026-05-18T00:59:03.504013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:03.504013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sO50VnJj/6vjQ3S6oCdj9kGBa8dTpKFlrs+S+2mNgvkbx6p/ZZBcbu/LX9HbFpy5xzbdOwDz1kwhPB7J8PwECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:03.504564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7db98544ac0e85c40ab7e4efabb0f44e35429824b1f7f61703b4112d1551cd9b","sha256:4e6413526cb52f127b199980660481f32e04675c34989b2eaa4a4c41669db75c"],"state_sha256":"cb17bed3b5315201159a1a556059768728512d20437a4b9f38a3bac58d0c3d1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wv7ysApH7Fkyc8BeIjh9MPpBEgozDD/CcyPk5+9nPttsIshO1DCbNisxscGZ348NtrIfAfBb7kcolpkra72oBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:29:25.551327Z","bundle_sha256":"aee3cb957f0185fd4d2679cf0089e67b8d8e84fd0e0d7169f1e046f1c3e50d00"}}