{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WJANH2IVXTIPSPWEWNGIBCRXCR","short_pith_number":"pith:WJANH2IV","canonical_record":{"source":{"id":"2608.04583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T08:48:18Z","cross_cats_sorted":[],"title_canon_sha256":"afd0a227d751988256583c862d32ae1ada8beb37e477c35e93fafc51ae745f0c","abstract_canon_sha256":"712de85bbb99bce680c02bf02bc2f726de48309cbd4e12c3b62f686ca7b61083"},"schema_version":"1.0"},"canonical_sha256":"b240d3e915bcd0f93ec4b34c808a37145a9f90045e8f8cf8809ea68f07879538","source":{"kind":"arxiv","id":"2608.04583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04583","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04583v1","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04583","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"pith_short_12","alias_value":"WJANH2IVXTIP","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"pith_short_16","alias_value":"WJANH2IVXTIPSPWE","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"pith_short_8","alias_value":"WJANH2IV","created_at":"2026-08-06T01:36:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WJANH2IVXTIPSPWEWNGIBCRXCR","target":"record","payload":{"canonical_record":{"source":{"id":"2608.04583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T08:48:18Z","cross_cats_sorted":[],"title_canon_sha256":"afd0a227d751988256583c862d32ae1ada8beb37e477c35e93fafc51ae745f0c","abstract_canon_sha256":"712de85bbb99bce680c02bf02bc2f726de48309cbd4e12c3b62f686ca7b61083"},"schema_version":"1.0"},"canonical_sha256":"b240d3e915bcd0f93ec4b34c808a37145a9f90045e8f8cf8809ea68f07879538","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:36:12.513755Z","signature_b64":"nkQbpTIe+h+3XzmWbitIzkdUmzdcT8te+tAFlMD4lEeI6Jkq5myYz39FNwme/GmemGPEdtoqG0HFVP7/2L1NCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b240d3e915bcd0f93ec4b34c808a37145a9f90045e8f8cf8809ea68f07879538","last_reissued_at":"2026-08-06T01:36:12.512291Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:36:12.512291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.04583","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-08-06T01:36:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBCuA3qq/kM2KSFKU7E7ssWM2t2QPVyXwemVTU8RSuJcxLSwrxdWmnRlrDE6oVyNcF07C7kJThLjwC1zPoVGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:39:44.290056Z"},"content_sha256":"fc1525ba91f29a53101b1e4fdbf198ba852ae250064d9468c92c7821494928ab","schema_version":"1.0","event_id":"sha256:fc1525ba91f29a53101b1e4fdbf198ba852ae250064d9468c92c7821494928ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WJANH2IVXTIPSPWEWNGIBCRXCR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Separator-based Algorithm for the Graph Edit Distance Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lars M\\\"uller, Laura B\\\"ulte, Petra Mutzel, Philip Mayer","submitted_at":"2026-08-05T08:48:18Z","abstract_excerpt":"The Graph Edit Distance (GED) is a widely used graph similarity measure asking for the minimum cost of a sequence of edits transforming one (labeled) graph into another. The considered edit operations are deletion, insertion, and relabeling of nodes and edges. Special cases include the Graph Isomorphism problem, as well as many other graph problems that ask for the existence or minimum cost of a certain substructure, like the Traveling Salesman or Maximum Clique problem.\n  We present a novel exponential time algorithm to compute the exact GED and a corresponding edit sequence in $O^*(4 + \\vare"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04583","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/2608.04583/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-08-06T01:36:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"titpB2Yg3FuXeXv0uT2orkRGPzH1scZtbG37bKNS6kSnf2MKklFCuKSrEXYM3KgV/2ymY3I3BisTAZ7pbOUoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:39:44.290652Z"},"content_sha256":"c72092e3dc5dd1e2699b0caef3577cb94e8e9808153240cc0d1328c075152750","schema_version":"1.0","event_id":"sha256:c72092e3dc5dd1e2699b0caef3577cb94e8e9808153240cc0d1328c075152750"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJANH2IVXTIPSPWEWNGIBCRXCR/bundle.json","state_url":"https://pith.science/pith/WJANH2IVXTIPSPWEWNGIBCRXCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJANH2IVXTIPSPWEWNGIBCRXCR/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-19T00:39:44Z","links":{"resolver":"https://pith.science/pith/WJANH2IVXTIPSPWEWNGIBCRXCR","bundle":"https://pith.science/pith/WJANH2IVXTIPSPWEWNGIBCRXCR/bundle.json","state":"https://pith.science/pith/WJANH2IVXTIPSPWEWNGIBCRXCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJANH2IVXTIPSPWEWNGIBCRXCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WJANH2IVXTIPSPWEWNGIBCRXCR","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":"712de85bbb99bce680c02bf02bc2f726de48309cbd4e12c3b62f686ca7b61083","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T08:48:18Z","title_canon_sha256":"afd0a227d751988256583c862d32ae1ada8beb37e477c35e93fafc51ae745f0c"},"schema_version":"1.0","source":{"id":"2608.04583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04583","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04583v1","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04583","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"pith_short_12","alias_value":"WJANH2IVXTIP","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"pith_short_16","alias_value":"WJANH2IVXTIPSPWE","created_at":"2026-08-06T01:36:12Z"},{"alias_kind":"pith_short_8","alias_value":"WJANH2IV","created_at":"2026-08-06T01:36:12Z"}],"graph_snapshots":[{"event_id":"sha256:c72092e3dc5dd1e2699b0caef3577cb94e8e9808153240cc0d1328c075152750","target":"graph","created_at":"2026-08-06T01:36:12Z","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/2608.04583/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Graph Edit Distance (GED) is a widely used graph similarity measure asking for the minimum cost of a sequence of edits transforming one (labeled) graph into another. The considered edit operations are deletion, insertion, and relabeling of nodes and edges. Special cases include the Graph Isomorphism problem, as well as many other graph problems that ask for the existence or minimum cost of a certain substructure, like the Traveling Salesman or Maximum Clique problem.\n  We present a novel exponential time algorithm to compute the exact GED and a corresponding edit sequence in $O^*(4 + \\vare","authors_text":"Lars M\\\"uller, Laura B\\\"ulte, Petra Mutzel, Philip Mayer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04583","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:fc1525ba91f29a53101b1e4fdbf198ba852ae250064d9468c92c7821494928ab","target":"record","created_at":"2026-08-06T01:36:12Z","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":"712de85bbb99bce680c02bf02bc2f726de48309cbd4e12c3b62f686ca7b61083","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-05T08:48:18Z","title_canon_sha256":"afd0a227d751988256583c862d32ae1ada8beb37e477c35e93fafc51ae745f0c"},"schema_version":"1.0","source":{"id":"2608.04583","kind":"arxiv","version":1}},"canonical_sha256":"b240d3e915bcd0f93ec4b34c808a37145a9f90045e8f8cf8809ea68f07879538","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b240d3e915bcd0f93ec4b34c808a37145a9f90045e8f8cf8809ea68f07879538","first_computed_at":"2026-08-06T01:36:12.512291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:36:12.512291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nkQbpTIe+h+3XzmWbitIzkdUmzdcT8te+tAFlMD4lEeI6Jkq5myYz39FNwme/GmemGPEdtoqG0HFVP7/2L1NCQ==","signature_status":"signed_v1","signed_at":"2026-08-06T01:36:12.513755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc1525ba91f29a53101b1e4fdbf198ba852ae250064d9468c92c7821494928ab","sha256:c72092e3dc5dd1e2699b0caef3577cb94e8e9808153240cc0d1328c075152750"],"state_sha256":"942b8e8265add90568a3aad4cbe9a3158a62db9a80f0e7190f659bc33d522989"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yf+E1lXrf9yoqpDns/NABguREbHKQwysXNvNChKnKOnBuIueFNBxu/D5zMizpcIyB7qSshJDHNmnJbntUmy7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T00:39:44.296369Z","bundle_sha256":"b9f3f5f4d6d0b08808b220909f0961a59b1f4c7dcc16a47e7667e911269cddf7"}}