{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:423OOYF4RGLKMSMUFFWUSAJD44","short_pith_number":"pith:423OOYF4","canonical_record":{"source":{"id":"1709.10305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T09:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"a23292d6abb4c7d34bfec40861d438898bd0c61fd8f11796ec4c83bb9c95119a","abstract_canon_sha256":"742caa84a823ebbaee2fa5acf05cdf163818686ada05414e03529fc4deac01b4"},"schema_version":"1.0"},"canonical_sha256":"e6b6e760bc8996a64994296d490123e73436eceba2c613a9e9b72bce5af892a7","source":{"kind":"arxiv","id":"1709.10305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10305","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10305v1","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10305","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"pith_short_12","alias_value":"423OOYF4RGLK","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"423OOYF4RGLKMSMU","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"423OOYF4","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:423OOYF4RGLKMSMUFFWUSAJD44","target":"record","payload":{"canonical_record":{"source":{"id":"1709.10305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T09:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"a23292d6abb4c7d34bfec40861d438898bd0c61fd8f11796ec4c83bb9c95119a","abstract_canon_sha256":"742caa84a823ebbaee2fa5acf05cdf163818686ada05414e03529fc4deac01b4"},"schema_version":"1.0"},"canonical_sha256":"e6b6e760bc8996a64994296d490123e73436eceba2c613a9e9b72bce5af892a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:03.581950Z","signature_b64":"dolvwX0ee8e4wTlZ2NghxF/FHaydhtWFu/TFO0O5UuLE6yCwRhTBozp+EjnP3o9nd+sT8DcKb2aqYLL1FsKqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6b6e760bc8996a64994296d490123e73436eceba2c613a9e9b72bce5af892a7","last_reissued_at":"2026-05-18T00:34:03.581225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:03.581225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.10305","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-05-18T00:34:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d0f1xBfBaGJp39ifqUnXk43wxeZHAl4Rw/esgJZs2Zwh5Z2zihVX22p9DIpYAk3KFbC4AcUbK9XUMQptLFhgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:34:48.242617Z"},"content_sha256":"58a92d038048d5bd2e67b9c89a7bc77707ec9204eaa6be40e377aa3e46b842db","schema_version":"1.0","event_id":"sha256:58a92d038048d5bd2e67b9c89a7bc77707ec9204eaa6be40e377aa3e46b842db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:423OOYF4RGLKMSMUFFWUSAJD44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Computation of Graph Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hongwei Huo, Jeffrey Scott Vitter, Jun Huan, Xiaoyang Chen","submitted_at":"2017-09-29T09:51:33Z","abstract_excerpt":"The graph edit distance (GED) is a well-established distance measure widely used in many applications. However, existing methods for the GED computation suffer from several drawbacks including oversized search space, huge memory consumption, and lots of expensive backtracking. In this paper, we present BSS_GED, a novel vertex-based mapping method for the GED computation. First, we create a small search space by reducing the number of invalid and redundant mappings involved in the GED computation. Then, we utilize beam-stack search combined with two heuristics to efficiently compute GED, achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10305","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":""},"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-05-18T00:34:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OwT7C82l48mGwqrTke72ButEeEIdl3ahWROsXDaU+G0V/KcNbuUFycFYbp2X/zNNtajeAvd5qeXkHN6JM3WWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:34:48.242949Z"},"content_sha256":"126d2879266e261ba1335d7929a3727e842198af05382d80682336ce2aedba4b","schema_version":"1.0","event_id":"sha256:126d2879266e261ba1335d7929a3727e842198af05382d80682336ce2aedba4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/423OOYF4RGLKMSMUFFWUSAJD44/bundle.json","state_url":"https://pith.science/pith/423OOYF4RGLKMSMUFFWUSAJD44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/423OOYF4RGLKMSMUFFWUSAJD44/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-06-27T17:34:48Z","links":{"resolver":"https://pith.science/pith/423OOYF4RGLKMSMUFFWUSAJD44","bundle":"https://pith.science/pith/423OOYF4RGLKMSMUFFWUSAJD44/bundle.json","state":"https://pith.science/pith/423OOYF4RGLKMSMUFFWUSAJD44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/423OOYF4RGLKMSMUFFWUSAJD44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:423OOYF4RGLKMSMUFFWUSAJD44","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":"742caa84a823ebbaee2fa5acf05cdf163818686ada05414e03529fc4deac01b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T09:51:33Z","title_canon_sha256":"a23292d6abb4c7d34bfec40861d438898bd0c61fd8f11796ec4c83bb9c95119a"},"schema_version":"1.0","source":{"id":"1709.10305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10305","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10305v1","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10305","created_at":"2026-05-18T00:34:03Z"},{"alias_kind":"pith_short_12","alias_value":"423OOYF4RGLK","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"423OOYF4RGLKMSMU","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"423OOYF4","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:126d2879266e261ba1335d7929a3727e842198af05382d80682336ce2aedba4b","target":"graph","created_at":"2026-05-18T00:34:03Z","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"},"paper":{"abstract_excerpt":"The graph edit distance (GED) is a well-established distance measure widely used in many applications. However, existing methods for the GED computation suffer from several drawbacks including oversized search space, huge memory consumption, and lots of expensive backtracking. In this paper, we present BSS_GED, a novel vertex-based mapping method for the GED computation. First, we create a small search space by reducing the number of invalid and redundant mappings involved in the GED computation. Then, we utilize beam-stack search combined with two heuristics to efficiently compute GED, achiev","authors_text":"Hongwei Huo, Jeffrey Scott Vitter, Jun Huan, Xiaoyang Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T09:51:33Z","title":"Fast Computation of Graph Edit Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10305","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:58a92d038048d5bd2e67b9c89a7bc77707ec9204eaa6be40e377aa3e46b842db","target":"record","created_at":"2026-05-18T00:34:03Z","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":"742caa84a823ebbaee2fa5acf05cdf163818686ada05414e03529fc4deac01b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-29T09:51:33Z","title_canon_sha256":"a23292d6abb4c7d34bfec40861d438898bd0c61fd8f11796ec4c83bb9c95119a"},"schema_version":"1.0","source":{"id":"1709.10305","kind":"arxiv","version":1}},"canonical_sha256":"e6b6e760bc8996a64994296d490123e73436eceba2c613a9e9b72bce5af892a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6b6e760bc8996a64994296d490123e73436eceba2c613a9e9b72bce5af892a7","first_computed_at":"2026-05-18T00:34:03.581225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:03.581225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dolvwX0ee8e4wTlZ2NghxF/FHaydhtWFu/TFO0O5UuLE6yCwRhTBozp+EjnP3o9nd+sT8DcKb2aqYLL1FsKqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:03.581950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58a92d038048d5bd2e67b9c89a7bc77707ec9204eaa6be40e377aa3e46b842db","sha256:126d2879266e261ba1335d7929a3727e842198af05382d80682336ce2aedba4b"],"state_sha256":"c99fddeaa6fbc234dcfdcaaadbfa195b3d60d0624f6bbe05317af17aae328c83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3EleilKRAZ44kLhZECQD2RhdKeyTKB2+utRZLt3iffWdeiPneTRUPRy/Iql6t5P/6zGgVGrgScnoN0vbds3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:34:48.244831Z","bundle_sha256":"b9db8592d203eaa9fd147f13e9c7140df1c3fbc4c306beb2fd0723fbaecafeab"}}