{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:RMEPWGE5BFCKK2ESAO3XU3KNBY","short_pith_number":"pith:RMEPWGE5","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"},"canonical_sha256":"8b08fb189d0944a5689203b77a6d4d0e1c6842498f2f0fad24d37bdb88585af7","source":{"kind":"arxiv","id":"2004.01124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.01124","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"2004.01124v1","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01124","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"RMEPWGE5BFCK","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"pith_short_16","alias_value":"RMEPWGE5BFCKK2ES","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"pith_short_8","alias_value":"RMEPWGE5","created_at":"2026-07-05T00:52:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:RMEPWGE5BFCKK2ESAO3XU3KNBY","target":"record","payload":{"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"},"canonical_sha256":"8b08fb189d0944a5689203b77a6d4d0e1c6842498f2f0fad24d37bdb88585af7","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"},"source_kind":"arxiv","source_id":"2004.01124","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHy997FBcIEJdOTeiUnimW3rcmq4RZpkURrYXnu19w3BMu70ato2eOsksQI2B6WfckdkYBxsHQ6P2K7bTCndBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:28:33.154891Z"},"content_sha256":"7589ec5c59dbd327c7f95f8b51f8845d19e03b9abdc298d2f01664e6a1b405f8","schema_version":"1.0","event_id":"sha256:7589ec5c59dbd327c7f95f8b51f8845d19e03b9abdc298d2f01664e6a1b405f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:RMEPWGE5BFCKK2ESAO3XU3KNBY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWo2uPNlA+TfnOG9DFZ5BZcrliWtjr2+3SVHcR1HIHCID6fkY4O9NZFE5I/WzrETq+vaEH3k98Y/PsZOsO4aAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:28:33.155732Z"},"content_sha256":"15d3a2a35f9b433320275dbe76a5e92741c110e57d2d62241bfc7148c53f3eaa","schema_version":"1.0","event_id":"sha256:15d3a2a35f9b433320275dbe76a5e92741c110e57d2d62241bfc7148c53f3eaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/bundle.json","state_url":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T08:28:33Z","links":{"resolver":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY","bundle":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/bundle.json","state":"https://pith.science/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMEPWGE5BFCKK2ESAO3XU3KNBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:RMEPWGE5BFCKK2ESAO3XU3KNBY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"da775cf496d99d30e6e0af04ae268d82f8feac6c472a1d505828614822a75c23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-02T16:53:04Z","title_canon_sha256":"b4d1e712adb09398150ea33f922413cb27f768d478f9ad1a77296004cd1353c7"},"schema_version":"1.0","source":{"id":"2004.01124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.01124","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"2004.01124v1","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01124","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"RMEPWGE5BFCK","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"pith_short_16","alias_value":"RMEPWGE5BFCKK2ES","created_at":"2026-07-05T00:52:24Z"},{"alias_kind":"pith_short_8","alias_value":"RMEPWGE5","created_at":"2026-07-05T00:52:24Z"}],"graph_snapshots":[{"event_id":"sha256:15d3a2a35f9b433320275dbe76a5e92741c110e57d2d62241bfc7148c53f3eaa","target":"graph","created_at":"2026-07-05T00:52:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.01124/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jongik Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-02T16:53:04Z","title":"Nass: A New Approach to Graph Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.01124","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7589ec5c59dbd327c7f95f8b51f8845d19e03b9abdc298d2f01664e6a1b405f8","target":"record","created_at":"2026-07-05T00:52:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"da775cf496d99d30e6e0af04ae268d82f8feac6c472a1d505828614822a75c23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-02T16:53:04Z","title_canon_sha256":"b4d1e712adb09398150ea33f922413cb27f768d478f9ad1a77296004cd1353c7"},"schema_version":"1.0","source":{"id":"2004.01124","kind":"arxiv","version":1}},"canonical_sha256":"8b08fb189d0944a5689203b77a6d4d0e1c6842498f2f0fad24d37bdb88585af7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b08fb189d0944a5689203b77a6d4d0e1c6842498f2f0fad24d37bdb88585af7","first_computed_at":"2026-07-05T00:52:24.487373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:52:24.487373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xA6Snc/thGPrDjZ303K2OeEk0gh+kGidTESmHHfhUwI1BKKxmW8IaURMrPud0RMJSEHZMGQ6M0JsnO3cbTHGCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:52:24.487714Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.01124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7589ec5c59dbd327c7f95f8b51f8845d19e03b9abdc298d2f01664e6a1b405f8","sha256:15d3a2a35f9b433320275dbe76a5e92741c110e57d2d62241bfc7148c53f3eaa"],"state_sha256":"a2e3bfb7e470fe8b5b62a22e46ae56e0ef855ab3d6101ba9bc5eeba1d19717f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQtxIT3ObsNDlr44lSVIRN7spReXiV2+aqapnz8pXEoH02y7yuPsO14giWx9fCjmZGfeoY/HaAb/lPUj0u6bBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T08:28:33.163606Z","bundle_sha256":"6cf034583ad3cd22d8dddc48ad90b45956cefcce5ccb572a90eeb2af81bb5f94"}}