{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FH5UL2KAXAP35SEA25LJFZBTIS","short_pith_number":"pith:FH5UL2KA","schema_version":"1.0","canonical_sha256":"29fb45e940b81fbec880d75692e433449091bd97538ed2390a779a1142673949","source":{"kind":"arxiv","id":"2211.01689","version":3},"attestation_state":"computed","paper":{"title":"Isotropic Gaussian Processes on Finite Spaces of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andreas Krause, Mohammad Reza Karimi, Viacheslav Borovitskiy, Vignesh Ram Somnath","submitted_at":"2022-11-03T10:18:17Z","abstract_excerpt":"We propose a principled way to define Gaussian process priors on various sets of unweighted graphs: directed or undirected, with or without loops. We endow each of these sets with a geometric structure, inducing the notions of closeness and symmetries, by turning them into a vertex set of an appropriate metagraph. Building on this, we describe the class of priors that respect this structure and are analogous to the Euclidean isotropic processes, like squared exponential or Mat\\'ern. We propose an efficient computational technique for the ostensibly intractable problem of evaluating these prior"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2211.01689","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-11-03T10:18:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cc99e5ec427df260ef6c30e830c9545fc828a5032e89d6f8663215b7b59de3cc","abstract_canon_sha256":"d8eb090d1248acbe12790be8894eee08b9b36fd54a77cafd569a1a341268932f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:34.746717Z","signature_b64":"Ur6vjDl2efnCgK+NSf8+4oZUIjLl1FLi5CqBsbr1QIeqIFKSiiP9PARCGr8L3DCwNcpnGguTyPNxIJ7G9YHqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29fb45e940b81fbec880d75692e433449091bd97538ed2390a779a1142673949","last_reissued_at":"2026-07-05T05:45:34.746273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:34.746273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isotropic Gaussian Processes on Finite Spaces of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andreas Krause, Mohammad Reza Karimi, Viacheslav Borovitskiy, Vignesh Ram Somnath","submitted_at":"2022-11-03T10:18:17Z","abstract_excerpt":"We propose a principled way to define Gaussian process priors on various sets of unweighted graphs: directed or undirected, with or without loops. We endow each of these sets with a geometric structure, inducing the notions of closeness and symmetries, by turning them into a vertex set of an appropriate metagraph. Building on this, we describe the class of priors that respect this structure and are analogous to the Euclidean isotropic processes, like squared exponential or Mat\\'ern. We propose an efficient computational technique for the ostensibly intractable problem of evaluating these prior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01689","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.01689/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.01689","created_at":"2026-07-05T05:45:34.746341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01689v3","created_at":"2026-07-05T05:45:34.746341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01689","created_at":"2026-07-05T05:45:34.746341+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH5UL2KAXAP3","created_at":"2026-07-05T05:45:34.746341+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH5UL2KAXAP35SEA","created_at":"2026-07-05T05:45:34.746341+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH5UL2KA","created_at":"2026-07-05T05:45:34.746341+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS","json":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS.json","graph_json":"https://pith.science/api/pith-number/FH5UL2KAXAP35SEA25LJFZBTIS/graph.json","events_json":"https://pith.science/api/pith-number/FH5UL2KAXAP35SEA25LJFZBTIS/events.json","paper":"https://pith.science/paper/FH5UL2KA"},"agent_actions":{"view_html":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS","download_json":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS.json","view_paper":"https://pith.science/paper/FH5UL2KA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01689&json=true","fetch_graph":"https://pith.science/api/pith-number/FH5UL2KAXAP35SEA25LJFZBTIS/graph.json","fetch_events":"https://pith.science/api/pith-number/FH5UL2KAXAP35SEA25LJFZBTIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS/action/storage_attestation","attest_author":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS/action/author_attestation","sign_citation":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS/action/citation_signature","submit_replication":"https://pith.science/pith/FH5UL2KAXAP35SEA25LJFZBTIS/action/replication_record"}},"created_at":"2026-07-05T05:45:34.746341+00:00","updated_at":"2026-07-05T05:45:34.746341+00:00"}