{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VKQW7OHORLFMNSCKDYN2UDRK7E","short_pith_number":"pith:VKQW7OHO","schema_version":"1.0","canonical_sha256":"aaa16fb8ee8acac6c84a1e1baa0e2af937a48436d3dbf040583d577a81506598","source":{"kind":"arxiv","id":"2310.19450","version":3},"attestation_state":"computed","paper":{"title":"Hodge-Compositional Edge Gaussian Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Elvin Isufi, Maosheng Yang, Viacheslav Borovitskiy","submitted_at":"2023-10-30T11:22:25Z","abstract_excerpt":"We propose principled Gaussian processes (GPs) for modeling functions defined over the edge set of a simplicial 2-complex, a structure similar to a graph in which edges may form triangular faces. This approach is intended for learning flow-type data on networks where edge flows can be characterized by the discrete divergence and curl. Drawing upon the Hodge decomposition, we first develop classes of divergence-free and curl-free edge GPs, suitable for various applications. We then combine them to create \\emph{Hodge-compositional edge GPs} that are expressive enough to represent any edge functi"},"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":"2310.19450","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-10-30T11:22:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f5624a4ecdcf1ab44331b44570d3c763b17747f1800a861f38065f8b90834002","abstract_canon_sha256":"7e0cab82c7fcf285e47e57488a7003fcdb5c07404bad4e40b109222fda925acb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:34.681009Z","signature_b64":"Gan5ZDHPIys002L7s2OjImbawcb5u0ANnPy0AahlWv73JnU8HGFNqs2EP50OmspDS4w4RkKPHHNsxIzJ4vfuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaa16fb8ee8acac6c84a1e1baa0e2af937a48436d3dbf040583d577a81506598","last_reissued_at":"2026-07-05T07:51:34.680569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:34.680569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hodge-Compositional Edge Gaussian Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Elvin Isufi, Maosheng Yang, Viacheslav Borovitskiy","submitted_at":"2023-10-30T11:22:25Z","abstract_excerpt":"We propose principled Gaussian processes (GPs) for modeling functions defined over the edge set of a simplicial 2-complex, a structure similar to a graph in which edges may form triangular faces. This approach is intended for learning flow-type data on networks where edge flows can be characterized by the discrete divergence and curl. Drawing upon the Hodge decomposition, we first develop classes of divergence-free and curl-free edge GPs, suitable for various applications. We then combine them to create \\emph{Hodge-compositional edge GPs} that are expressive enough to represent any edge functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19450","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/2310.19450/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":"2310.19450","created_at":"2026-07-05T07:51:34.680618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.19450v3","created_at":"2026-07-05T07:51:34.680618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19450","created_at":"2026-07-05T07:51:34.680618+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKQW7OHORLFM","created_at":"2026-07-05T07:51:34.680618+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKQW7OHORLFMNSCK","created_at":"2026-07-05T07:51:34.680618+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKQW7OHO","created_at":"2026-07-05T07:51:34.680618+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22853","citing_title":"Topological Signal Processing: An Application-Oriented Tutorial","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E","json":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E.json","graph_json":"https://pith.science/api/pith-number/VKQW7OHORLFMNSCKDYN2UDRK7E/graph.json","events_json":"https://pith.science/api/pith-number/VKQW7OHORLFMNSCKDYN2UDRK7E/events.json","paper":"https://pith.science/paper/VKQW7OHO"},"agent_actions":{"view_html":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E","download_json":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E.json","view_paper":"https://pith.science/paper/VKQW7OHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.19450&json=true","fetch_graph":"https://pith.science/api/pith-number/VKQW7OHORLFMNSCKDYN2UDRK7E/graph.json","fetch_events":"https://pith.science/api/pith-number/VKQW7OHORLFMNSCKDYN2UDRK7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E/action/storage_attestation","attest_author":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E/action/author_attestation","sign_citation":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E/action/citation_signature","submit_replication":"https://pith.science/pith/VKQW7OHORLFMNSCKDYN2UDRK7E/action/replication_record"}},"created_at":"2026-07-05T07:51:34.680618+00:00","updated_at":"2026-07-05T07:51:34.680618+00:00"}