{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GJZM5MLRQIQI3INJHMIVJNNMXL","short_pith_number":"pith:GJZM5MLR","canonical_record":{"source":{"id":"1202.5918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T13:08:33Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"a00359d3331b8909fdc7323479c489d33341ef9e445e0c398db5e09571da05ae","abstract_canon_sha256":"6adf7785754298a16c611c5a60ed676021bb1c751dca545a788c4c060b017ce0"},"schema_version":"1.0"},"canonical_sha256":"3272ceb17182208da1a93b1154b5acbac7e0561a79f21b41b41e8538eda1103c","source":{"kind":"arxiv","id":"1202.5918","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5918","created_at":"2026-05-18T03:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5918v3","created_at":"2026-05-18T03:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5918","created_at":"2026-05-18T03:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"GJZM5MLRQIQI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GJZM5MLRQIQI3INJ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GJZM5MLR","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GJZM5MLRQIQI3INJHMIVJNNMXL","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T13:08:33Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"a00359d3331b8909fdc7323479c489d33341ef9e445e0c398db5e09571da05ae","abstract_canon_sha256":"6adf7785754298a16c611c5a60ed676021bb1c751dca545a788c4c060b017ce0"},"schema_version":"1.0"},"canonical_sha256":"3272ceb17182208da1a93b1154b5acbac7e0561a79f21b41b41e8538eda1103c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:29.432605Z","signature_b64":"0p/nga39z08PjFRQVA1moU8hMqb1TumHkr5A3my31xKqp1UWRUQTOgbBXtx8DlUMIaJ8DGg9RAUglQb3ZfY8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3272ceb17182208da1a93b1154b5acbac7e0561a79f21b41b41e8538eda1103c","last_reissued_at":"2026-05-18T03:41:29.432016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:29.432016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5918","source_version":3,"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:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xu56B/cj77ayPhv7cXZ3cVuvYNFGE4btUkQv3mF7A1NRDkHe5HqXGbCmLCg97DlCpd1MXGzzSS5IB0ut2F1xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:49:30.707770Z"},"content_sha256":"aa2cc862e39327193e8e808db4ab1b4576a57a003dfd34827d5cfd7cf09c67a5","schema_version":"1.0","event_id":"sha256:aa2cc862e39327193e8e808db4ab1b4576a57a003dfd34827d5cfd7cf09c67a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GJZM5MLRQIQI3INJHMIVJNNMXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Replica theory for learning curves for Gaussian processes on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"stat.ML","authors_text":"Matthew J. Urry, Peter Sollich","submitted_at":"2012-02-27T13:08:33Z","abstract_excerpt":"Statistical physics approaches can be used to derive accurate predictions for the performance of inference methods learning from potentially noisy data, as quantified by the learning curve defined as the average error versus number of training examples. We analyse a challenging problem in the area of non-parametric inference where an effectively infinite number of parameters has to be learned, specifically Gaussian process regression. When the inputs are vertices on a random graph and the outputs noisy function values, we show that replica techniques can be used to obtain exact performance pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5918","kind":"arxiv","version":3},"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:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQsBWFhB634Or7kbo8NYDNqzBS64uaIFehqp4o6d65l++sMubQRh+Wmd5BQhakJRdWjhCliIAe1bQF39+21VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:49:30.708118Z"},"content_sha256":"f4acc572baa425f15ad3f7ee924a76d7ff0f10428dc81363460937129c855ead","schema_version":"1.0","event_id":"sha256:f4acc572baa425f15ad3f7ee924a76d7ff0f10428dc81363460937129c855ead"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJZM5MLRQIQI3INJHMIVJNNMXL/bundle.json","state_url":"https://pith.science/pith/GJZM5MLRQIQI3INJHMIVJNNMXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJZM5MLRQIQI3INJHMIVJNNMXL/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-03T04:49:30Z","links":{"resolver":"https://pith.science/pith/GJZM5MLRQIQI3INJHMIVJNNMXL","bundle":"https://pith.science/pith/GJZM5MLRQIQI3INJHMIVJNNMXL/bundle.json","state":"https://pith.science/pith/GJZM5MLRQIQI3INJHMIVJNNMXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJZM5MLRQIQI3INJHMIVJNNMXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GJZM5MLRQIQI3INJHMIVJNNMXL","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":"6adf7785754298a16c611c5a60ed676021bb1c751dca545a788c4c060b017ce0","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T13:08:33Z","title_canon_sha256":"a00359d3331b8909fdc7323479c489d33341ef9e445e0c398db5e09571da05ae"},"schema_version":"1.0","source":{"id":"1202.5918","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5918","created_at":"2026-05-18T03:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5918v3","created_at":"2026-05-18T03:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5918","created_at":"2026-05-18T03:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"GJZM5MLRQIQI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GJZM5MLRQIQI3INJ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GJZM5MLR","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:f4acc572baa425f15ad3f7ee924a76d7ff0f10428dc81363460937129c855ead","target":"graph","created_at":"2026-05-18T03:41: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":"Statistical physics approaches can be used to derive accurate predictions for the performance of inference methods learning from potentially noisy data, as quantified by the learning curve defined as the average error versus number of training examples. We analyse a challenging problem in the area of non-parametric inference where an effectively infinite number of parameters has to be learned, specifically Gaussian process regression. When the inputs are vertices on a random graph and the outputs noisy function values, we show that replica techniques can be used to obtain exact performance pre","authors_text":"Matthew J. Urry, Peter Sollich","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T13:08:33Z","title":"Replica theory for learning curves for Gaussian processes on random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5918","kind":"arxiv","version":3},"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:aa2cc862e39327193e8e808db4ab1b4576a57a003dfd34827d5cfd7cf09c67a5","target":"record","created_at":"2026-05-18T03:41: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":"6adf7785754298a16c611c5a60ed676021bb1c751dca545a788c4c060b017ce0","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-02-27T13:08:33Z","title_canon_sha256":"a00359d3331b8909fdc7323479c489d33341ef9e445e0c398db5e09571da05ae"},"schema_version":"1.0","source":{"id":"1202.5918","kind":"arxiv","version":3}},"canonical_sha256":"3272ceb17182208da1a93b1154b5acbac7e0561a79f21b41b41e8538eda1103c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3272ceb17182208da1a93b1154b5acbac7e0561a79f21b41b41e8538eda1103c","first_computed_at":"2026-05-18T03:41:29.432016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:29.432016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0p/nga39z08PjFRQVA1moU8hMqb1TumHkr5A3my31xKqp1UWRUQTOgbBXtx8DlUMIaJ8DGg9RAUglQb3ZfY8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:29.432605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5918","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa2cc862e39327193e8e808db4ab1b4576a57a003dfd34827d5cfd7cf09c67a5","sha256:f4acc572baa425f15ad3f7ee924a76d7ff0f10428dc81363460937129c855ead"],"state_sha256":"e1567ebfafe63e2cffb38736c6ac233bd8113477b4d9c75c9e0c4391bbd11f09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvQS/AiAhIxBOuT7iCuuJDUdP4K9USQgOVFNqP/zThiN+y6x/8nj8yqhPMjqs7P4MbyNlj9OiacJwewjJrWPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:49:30.710071Z","bundle_sha256":"4a38a5167a63eb254c68bfbde6f93b8c1b2c76fef329de9829a6b404fe5f9b97"}}