{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZJ3YYID3MNKMZW2UAGHYF2IGLJ","short_pith_number":"pith:ZJ3YYID3","schema_version":"1.0","canonical_sha256":"ca778c207b6354ccdb54018f82e9065a5e7580ec64c6dae3a22491ee25f4fa2a","source":{"kind":"arxiv","id":"2509.09597","version":3},"attestation_state":"computed","paper":{"title":"Graph Alignment via Dual-Pass Spectral Encoding and Latent Space Communication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Erkan Turan, Maks Ovsjanikov, Maysam Behmanesh","submitted_at":"2025-09-11T16:36:16Z","abstract_excerpt":"Graph alignment, the problem of identifying corresponding nodes across multiple graphs, is fundamental to numerous applications. Most existing unsupervised methods embed node features into latent representations to enable cross-graph comparison without ground-truth correspondences. However, these methods suffer from two critical limitations: the degradation of node distinctiveness due to oversmoothing in GNN-based embeddings, and the misalignment of latent spaces across graphs caused by structural noise, feature heterogeneity, and training instability, ultimately leading to unreliable node cor"},"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":"2509.09597","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-11T16:36:16Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"df47e3f4a7b563869e3900850ff022b149c4ff2ad868904b6d542ac2ce6d066d","abstract_canon_sha256":"a90622619dc9115717c41d71e25abd0a1132b7e03ecfb024e4540dcdca10ac9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:16.666650Z","signature_b64":"FPpvYjvN4iFKgP0SN+Q7/dkXsMttqKHCaKlbDymZ4EJBmU3zGJgMrbKUJxkuwMX2zZyP+kWR+AluLR2hGKujBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca778c207b6354ccdb54018f82e9065a5e7580ec64c6dae3a22491ee25f4fa2a","last_reissued_at":"2026-06-23T02:13:16.666212Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:16.666212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Alignment via Dual-Pass Spectral Encoding and Latent Space Communication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Erkan Turan, Maks Ovsjanikov, Maysam Behmanesh","submitted_at":"2025-09-11T16:36:16Z","abstract_excerpt":"Graph alignment, the problem of identifying corresponding nodes across multiple graphs, is fundamental to numerous applications. Most existing unsupervised methods embed node features into latent representations to enable cross-graph comparison without ground-truth correspondences. However, these methods suffer from two critical limitations: the degradation of node distinctiveness due to oversmoothing in GNN-based embeddings, and the misalignment of latent spaces across graphs caused by structural noise, feature heterogeneity, and training instability, ultimately leading to unreliable node cor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09597","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/2509.09597/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":"2509.09597","created_at":"2026-06-23T02:13:16.666274+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09597v3","created_at":"2026-06-23T02:13:16.666274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09597","created_at":"2026-06-23T02:13:16.666274+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJ3YYID3MNKM","created_at":"2026-06-23T02:13:16.666274+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJ3YYID3MNKMZW2U","created_at":"2026-06-23T02:13:16.666274+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJ3YYID3","created_at":"2026-06-23T02:13:16.666274+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.03045","citing_title":"TCD-Arena: Assessing Robustness of Time Series Causal Discovery Methods Against Assumption Violations","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ","json":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ.json","graph_json":"https://pith.science/api/pith-number/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/graph.json","events_json":"https://pith.science/api/pith-number/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/events.json","paper":"https://pith.science/paper/ZJ3YYID3"},"agent_actions":{"view_html":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ","download_json":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ.json","view_paper":"https://pith.science/paper/ZJ3YYID3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09597&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZJ3YYID3MNKMZW2UAGHYF2IGLJ/action/replication_record"}},"created_at":"2026-06-23T02:13:16.666274+00:00","updated_at":"2026-06-23T02:13:16.666274+00:00"}