{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WOVL6RAXJSFPC2VU5HDZN2X2TW","short_pith_number":"pith:WOVL6RAX","canonical_record":{"source":{"id":"1802.08509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-23T12:54:40Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"a2525b9ea887ed63bb00410365f8079b15401f9be6be5ecb45c51dc26fa60095","abstract_canon_sha256":"ec4f67bb2122c071c06861a23f9b7754661f06c60402faadee0c091365177698"},"schema_version":"1.0"},"canonical_sha256":"b3aabf44174c8af16ab4e9c796eafa9d9081ebeda4e901fc6c0d6019df734179","source":{"kind":"arxiv","id":"1802.08509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08509","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08509v1","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08509","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"WOVL6RAXJSFP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOVL6RAXJSFPC2VU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOVL6RAX","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WOVL6RAXJSFPC2VU5HDZN2X2TW","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-23T12:54:40Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"a2525b9ea887ed63bb00410365f8079b15401f9be6be5ecb45c51dc26fa60095","abstract_canon_sha256":"ec4f67bb2122c071c06861a23f9b7754661f06c60402faadee0c091365177698"},"schema_version":"1.0"},"canonical_sha256":"b3aabf44174c8af16ab4e9c796eafa9d9081ebeda4e901fc6c0d6019df734179","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:41.379070Z","signature_b64":"+sXeAnArd3tHP6tKCUgfiJ7GixnJQZCkfqmNKQMeyBaoQ3WWvTlCRFvaJxAlijhNB/B2ZjbKpr9MaHgn8kNMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3aabf44174c8af16ab4e9c796eafa9d9081ebeda4e901fc6c0d6019df734179","last_reissued_at":"2026-05-18T00:22:41.378517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:41.378517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08509","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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mOoM+p28lG48mXZfWg4KpEQuth6dZpp1kLF8HiWOf/Fv/aigWJbKWapTNSt+ADe+1b2soX/N3worKmEefAbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:48:29.241151Z"},"content_sha256":"fc3b24662f322e946e30e22acb3bae31e663909662550cec54d20d9d4867fb64","schema_version":"1.0","event_id":"sha256:fc3b24662f322e946e30e22acb3bae31e663909662550cec54d20d9d4867fb64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WOVL6RAXJSFPC2VU5HDZN2X2TW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Similarity and Approximate Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Gaurav Rattan, Gerhard J. Woeginger, Martin Grohe","submitted_at":"2018-02-23T12:54:40Z","abstract_excerpt":"The graph similarity problem, also known as approximate graph isomorphism or graph matching problem, has been extensively studied in the machine learning community, but has not received much attention in the algorithms community: Given two graphs $G,H$ of the same order $n$ with adjacency matrices $A_G,A_H$, a well-studied measure of similarity is the Frobenius distance \\[ \\mathrm{dist}(G,H):=\\min_{\\pi}\\|A_G^\\pi-A_H\\|_F, \\] where $\\pi$ ranges over all permutations of the vertex set of $G$, where $A_G^\\pi$ denotes the matrix obtained from $A_G$ by permuting rows and columns according to $\\pi$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08509","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:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEFIeJevGdfbjll0xvEr3ODFR3X2Dj4JpKZXmWHrO/OYJM1ZcX/SmNF7qEKETNTtj7IK9ukVZsOlq6Utb12yDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:48:29.241501Z"},"content_sha256":"ae414ed46c13b23f8dee695d947b2f7c50e3b628b5a3ceed97d94f10833ed69c","schema_version":"1.0","event_id":"sha256:ae414ed46c13b23f8dee695d947b2f7c50e3b628b5a3ceed97d94f10833ed69c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOVL6RAXJSFPC2VU5HDZN2X2TW/bundle.json","state_url":"https://pith.science/pith/WOVL6RAXJSFPC2VU5HDZN2X2TW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOVL6RAXJSFPC2VU5HDZN2X2TW/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-05T18:48:29Z","links":{"resolver":"https://pith.science/pith/WOVL6RAXJSFPC2VU5HDZN2X2TW","bundle":"https://pith.science/pith/WOVL6RAXJSFPC2VU5HDZN2X2TW/bundle.json","state":"https://pith.science/pith/WOVL6RAXJSFPC2VU5HDZN2X2TW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOVL6RAXJSFPC2VU5HDZN2X2TW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WOVL6RAXJSFPC2VU5HDZN2X2TW","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":"ec4f67bb2122c071c06861a23f9b7754661f06c60402faadee0c091365177698","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-23T12:54:40Z","title_canon_sha256":"a2525b9ea887ed63bb00410365f8079b15401f9be6be5ecb45c51dc26fa60095"},"schema_version":"1.0","source":{"id":"1802.08509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08509","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08509v1","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08509","created_at":"2026-05-18T00:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"WOVL6RAXJSFP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOVL6RAXJSFPC2VU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOVL6RAX","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ae414ed46c13b23f8dee695d947b2f7c50e3b628b5a3ceed97d94f10833ed69c","target":"graph","created_at":"2026-05-18T00:22:41Z","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 similarity problem, also known as approximate graph isomorphism or graph matching problem, has been extensively studied in the machine learning community, but has not received much attention in the algorithms community: Given two graphs $G,H$ of the same order $n$ with adjacency matrices $A_G,A_H$, a well-studied measure of similarity is the Frobenius distance \\[ \\mathrm{dist}(G,H):=\\min_{\\pi}\\|A_G^\\pi-A_H\\|_F, \\] where $\\pi$ ranges over all permutations of the vertex set of $G$, where $A_G^\\pi$ denotes the matrix obtained from $A_G$ by permuting rows and columns according to $\\pi$, ","authors_text":"Gaurav Rattan, Gerhard J. Woeginger, Martin Grohe","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-23T12:54:40Z","title":"Graph Similarity and Approximate Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08509","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:fc3b24662f322e946e30e22acb3bae31e663909662550cec54d20d9d4867fb64","target":"record","created_at":"2026-05-18T00:22:41Z","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":"ec4f67bb2122c071c06861a23f9b7754661f06c60402faadee0c091365177698","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-23T12:54:40Z","title_canon_sha256":"a2525b9ea887ed63bb00410365f8079b15401f9be6be5ecb45c51dc26fa60095"},"schema_version":"1.0","source":{"id":"1802.08509","kind":"arxiv","version":1}},"canonical_sha256":"b3aabf44174c8af16ab4e9c796eafa9d9081ebeda4e901fc6c0d6019df734179","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3aabf44174c8af16ab4e9c796eafa9d9081ebeda4e901fc6c0d6019df734179","first_computed_at":"2026-05-18T00:22:41.378517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:41.378517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+sXeAnArd3tHP6tKCUgfiJ7GixnJQZCkfqmNKQMeyBaoQ3WWvTlCRFvaJxAlijhNB/B2ZjbKpr9MaHgn8kNMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:41.379070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc3b24662f322e946e30e22acb3bae31e663909662550cec54d20d9d4867fb64","sha256:ae414ed46c13b23f8dee695d947b2f7c50e3b628b5a3ceed97d94f10833ed69c"],"state_sha256":"0505c06c084361ebcc9c8f29fbec601a6b40b487e8107fe075145e5f48a22bd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyyGbbbswLC7JaVveK3fmkz4uMMty3VhMPnn08C65G6cWC+b2Uh6QbdFxlmJcAVsCVDopZNA3BtJUqqPZJyVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:48:29.243530Z","bundle_sha256":"d45a6b8b1a02f244c06e8bc8bfc1ff4667c978020808725370dd8dcc329a876e"}}