{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RMEPWGE5BFCKK2ESAO3XU3KNBY","short_pith_number":"pith:RMEPWGE5","schema_version":"1.0","canonical_sha256":"8b08fb189d0944a5689203b77a6d4d0e1c6842498f2f0fad24d37bdb88585af7","source":{"kind":"arxiv","id":"2004.01124","version":1},"attestation_state":"computed","paper":{"title":"Nass: A New Approach to Graph Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jongik Kim","submitted_at":"2020-04-02T16:53:04Z","abstract_excerpt":"In this paper, we study the problem of graph similarity search with graph edit distance (GED) constraints. Due to the NP-hardness of GED computation, existing solutions to this problem adopt the filtering-and-verification framework with a main focus on the filtering phase to generate a small number of candidate graphs. However, they have a limitation that the number of candidates grows extremely rapidly as a GED threshold increases. To address the limitation, we propose a new approach that utilizes GED computation results in generating candidate graphs. The main idea is that whenever we identi"},"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":"2004.01124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-02T16:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"b4d1e712adb09398150ea33f922413cb27f768d478f9ad1a77296004cd1353c7","abstract_canon_sha256":"da775cf496d99d30e6e0af04ae268d82f8feac6c472a1d505828614822a75c23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:24.487714Z","signature_b64":"xA6Snc/thGPrDjZ303K2OeEk0gh+kGidTESmHHfhUwI1BKKxmW8IaURMrPud0RMJSEHZMGQ6M0JsnO3cbTHGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b08fb189d0944a5689203b77a6d4d0e1c6842498f2f0fad24d37bdb88585af7","last_reissued_at":"2026-07-05T00:52:24.487373Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:24.487373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nass: A New Approach to Graph Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jongik Kim","submitted_at":"2020-04-02T16:53:04Z","abstract_excerpt":"In this paper, we study the problem of graph similarity search with graph edit distance (GED) constraints. Due to the NP-hardness of GED computation, existing solutions to this problem adopt the filtering-and-verification framework with a main focus on the filtering phase to generate a small number of candidate graphs. However, they have a limitation that the number of candidates grows extremely rapidly as a GED threshold increases. To address the limitation, we propose a new approach that utilizes GED computation results in generating candidate graphs. The main idea is that whenever we identi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.01124","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/2004.01124/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":"2004.01124","created_at":"2026-07-05T00:52:24.487431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.01124v1","created_at":"2026-07-05T00:52:24.487431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01124","created_at":"2026-07-05T00:52:24.487431+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMEPWGE5BFCK","created_at":"2026-07-05T00:52:24.487431+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMEPWGE5BFCKK2ES","created_at":"2026-07-05T00:52:24.487431+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMEPWGE5","created_at":"2026-07-05T00:52:24.487431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.09968","citing_title":"GraSP: Simple yet Effective Graph Similarity Predictions","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY","json":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY.json","graph_json":"https://pith.science/api/pith-number/RMEPWGE5BFCKK2ESAO3XU3KNBY/graph.json","events_json":"https://pith.science/api/pith-number/RMEPWGE5BFCKK2ESAO3XU3KNBY/events.json","paper":"https://pith.science/paper/RMEPWGE5"},"agent_actions":{"view_html":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY","download_json":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY.json","view_paper":"https://pith.science/paper/RMEPWGE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.01124&json=true","fetch_graph":"https://pith.science/api/pith-number/RMEPWGE5BFCKK2ESAO3XU3KNBY/graph.json","fetch_events":"https://pith.science/api/pith-number/RMEPWGE5BFCKK2ESAO3XU3KNBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/action/storage_attestation","attest_author":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/action/author_attestation","sign_citation":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/action/citation_signature","submit_replication":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/action/replication_record"}},"created_at":"2026-07-05T00:52:24.487431+00:00","updated_at":"2026-07-05T00:52:24.487431+00:00"}