{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RIMF55KZA4OCXEYLZWVQFIF4ZF","short_pith_number":"pith:RIMF55KZ","canonical_record":{"source":{"id":"1206.3238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:18:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"432e5053dd5c7bed9457fd882f447ce34b930ac4ceae6581f861edf35e62a9c3","abstract_canon_sha256":"91ba9b75bb9e37b46b1824cd5c90fc1cebec9eef21d5fed26bb48e5c514b22fc"},"schema_version":"1.0"},"canonical_sha256":"8a185ef559071c2b930bcdab02a0bcc95eb1ea3cbd5bc01a19b87c66e5f4456d","source":{"kind":"arxiv","id":"1206.3238","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3238","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3238v1","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3238","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"RIMF55KZA4OC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RIMF55KZA4OCXEYL","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RIMF55KZ","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RIMF55KZA4OCXEYLZWVQFIF4ZF","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:18:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"432e5053dd5c7bed9457fd882f447ce34b930ac4ceae6581f861edf35e62a9c3","abstract_canon_sha256":"91ba9b75bb9e37b46b1824cd5c90fc1cebec9eef21d5fed26bb48e5c514b22fc"},"schema_version":"1.0"},"canonical_sha256":"8a185ef559071c2b930bcdab02a0bcc95eb1ea3cbd5bc01a19b87c66e5f4456d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:31.124947Z","signature_b64":"kiS/BAg94ZR9Ql0E0++o7p6leh31kPtnr3jz9Qyg4o5CB1x7tVbJeRjtXor2eY6gbVFLHCcGpmPhvTb8cvqUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a185ef559071c2b930bcdab02a0bcc95eb1ea3cbd5bc01a19b87c66e5f4456d","last_reissued_at":"2026-05-18T03:53:31.124422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:31.124422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3238","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-18T03:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8+M4tsLhE1ICEkxgz96yQeRnfAIDx0ZApumrmv7myMnt/JraRuTK/+l4GEZQamsvWc81yl+YXeTdbInMUTQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:18:31.156641Z"},"content_sha256":"855dcda4001a6d573111814282b1af00b253386af49d61fc8e83f9fa827cac82","schema_version":"1.0","event_id":"sha256:855dcda4001a6d573111814282b1af00b253386af49d61fc8e83f9fa827cac82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RIMF55KZA4OCXEYLZWVQFIF4ZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Block Coordinate Descent for Large Scale Gaussian Process Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cristian Sminchisescu, Liefeng Bo","submitted_at":"2012-06-13T14:18:22Z","abstract_excerpt":"We propose a variable decomposition algorithm -greedy block coordinate descent (GBCD)- in order to make dense Gaussian process regression practical for large scale problems. GBCD breaks a large scale optimization into a series of small sub-problems. The challenge in variable decomposition algorithms is the identification of a subproblem (the active set of variables) that yields the largest improvement. We analyze the limitations of existing methods and cast the active set selection into a zero-norm constrained optimization problem that we solve using greedy methods. By directly estimating the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3238","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-18T03:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQcjcp48Yyfx4tz/elndxXgI19zEhgZBAySwOgI+ZvfO1WgrigdnyHOLe7iDS4ohLyvyq+68AeHtT2n+Eu8QAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:18:31.156987Z"},"content_sha256":"78d3f2ced1117b87a46996bc8ed7a3285ab444758f5639ae46f3b538c609942f","schema_version":"1.0","event_id":"sha256:78d3f2ced1117b87a46996bc8ed7a3285ab444758f5639ae46f3b538c609942f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/bundle.json","state_url":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/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-05T00:18:31Z","links":{"resolver":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF","bundle":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/bundle.json","state":"https://pith.science/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIMF55KZA4OCXEYLZWVQFIF4ZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RIMF55KZA4OCXEYLZWVQFIF4ZF","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":"91ba9b75bb9e37b46b1824cd5c90fc1cebec9eef21d5fed26bb48e5c514b22fc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:18:22Z","title_canon_sha256":"432e5053dd5c7bed9457fd882f447ce34b930ac4ceae6581f861edf35e62a9c3"},"schema_version":"1.0","source":{"id":"1206.3238","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3238","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3238v1","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3238","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"RIMF55KZA4OC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RIMF55KZA4OCXEYL","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RIMF55KZ","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:78d3f2ced1117b87a46996bc8ed7a3285ab444758f5639ae46f3b538c609942f","target":"graph","created_at":"2026-05-18T03:53:31Z","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 propose a variable decomposition algorithm -greedy block coordinate descent (GBCD)- in order to make dense Gaussian process regression practical for large scale problems. GBCD breaks a large scale optimization into a series of small sub-problems. The challenge in variable decomposition algorithms is the identification of a subproblem (the active set of variables) that yields the largest improvement. We analyze the limitations of existing methods and cast the active set selection into a zero-norm constrained optimization problem that we solve using greedy methods. By directly estimating the ","authors_text":"Cristian Sminchisescu, Liefeng Bo","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:18:22Z","title":"Greedy Block Coordinate Descent for Large Scale Gaussian Process Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3238","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:855dcda4001a6d573111814282b1af00b253386af49d61fc8e83f9fa827cac82","target":"record","created_at":"2026-05-18T03:53:31Z","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":"91ba9b75bb9e37b46b1824cd5c90fc1cebec9eef21d5fed26bb48e5c514b22fc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:18:22Z","title_canon_sha256":"432e5053dd5c7bed9457fd882f447ce34b930ac4ceae6581f861edf35e62a9c3"},"schema_version":"1.0","source":{"id":"1206.3238","kind":"arxiv","version":1}},"canonical_sha256":"8a185ef559071c2b930bcdab02a0bcc95eb1ea3cbd5bc01a19b87c66e5f4456d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a185ef559071c2b930bcdab02a0bcc95eb1ea3cbd5bc01a19b87c66e5f4456d","first_computed_at":"2026-05-18T03:53:31.124422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:31.124422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kiS/BAg94ZR9Ql0E0++o7p6leh31kPtnr3jz9Qyg4o5CB1x7tVbJeRjtXor2eY6gbVFLHCcGpmPhvTb8cvqUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:31.124947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3238","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:855dcda4001a6d573111814282b1af00b253386af49d61fc8e83f9fa827cac82","sha256:78d3f2ced1117b87a46996bc8ed7a3285ab444758f5639ae46f3b538c609942f"],"state_sha256":"7bacbc8508b7fc00751ebc263954090a47759b62418d02b05e30d7896ddcc70e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcbUDzYCj5aBWM9gYnEq1AXTMAuOwpouTjFayv8wLuRQ/DH0BXqjDIofbFq2gibIB7U7G3pIr8Cymcm+RPGrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:18:31.159005Z","bundle_sha256":"aa3f25ffe030da3e32d56b804ef02b17a5139ed5c4fcca5bb10919cb8940343b"}}