{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BH2I3CDCLV2Y4OVGHIEVLVAI6P","short_pith_number":"pith:BH2I3CDC","canonical_record":{"source":{"id":"2208.07323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T16:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"848b72aaedddae385fce9f37e1ae3bf1afce52b1f2d5bf0e3e50951bb8783e8e","abstract_canon_sha256":"b470b23e72b8488e63429b36ed78dbcd17a181bd20ac58854a4af928b13cb820"},"schema_version":"1.0"},"canonical_sha256":"09f48d88625d758e3aa63a0955d408f3fe58d8e84fdd5752440217bccbafa60e","source":{"kind":"arxiv","id":"2208.07323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07323","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07323v1","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07323","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"BH2I3CDCLV2Y","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"pith_short_16","alias_value":"BH2I3CDCLV2Y4OVG","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"pith_short_8","alias_value":"BH2I3CDC","created_at":"2026-07-05T04:48:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BH2I3CDCLV2Y4OVGHIEVLVAI6P","target":"record","payload":{"canonical_record":{"source":{"id":"2208.07323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T16:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"848b72aaedddae385fce9f37e1ae3bf1afce52b1f2d5bf0e3e50951bb8783e8e","abstract_canon_sha256":"b470b23e72b8488e63429b36ed78dbcd17a181bd20ac58854a4af928b13cb820"},"schema_version":"1.0"},"canonical_sha256":"09f48d88625d758e3aa63a0955d408f3fe58d8e84fdd5752440217bccbafa60e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:26.702864Z","signature_b64":"bAytJ3Hg59TtrqgMU2dpCuHBswZnDDhfkzv5eiOuI9u/zCgAn+AGY0ALX3Fl1FSVh5sT75GPCsXczGv+odSNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09f48d88625d758e3aa63a0955d408f3fe58d8e84fdd5752440217bccbafa60e","last_reissued_at":"2026-07-05T04:48:26.702419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:26.702419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.07323","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-05T04:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GE0tSio9Veq9JSmYmMuVVaeAHJBQRum7eG7fxT5Pg72KVTuRgc2bfEbaVuo5p9E2g2DwjdMohedNbE5cPjOpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:47:30.697527Z"},"content_sha256":"cd54215eef827c9d22322fb3ffd9f855b4e3d2a6970291ae5d54a2b5d3d9190a","schema_version":"1.0","event_id":"sha256:cd54215eef827c9d22322fb3ffd9f855b4e3d2a6970291ae5d54a2b5d3d9190a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BH2I3CDCLV2Y4OVGHIEVLVAI6P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Signed Graph Neural Networks: A Frequency Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Rahul Singh, Yongxin Chen","submitted_at":"2022-08-15T16:42:18Z","abstract_excerpt":"Graph convolutional networks (GCNs) and its variants are designed for unsigned graphs containing only positive links. Many existing GCNs have been derived from the spectral domain analysis of signals lying over (unsigned) graphs and in each convolution layer they perform low-pass filtering of the input features followed by a learnable linear transformation. Their extension to signed graphs with positive as well as negative links imposes multiple issues including computational irregularities and ambiguous frequency interpretation, making the design of computationally efficient low pass filters "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07323","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/2208.07323/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-05T04:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CM6Qp119a/GvzP60uOQpGoi1+JCxnRg1AEY9VcyMFCne+gqV0NLT+qsvBzdGA79Fq4sW9rGY+TraCN2IA1G3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:47:30.697901Z"},"content_sha256":"0f79a0ea8b83668ca2e136bb54bfac2c9809ec25df30784da510a7978713e75f","schema_version":"1.0","event_id":"sha256:0f79a0ea8b83668ca2e136bb54bfac2c9809ec25df30784da510a7978713e75f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BH2I3CDCLV2Y4OVGHIEVLVAI6P/bundle.json","state_url":"https://pith.science/pith/BH2I3CDCLV2Y4OVGHIEVLVAI6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BH2I3CDCLV2Y4OVGHIEVLVAI6P/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-07-06T20:47:30Z","links":{"resolver":"https://pith.science/pith/BH2I3CDCLV2Y4OVGHIEVLVAI6P","bundle":"https://pith.science/pith/BH2I3CDCLV2Y4OVGHIEVLVAI6P/bundle.json","state":"https://pith.science/pith/BH2I3CDCLV2Y4OVGHIEVLVAI6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BH2I3CDCLV2Y4OVGHIEVLVAI6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BH2I3CDCLV2Y4OVGHIEVLVAI6P","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":"b470b23e72b8488e63429b36ed78dbcd17a181bd20ac58854a4af928b13cb820","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T16:42:18Z","title_canon_sha256":"848b72aaedddae385fce9f37e1ae3bf1afce52b1f2d5bf0e3e50951bb8783e8e"},"schema_version":"1.0","source":{"id":"2208.07323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07323","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07323v1","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07323","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"BH2I3CDCLV2Y","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"pith_short_16","alias_value":"BH2I3CDCLV2Y4OVG","created_at":"2026-07-05T04:48:26Z"},{"alias_kind":"pith_short_8","alias_value":"BH2I3CDC","created_at":"2026-07-05T04:48:26Z"}],"graph_snapshots":[{"event_id":"sha256:0f79a0ea8b83668ca2e136bb54bfac2c9809ec25df30784da510a7978713e75f","target":"graph","created_at":"2026-07-05T04:48:26Z","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/2208.07323/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph convolutional networks (GCNs) and its variants are designed for unsigned graphs containing only positive links. Many existing GCNs have been derived from the spectral domain analysis of signals lying over (unsigned) graphs and in each convolution layer they perform low-pass filtering of the input features followed by a learnable linear transformation. Their extension to signed graphs with positive as well as negative links imposes multiple issues including computational irregularities and ambiguous frequency interpretation, making the design of computationally efficient low pass filters ","authors_text":"Rahul Singh, Yongxin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T16:42:18Z","title":"Signed Graph Neural Networks: A Frequency Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07323","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:cd54215eef827c9d22322fb3ffd9f855b4e3d2a6970291ae5d54a2b5d3d9190a","target":"record","created_at":"2026-07-05T04:48:26Z","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":"b470b23e72b8488e63429b36ed78dbcd17a181bd20ac58854a4af928b13cb820","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-15T16:42:18Z","title_canon_sha256":"848b72aaedddae385fce9f37e1ae3bf1afce52b1f2d5bf0e3e50951bb8783e8e"},"schema_version":"1.0","source":{"id":"2208.07323","kind":"arxiv","version":1}},"canonical_sha256":"09f48d88625d758e3aa63a0955d408f3fe58d8e84fdd5752440217bccbafa60e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09f48d88625d758e3aa63a0955d408f3fe58d8e84fdd5752440217bccbafa60e","first_computed_at":"2026-07-05T04:48:26.702419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:26.702419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bAytJ3Hg59TtrqgMU2dpCuHBswZnDDhfkzv5eiOuI9u/zCgAn+AGY0ALX3Fl1FSVh5sT75GPCsXczGv+odSNAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:26.702864Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.07323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd54215eef827c9d22322fb3ffd9f855b4e3d2a6970291ae5d54a2b5d3d9190a","sha256:0f79a0ea8b83668ca2e136bb54bfac2c9809ec25df30784da510a7978713e75f"],"state_sha256":"4c0a33371616e2b15b84bbe1e6d327e91b92c0588ba39e042f530ca3297229d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvADDtB2eXlQ9jwcijEKmrVrbVWdeURVpqj4iofWhmNVp+SN0ehP+1NPn0OU5qA3qGO1oNccMgN7gA3vdhw/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:47:30.699941Z","bundle_sha256":"53e84fff93a11fb8efabf36d99faf68c550bc9c80ae94431bfb55ddb6afea681"}}