{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3GMLAK2AFYIU4ZLR27CD7KF6MC","short_pith_number":"pith:3GMLAK2A","canonical_record":{"source":{"id":"2012.06333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-08T01:19:48Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"975c65dadfc04acc5c8b345d0dbfc8d92d6f72c3fa791e1c3adb06c2cdb42e72","abstract_canon_sha256":"d563a92da48ed84ddbcb90a2c24b72481bf6352895dfe9c655348427a07ef3ed"},"schema_version":"1.0"},"canonical_sha256":"d998b02b402e114e6571d7c43fa8be60a864456a89cb4a604196a73cf151d74e","source":{"kind":"arxiv","id":"2012.06333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06333","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06333v1","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06333","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"3GMLAK2AFYIU","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GMLAK2AFYIU4ZLR","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GMLAK2A","created_at":"2026-07-05T01:58:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3GMLAK2AFYIU4ZLR27CD7KF6MC","target":"record","payload":{"canonical_record":{"source":{"id":"2012.06333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-08T01:19:48Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"975c65dadfc04acc5c8b345d0dbfc8d92d6f72c3fa791e1c3adb06c2cdb42e72","abstract_canon_sha256":"d563a92da48ed84ddbcb90a2c24b72481bf6352895dfe9c655348427a07ef3ed"},"schema_version":"1.0"},"canonical_sha256":"d998b02b402e114e6571d7c43fa8be60a864456a89cb4a604196a73cf151d74e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:50.529670Z","signature_b64":"bQMs58KswmUPNBlcIj4r/oef8bHBk/HIVaz7K7V2kz1fNL5AjdxAyAKmwATX+7O31cgWplFH+kXt0OLY3Qx2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d998b02b402e114e6571d7c43fa8be60a864456a89cb4a604196a73cf151d74e","last_reissued_at":"2026-07-05T01:58:50.529241Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:50.529241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.06333","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-07-05T01:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdaSXnzCPqwvr5mJ/sLmQesrXtEfjkFnJoawK12HZQGwtLjmk+yzS59UmN5HvCHwJmEGQo8IJfLJZKC1ahFRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T01:54:53.004586Z"},"content_sha256":"3466e5b3602d1dbbb98959c2bc84a06cc75a390442ebe3cb331fe3daeb37d4fe","schema_version":"1.0","event_id":"sha256:3466e5b3602d1dbbb98959c2bc84a06cc75a390442ebe3cb331fe3daeb37d4fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3GMLAK2AFYIU4ZLR27CD7KF6MC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sheaf Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"cs.LG","authors_text":"Jakob Hansen, Thomas Gebhart","submitted_at":"2020-12-08T01:19:48Z","abstract_excerpt":"We present a generalization of graph convolutional networks by generalizing the diffusion operation underlying this class of graph neural networks. These sheaf neural networks are based on the sheaf Laplacian, a generalization of the graph Laplacian that encodes additional relational structure parameterized by the underlying graph. The sheaf Laplacian and associated matrices provide an extended version of the diffusion operation in graph convolutional networks, providing a proper generalization for domains where relations between nodes are non-constant, asymmetric, and varying in dimension. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06333","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.06333/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"},"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-07-05T01:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7CWO0APz5ptAMCl5p9NZ0kdofgOzA1GXCWqf0e8wNF23L41epSpBIdD+L+s7AlRHX2Rh3fxuZGIp/pZqUrBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T01:54:53.004900Z"},"content_sha256":"ccfe36e3f954d828c4acb911da3147e5ce8b0f8b875b9d43b8eceec947552562","schema_version":"1.0","event_id":"sha256:ccfe36e3f954d828c4acb911da3147e5ce8b0f8b875b9d43b8eceec947552562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GMLAK2AFYIU4ZLR27CD7KF6MC/bundle.json","state_url":"https://pith.science/pith/3GMLAK2AFYIU4ZLR27CD7KF6MC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GMLAK2AFYIU4ZLR27CD7KF6MC/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-08-15T01:54:53Z","links":{"resolver":"https://pith.science/pith/3GMLAK2AFYIU4ZLR27CD7KF6MC","bundle":"https://pith.science/pith/3GMLAK2AFYIU4ZLR27CD7KF6MC/bundle.json","state":"https://pith.science/pith/3GMLAK2AFYIU4ZLR27CD7KF6MC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GMLAK2AFYIU4ZLR27CD7KF6MC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3GMLAK2AFYIU4ZLR27CD7KF6MC","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":"d563a92da48ed84ddbcb90a2c24b72481bf6352895dfe9c655348427a07ef3ed","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-08T01:19:48Z","title_canon_sha256":"975c65dadfc04acc5c8b345d0dbfc8d92d6f72c3fa791e1c3adb06c2cdb42e72"},"schema_version":"1.0","source":{"id":"2012.06333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.06333","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"2012.06333v1","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06333","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"3GMLAK2AFYIU","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GMLAK2AFYIU4ZLR","created_at":"2026-07-05T01:58:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GMLAK2A","created_at":"2026-07-05T01:58:50Z"}],"graph_snapshots":[{"event_id":"sha256:ccfe36e3f954d828c4acb911da3147e5ce8b0f8b875b9d43b8eceec947552562","target":"graph","created_at":"2026-07-05T01:58:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.06333/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a generalization of graph convolutional networks by generalizing the diffusion operation underlying this class of graph neural networks. These sheaf neural networks are based on the sheaf Laplacian, a generalization of the graph Laplacian that encodes additional relational structure parameterized by the underlying graph. The sheaf Laplacian and associated matrices provide an extended version of the diffusion operation in graph convolutional networks, providing a proper generalization for domains where relations between nodes are non-constant, asymmetric, and varying in dimension. We","authors_text":"Jakob Hansen, Thomas Gebhart","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-08T01:19:48Z","title":"Sheaf Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06333","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:3466e5b3602d1dbbb98959c2bc84a06cc75a390442ebe3cb331fe3daeb37d4fe","target":"record","created_at":"2026-07-05T01:58:50Z","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":"d563a92da48ed84ddbcb90a2c24b72481bf6352895dfe9c655348427a07ef3ed","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-08T01:19:48Z","title_canon_sha256":"975c65dadfc04acc5c8b345d0dbfc8d92d6f72c3fa791e1c3adb06c2cdb42e72"},"schema_version":"1.0","source":{"id":"2012.06333","kind":"arxiv","version":1}},"canonical_sha256":"d998b02b402e114e6571d7c43fa8be60a864456a89cb4a604196a73cf151d74e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d998b02b402e114e6571d7c43fa8be60a864456a89cb4a604196a73cf151d74e","first_computed_at":"2026-07-05T01:58:50.529241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:58:50.529241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQMs58KswmUPNBlcIj4r/oef8bHBk/HIVaz7K7V2kz1fNL5AjdxAyAKmwATX+7O31cgWplFH+kXt0OLY3Qx2AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:58:50.529670Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.06333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3466e5b3602d1dbbb98959c2bc84a06cc75a390442ebe3cb331fe3daeb37d4fe","sha256:ccfe36e3f954d828c4acb911da3147e5ce8b0f8b875b9d43b8eceec947552562"],"state_sha256":"83caae8dc2e08bfff1379c4d9a4dac2e30e40c35d3fd2eaafb07ad119c4c85e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5KQ2RpEsAQZLqoiU41Ey4rSVHtzTmK1sS1MQRmgXQaOMC5bTUbQ+kGEkTCD9ah779orvP4UZjKQocIXl8dQWAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T01:54:53.008453Z","bundle_sha256":"46ec39bf658d21849e0fbafcf655baf53ca917dbc46f9845d21814ada2bb6eba"}}