{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZDIN7YUUHK3BY5SFHBAPEGJRBI","short_pith_number":"pith:ZDIN7YUU","schema_version":"1.0","canonical_sha256":"c8d0dfe2943ab61c76453840f219310a20e81f957ea5c17cf159406cf9db9717","source":{"kind":"arxiv","id":"2608.00836","version":1},"attestation_state":"computed","paper":{"title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ali Parviz, Yuichi Yoshida","submitted_at":"2026-08-01T19:30:15Z","abstract_excerpt":"While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Laplacian operators for such networks. We introduce a non-linear Laplacian operator specific to signed and directed networks (NLSD). This non-linear operator extends the concepts of the signed Laplacian for signed graphs and the Laplacian for directed graphs. The NLSD calculates node-specific potentials based on features More precisely, if the potential discrepancy is not aligned with the edge direction, we ignore it (and"},"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":"2608.00836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-01T19:30:15Z","cross_cats_sorted":[],"title_canon_sha256":"6b4e1d7d395cb38569b4a0a854a8cbb71f4154b1e0080776d57b837a4911b5c4","abstract_canon_sha256":"b6231be8b4b24746cf3635711f94040198beedef3b1b7070a4b4f4cd13df2355"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:55:14.160718Z","signature_b64":"ZcRlzSz8sGGO3PD5kkm5u7sB7/F6UoGQRZTm/cLEAz2WOGjy0FDAYdIlkkOw0xKUqEkT/C6eFE09emP70HLaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8d0dfe2943ab61c76453840f219310a20e81f957ea5c17cf159406cf9db9717","last_reissued_at":"2026-08-04T01:55:14.158958Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:55:14.158958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ali Parviz, Yuichi Yoshida","submitted_at":"2026-08-01T19:30:15Z","abstract_excerpt":"While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Laplacian operators for such networks. We introduce a non-linear Laplacian operator specific to signed and directed networks (NLSD). This non-linear operator extends the concepts of the signed Laplacian for signed graphs and the Laplacian for directed graphs. The NLSD calculates node-specific potentials based on features More precisely, if the potential discrepancy is not aligned with the edge direction, we ignore it (and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00836","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/2608.00836/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":"2608.00836","created_at":"2026-08-04T01:55:14.160491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00836v1","created_at":"2026-08-04T01:55:14.160491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00836","created_at":"2026-08-04T01:55:14.160491+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDIN7YUUHK3B","created_at":"2026-08-04T01:55:14.160491+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDIN7YUUHK3BY5SF","created_at":"2026-08-04T01:55:14.160491+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDIN7YUU","created_at":"2026-08-04T01:55:14.160491+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/ZDIN7YUUHK3BY5SFHBAPEGJRBI","json":"https://pith.science/pith/ZDIN7YUUHK3BY5SFHBAPEGJRBI.json","graph_json":"https://pith.science/api/pith-number/ZDIN7YUUHK3BY5SFHBAPEGJRBI/graph.json","events_json":"https://pith.science/api/pith-number/ZDIN7YUUHK3BY5SFHBAPEGJRBI/events.json","paper":"https://pith.science/paper/ZDIN7YUU"},"agent_actions":{"view_html":"https://pith.science/pith/ZDIN7YUUHK3BY5SFHBAPEGJRBI","download_json":"https://pith.science/pith/ZDIN7YUUHK3BY5SFHBAPEGJRBI.json","view_paper":"https://pith.science/paper/ZDIN7YUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00836&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDIN7YUUHK3BY5SFHBAPEGJRBI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDIN7YUUHK3BY5SFHBAPEGJRBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDIN7YUUHK3BY5SFHBAPEGJRBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDIN7YUUHK3BY5SFHBAPEGJRBI/action/storage_attestation","attest_author":"https://pith.science/pith/ZDIN7YUUHK3BY5SFHBAPEGJRBI/action/author_attestation","sign_citation":"https://pith.science/pith/ZDIN7YUUHK3BY5SFHBAPEGJRBI/action/citation_signature","submit_replication":"https://pith.science/pith/ZDIN7YUUHK3BY5SFHBAPEGJRBI/action/replication_record"}},"created_at":"2026-08-04T01:55:14.160491+00:00","updated_at":"2026-08-04T01:55:14.160491+00:00"}