{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VQGXDYXD6P25B4GS25U356YMZ7","short_pith_number":"pith:VQGXDYXD","schema_version":"1.0","canonical_sha256":"ac0d71e2e3f3f5d0f0d2d769befb0ccfd1e888ced06a5ffdae66f7f982090bfb","source":{"kind":"arxiv","id":"2505.02124","version":1},"attestation_state":"computed","paper":{"title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ananya Mathur, Ankit Anand, Arushi Goyal, Samidha Verma, Sayan Ranu","submitted_at":"2025-05-04T14:14:24Z","abstract_excerpt":"Graph Edit Distance (GED) is a widely used metric for measuring similarity between two graphs. Computing the optimal GED is NP-hard, leading to the development of various neural and non-neural heuristics. While neural methods have achieved improved approximation quality compared to non-neural approaches, they face significant challenges: (1) They require large amounts of ground truth data, which is itself NP-hard to compute. (2) They operate as black boxes, offering limited interpretability. (3) They lack cross-domain generalization, necessitating expensive retraining for each new dataset. We "},"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":"2505.02124","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-04T14:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"e3b215bcb141c78e9a573a4f693de7f58abbc5ce72500385cd05b11c904de7d9","abstract_canon_sha256":"6926104ed530fba352b03c533b17b663f5908fb0a20b29b770aa14903048bcf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:32.348908Z","signature_b64":"nUOuZ8eNGptHcR9RUAGN0DNxQgE698h7IOaVKxiDdW5+c0Wc+Nx8F3jK12m83i/d0+U8iES7R6j9D4DUuMhvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac0d71e2e3f3f5d0f0d2d769befb0ccfd1e888ced06a5ffdae66f7f982090bfb","last_reissued_at":"2026-07-05T10:58:32.348382Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:32.348382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ananya Mathur, Ankit Anand, Arushi Goyal, Samidha Verma, Sayan Ranu","submitted_at":"2025-05-04T14:14:24Z","abstract_excerpt":"Graph Edit Distance (GED) is a widely used metric for measuring similarity between two graphs. Computing the optimal GED is NP-hard, leading to the development of various neural and non-neural heuristics. While neural methods have achieved improved approximation quality compared to non-neural approaches, they face significant challenges: (1) They require large amounts of ground truth data, which is itself NP-hard to compute. (2) They operate as black boxes, offering limited interpretability. (3) They lack cross-domain generalization, necessitating expensive retraining for each new dataset. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02124","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/2505.02124/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":"2505.02124","created_at":"2026-07-05T10:58:32.348457+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.02124v1","created_at":"2026-07-05T10:58:32.348457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02124","created_at":"2026-07-05T10:58:32.348457+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQGXDYXD6P25","created_at":"2026-07-05T10:58:32.348457+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQGXDYXD6P25B4GS","created_at":"2026-07-05T10:58:32.348457+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQGXDYXD","created_at":"2026-07-05T10:58:32.348457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23754","citing_title":"LLM-driven design of physics-constrained constitutive models: two agents are better than one","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05929","citing_title":"ReLU Networks for Exact Generation of Similar Graphs","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7","json":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7.json","graph_json":"https://pith.science/api/pith-number/VQGXDYXD6P25B4GS25U356YMZ7/graph.json","events_json":"https://pith.science/api/pith-number/VQGXDYXD6P25B4GS25U356YMZ7/events.json","paper":"https://pith.science/paper/VQGXDYXD"},"agent_actions":{"view_html":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7","download_json":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7.json","view_paper":"https://pith.science/paper/VQGXDYXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.02124&json=true","fetch_graph":"https://pith.science/api/pith-number/VQGXDYXD6P25B4GS25U356YMZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/VQGXDYXD6P25B4GS25U356YMZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7/action/storage_attestation","attest_author":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7/action/author_attestation","sign_citation":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7/action/citation_signature","submit_replication":"https://pith.science/pith/VQGXDYXD6P25B4GS25U356YMZ7/action/replication_record"}},"created_at":"2026-07-05T10:58:32.348457+00:00","updated_at":"2026-07-05T10:58:32.348457+00:00"}