{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:Y5MJPANIEIIOQNALFMRGGDLVX3","short_pith_number":"pith:Y5MJPANI","canonical_record":{"source":{"id":"2307.07956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-16T06:14:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"83ab580fc75f6319016dc781f23674e22d76de731265c3c76f1846106b274680","abstract_canon_sha256":"8b671557798ecbf55eefed3fb4ee75171a15b68533d69ce699e054dcc54c55bb"},"schema_version":"1.0"},"canonical_sha256":"c7589781a82210e8340b2b22630d75bed6f4901391026b60efe258aa4c5db9e1","source":{"kind":"arxiv","id":"2307.07956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07956","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07956v1","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07956","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"Y5MJPANIEIIO","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"Y5MJPANIEIIOQNAL","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"Y5MJPANI","created_at":"2026-07-05T06:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:Y5MJPANIEIIOQNALFMRGGDLVX3","target":"record","payload":{"canonical_record":{"source":{"id":"2307.07956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-16T06:14:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"83ab580fc75f6319016dc781f23674e22d76de731265c3c76f1846106b274680","abstract_canon_sha256":"8b671557798ecbf55eefed3fb4ee75171a15b68533d69ce699e054dcc54c55bb"},"schema_version":"1.0"},"canonical_sha256":"c7589781a82210e8340b2b22630d75bed6f4901391026b60efe258aa4c5db9e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:18.367882Z","signature_b64":"n5xWuC7qplBhT8kJBvTjfr+WR6/+hu/x7BIKik4efQUtESxEy+JeD1zoY3G1c/3uozvoCl274eQa2I2kveHXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7589781a82210e8340b2b22630d75bed6f4901391026b60efe258aa4c5db9e1","last_reissued_at":"2026-07-05T06:31:18.367436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:18.367436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.07956","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-05T06:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/w4BUpt7ucu9OeTtV+ci7ESWFzrB3OsaZmr59GncOvcmtEDOpiNHS5pjrR0JuA+79QjNhfG6buOQGqxNhl2FDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:13:43.281805Z"},"content_sha256":"a0835c5d40214f6720ea7639690e4d7f6fb6d3eca199090669d9ae21f731339a","schema_version":"1.0","event_id":"sha256:a0835c5d40214f6720ea7639690e4d7f6fb6d3eca199090669d9ae21f731339a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:Y5MJPANIEIIOQNALFMRGGDLVX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automated Polynomial Filter Learning for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Wendi Yu, Xiaorui Liu, Zhichao Hou","submitted_at":"2023-07-16T06:14:12Z","abstract_excerpt":"Polynomial graph filters have been widely used as guiding principles in the design of Graph Neural Networks (GNNs). Recently, the adaptive learning of the polynomial graph filters has demonstrated promising performance for modeling graph signals on both homophilic and heterophilic graphs, owning to their flexibility and expressiveness. In this work, we conduct a novel preliminary study to explore the potential and limitations of polynomial graph filter learning approaches, revealing a severe overfitting issue. To improve the effectiveness of polynomial graph filters, we propose Auto-Polynomial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07956","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/2307.07956/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-05T06:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Y5RivvabpRN8xFNP9Dl7aZpl95jzEW1dkicVjq78Yg+zQ5lV1OVgDz4TXnMvKN+g3cSiIKi4r0OWrrNRMUzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:13:43.282262Z"},"content_sha256":"6cee2d10d9baf86b1b3f7df130554cac9df6b6612f611f21e5749b53969581fb","schema_version":"1.0","event_id":"sha256:6cee2d10d9baf86b1b3f7df130554cac9df6b6612f611f21e5749b53969581fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5MJPANIEIIOQNALFMRGGDLVX3/bundle.json","state_url":"https://pith.science/pith/Y5MJPANIEIIOQNALFMRGGDLVX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5MJPANIEIIOQNALFMRGGDLVX3/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-05T11:13:43Z","links":{"resolver":"https://pith.science/pith/Y5MJPANIEIIOQNALFMRGGDLVX3","bundle":"https://pith.science/pith/Y5MJPANIEIIOQNALFMRGGDLVX3/bundle.json","state":"https://pith.science/pith/Y5MJPANIEIIOQNALFMRGGDLVX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5MJPANIEIIOQNALFMRGGDLVX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:Y5MJPANIEIIOQNALFMRGGDLVX3","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":"8b671557798ecbf55eefed3fb4ee75171a15b68533d69ce699e054dcc54c55bb","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-16T06:14:12Z","title_canon_sha256":"83ab580fc75f6319016dc781f23674e22d76de731265c3c76f1846106b274680"},"schema_version":"1.0","source":{"id":"2307.07956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07956","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07956v1","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07956","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"Y5MJPANIEIIO","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"Y5MJPANIEIIOQNAL","created_at":"2026-07-05T06:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"Y5MJPANI","created_at":"2026-07-05T06:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:6cee2d10d9baf86b1b3f7df130554cac9df6b6612f611f21e5749b53969581fb","target":"graph","created_at":"2026-07-05T06:31:18Z","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/2307.07956/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Polynomial graph filters have been widely used as guiding principles in the design of Graph Neural Networks (GNNs). Recently, the adaptive learning of the polynomial graph filters has demonstrated promising performance for modeling graph signals on both homophilic and heterophilic graphs, owning to their flexibility and expressiveness. In this work, we conduct a novel preliminary study to explore the potential and limitations of polynomial graph filter learning approaches, revealing a severe overfitting issue. To improve the effectiveness of polynomial graph filters, we propose Auto-Polynomial","authors_text":"Wendi Yu, Xiaorui Liu, Zhichao Hou","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-16T06:14:12Z","title":"Automated Polynomial Filter Learning for Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07956","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:a0835c5d40214f6720ea7639690e4d7f6fb6d3eca199090669d9ae21f731339a","target":"record","created_at":"2026-07-05T06:31:18Z","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":"8b671557798ecbf55eefed3fb4ee75171a15b68533d69ce699e054dcc54c55bb","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-16T06:14:12Z","title_canon_sha256":"83ab580fc75f6319016dc781f23674e22d76de731265c3c76f1846106b274680"},"schema_version":"1.0","source":{"id":"2307.07956","kind":"arxiv","version":1}},"canonical_sha256":"c7589781a82210e8340b2b22630d75bed6f4901391026b60efe258aa4c5db9e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7589781a82210e8340b2b22630d75bed6f4901391026b60efe258aa4c5db9e1","first_computed_at":"2026-07-05T06:31:18.367436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:31:18.367436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n5xWuC7qplBhT8kJBvTjfr+WR6/+hu/x7BIKik4efQUtESxEy+JeD1zoY3G1c/3uozvoCl274eQa2I2kveHXAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:31:18.367882Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.07956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0835c5d40214f6720ea7639690e4d7f6fb6d3eca199090669d9ae21f731339a","sha256:6cee2d10d9baf86b1b3f7df130554cac9df6b6612f611f21e5749b53969581fb"],"state_sha256":"3d42002c1653a4116a20ff205b42bc7d0de489777ce1aff36606d7b1b66ddf0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1X2XDam60zL9Lyy2hrIRMdEeDav/wqwCiDWMA0RKD15127tYastEEzeon1QqybOyROFZvyvnO6pkK219X7rjDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:13:43.285040Z","bundle_sha256":"27564d502a33adc7eff48fcd362ddb6ac090089e3075ba52b04b85822f3fca33"}}