{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VQYHWWMYD5WF3UI22KOM3SXQRT","short_pith_number":"pith:VQYHWWMY","canonical_record":{"source":{"id":"1205.1868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-09T04:22:23Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8e4171e7dee5712fc5e6a3d67243ba978bbf46708bdc0fcb0c539e993143962e","abstract_canon_sha256":"ec591cbc2d236efc4a54a327c9a2efb1a65e120bcdc10bf2cbc3c789b563a50c"},"schema_version":"1.0"},"canonical_sha256":"ac307b59981f6c5dd11ad29ccdcaf08cd4e9c715524fd624f3299fe3213b6430","source":{"kind":"arxiv","id":"1205.1868","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1868","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1868v2","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1868","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"VQYHWWMYD5WF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VQYHWWMYD5WF3UI2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VQYHWWMY","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VQYHWWMYD5WF3UI22KOM3SXQRT","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-09T04:22:23Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8e4171e7dee5712fc5e6a3d67243ba978bbf46708bdc0fcb0c539e993143962e","abstract_canon_sha256":"ec591cbc2d236efc4a54a327c9a2efb1a65e120bcdc10bf2cbc3c789b563a50c"},"schema_version":"1.0"},"canonical_sha256":"ac307b59981f6c5dd11ad29ccdcaf08cd4e9c715524fd624f3299fe3213b6430","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:46.210638Z","signature_b64":"oZz58jfWW+An7oUsMKtw1nptbqAmCjS0+hZk1RUOKjkDPc302+w3IhiskMYVSvMbL4IQX3XROVwv77J6j3MWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac307b59981f6c5dd11ad29ccdcaf08cd4e9c715524fd624f3299fe3213b6430","last_reissued_at":"2026-05-18T03:55:46.210148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:46.210148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1868","source_version":2,"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:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrELRqFZ5a307bIjCW0eE/hKasYeeS2EAsIsg9zDDkdGOgHYzJydOlzj92tOzIKlbezcQ1tYgH2R+bpOzVr0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:23:29.757921Z"},"content_sha256":"5c79091d8c5f0833591d9c184ba8dcd5bed3ad9680fd1e1cadb0cf3bc0173016","schema_version":"1.0","event_id":"sha256:5c79091d8c5f0833591d9c184ba8dcd5bed3ad9680fd1e1cadb0cf3bc0173016"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VQYHWWMYD5WF3UI22KOM3SXQRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Rank Estimation of Similarities on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Pedro Rangel, Vladimir Koltchinskii","submitted_at":"2012-05-09T04:22:23Z","abstract_excerpt":"Let (V, E) be a graph with vertex set V and edge set E. Let (X, X', Y) \\in V \\times V \\times {-1, 1} be a random triple, where X, X' are independent uniformly distributed vertices and Y is a label indicating whether X, X' are \"similar\" (Y = +1), or not (Y = -1). Our goal is to estimate the regression function S\\ast (u, v) = E(Y |X = u, X = v), u, v \\in V based on training data consisting of n i.i.d. copies of (X, X',Y). We are interested in this problem in the case when S\\ast is a symmetric low rank kernel and, in addition to this, it is assumed that S\\ast is \"smooth\" on the graph. We study es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1868","kind":"arxiv","version":2},"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:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tteDundLgm5CCNLSXWlbP+PZQpsjCePAcfirwXC8uqgVfXhDggjcuXWIsgAsGPfCqyxa65+i3lwBIL1uE4dFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:23:29.758263Z"},"content_sha256":"b8059e6513127951601dc81b4336a1cae414acaf01f11974b0ed77739732e310","schema_version":"1.0","event_id":"sha256:b8059e6513127951601dc81b4336a1cae414acaf01f11974b0ed77739732e310"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/bundle.json","state_url":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/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-05-31T10:23:29Z","links":{"resolver":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT","bundle":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/bundle.json","state":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VQYHWWMYD5WF3UI22KOM3SXQRT","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":"ec591cbc2d236efc4a54a327c9a2efb1a65e120bcdc10bf2cbc3c789b563a50c","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-09T04:22:23Z","title_canon_sha256":"8e4171e7dee5712fc5e6a3d67243ba978bbf46708bdc0fcb0c539e993143962e"},"schema_version":"1.0","source":{"id":"1205.1868","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1868","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1868v2","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1868","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"VQYHWWMYD5WF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VQYHWWMYD5WF3UI2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VQYHWWMY","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:b8059e6513127951601dc81b4336a1cae414acaf01f11974b0ed77739732e310","target":"graph","created_at":"2026-05-18T03:55:46Z","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":"Let (V, E) be a graph with vertex set V and edge set E. Let (X, X', Y) \\in V \\times V \\times {-1, 1} be a random triple, where X, X' are independent uniformly distributed vertices and Y is a label indicating whether X, X' are \"similar\" (Y = +1), or not (Y = -1). Our goal is to estimate the regression function S\\ast (u, v) = E(Y |X = u, X = v), u, v \\in V based on training data consisting of n i.i.d. copies of (X, X',Y). We are interested in this problem in the case when S\\ast is a symmetric low rank kernel and, in addition to this, it is assumed that S\\ast is \"smooth\" on the graph. We study es","authors_text":"Pedro Rangel, Vladimir Koltchinskii","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-09T04:22:23Z","title":"Low Rank Estimation of Similarities on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1868","kind":"arxiv","version":2},"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:5c79091d8c5f0833591d9c184ba8dcd5bed3ad9680fd1e1cadb0cf3bc0173016","target":"record","created_at":"2026-05-18T03:55:46Z","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":"ec591cbc2d236efc4a54a327c9a2efb1a65e120bcdc10bf2cbc3c789b563a50c","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-09T04:22:23Z","title_canon_sha256":"8e4171e7dee5712fc5e6a3d67243ba978bbf46708bdc0fcb0c539e993143962e"},"schema_version":"1.0","source":{"id":"1205.1868","kind":"arxiv","version":2}},"canonical_sha256":"ac307b59981f6c5dd11ad29ccdcaf08cd4e9c715524fd624f3299fe3213b6430","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac307b59981f6c5dd11ad29ccdcaf08cd4e9c715524fd624f3299fe3213b6430","first_computed_at":"2026-05-18T03:55:46.210148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:46.210148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oZz58jfWW+An7oUsMKtw1nptbqAmCjS0+hZk1RUOKjkDPc302+w3IhiskMYVSvMbL4IQX3XROVwv77J6j3MWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:46.210638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1868","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c79091d8c5f0833591d9c184ba8dcd5bed3ad9680fd1e1cadb0cf3bc0173016","sha256:b8059e6513127951601dc81b4336a1cae414acaf01f11974b0ed77739732e310"],"state_sha256":"301b3f538743e0b54cd7d2a664cc1e84c5c8548f7f00a91cdf01af4b350cdad7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UK2yGAOgXLpDH+ixtDqHJsJ5Lx/lGp0GaFf8o0ug3QjoBPBD/MIL06SOI3MsaQ5xdMEOfdMjYL8cLI+7I1OQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:23:29.760213Z","bundle_sha256":"64e0bf2244be211d73e38be0e78f649a0187b54c484db894b0f389348ce47384"}}