{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SZ7M553K5BPOFLLW6U3JZ66P6C","short_pith_number":"pith:SZ7M553K","schema_version":"1.0","canonical_sha256":"967ecef76ae85ee2ad76f5369cfbcff0b46b95b00dc6d2661e75e0ddd19e87ca","source":{"kind":"arxiv","id":"2005.07115","version":7},"attestation_state":"computed","paper":{"title":"CoSimGNN: Towards Large-scale Graph Similarity Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoyan Xu, Jie Feng, Runjian Chen, Yueyang Wang, Ziheng Duan","submitted_at":"2020-05-14T16:33:13Z","abstract_excerpt":"The ability to compute similarity scores between graphs based on metrics such as Graph Edit Distance (GED) is important in many real-world applications. Computing exact GED values is typically an NP-hard problem and traditional algorithms usually achieve an unsatisfactory trade-off between accuracy and efficiency. Recently, Graph Neural Networks (GNNs) provide a data-driven solution for this task, which is more efficient while maintaining prediction accuracy in small graph (around 10 nodes per graph) similarity computation. Existing GNN-based methods, which either respectively embeds two graph"},"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":"2005.07115","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-14T16:33:13Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"4e58ac17e51c9d4999d57ed01f9d74fbe15e1e794e88ca2ed4f5770a38c0396c","abstract_canon_sha256":"c79ddf29d250d7d5917b94df8fed8491de59bb127767e9a574eeda8f3f13364a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:10.316145Z","signature_b64":"QVaphOOIgsBHjGkvMvMopO3EiHpGj7hVK1+INgnOAz6ApzVtyIKtlhgExBAos1Q4nLrwRM2SR/JteyvCyZ5FBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"967ecef76ae85ee2ad76f5369cfbcff0b46b95b00dc6d2661e75e0ddd19e87ca","last_reissued_at":"2026-07-05T04:49:10.315663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:10.315663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoSimGNN: Towards Large-scale Graph Similarity Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoyan Xu, Jie Feng, Runjian Chen, Yueyang Wang, Ziheng Duan","submitted_at":"2020-05-14T16:33:13Z","abstract_excerpt":"The ability to compute similarity scores between graphs based on metrics such as Graph Edit Distance (GED) is important in many real-world applications. Computing exact GED values is typically an NP-hard problem and traditional algorithms usually achieve an unsatisfactory trade-off between accuracy and efficiency. Recently, Graph Neural Networks (GNNs) provide a data-driven solution for this task, which is more efficient while maintaining prediction accuracy in small graph (around 10 nodes per graph) similarity computation. Existing GNN-based methods, which either respectively embeds two graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07115","kind":"arxiv","version":7},"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/2005.07115/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":"2005.07115","created_at":"2026-07-05T04:49:10.315726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07115v7","created_at":"2026-07-05T04:49:10.315726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07115","created_at":"2026-07-05T04:49:10.315726+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZ7M553K5BPO","created_at":"2026-07-05T04:49:10.315726+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZ7M553K5BPOFLLW","created_at":"2026-07-05T04:49:10.315726+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZ7M553K","created_at":"2026-07-05T04:49:10.315726+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.21198","citing_title":"Graph Synthetic Out-of-Distribution Exposure with Large Language Models","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C","json":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C.json","graph_json":"https://pith.science/api/pith-number/SZ7M553K5BPOFLLW6U3JZ66P6C/graph.json","events_json":"https://pith.science/api/pith-number/SZ7M553K5BPOFLLW6U3JZ66P6C/events.json","paper":"https://pith.science/paper/SZ7M553K"},"agent_actions":{"view_html":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C","download_json":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C.json","view_paper":"https://pith.science/paper/SZ7M553K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07115&json=true","fetch_graph":"https://pith.science/api/pith-number/SZ7M553K5BPOFLLW6U3JZ66P6C/graph.json","fetch_events":"https://pith.science/api/pith-number/SZ7M553K5BPOFLLW6U3JZ66P6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C/action/storage_attestation","attest_author":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C/action/author_attestation","sign_citation":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C/action/citation_signature","submit_replication":"https://pith.science/pith/SZ7M553K5BPOFLLW6U3JZ66P6C/action/replication_record"}},"created_at":"2026-07-05T04:49:10.315726+00:00","updated_at":"2026-07-05T04:49:10.315726+00:00"}