{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YYVS4EHX6L6EZVLJHFZXSOYIXP","short_pith_number":"pith:YYVS4EHX","canonical_record":{"source":{"id":"1902.11105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-28T14:39:19Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"c9b5df5649970ff75434192fe3765323dd9eceb845bef585b60384328ed1c51f","abstract_canon_sha256":"cf626dc5094be29015a52c03203f3fc4179756f612267d842c2a5c27a8ab8fb6"},"schema_version":"1.0"},"canonical_sha256":"c62b2e10f7f2fc4cd5693973793b08bbf5d5c4472a5d7ff136f602ced94c1044","source":{"kind":"arxiv","id":"1902.11105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.11105","created_at":"2026-05-17T23:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1902.11105v1","created_at":"2026-05-17T23:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.11105","created_at":"2026-05-17T23:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"YYVS4EHX6L6E","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YYVS4EHX6L6EZVLJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YYVS4EHX","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YYVS4EHX6L6EZVLJHFZXSOYIXP","target":"record","payload":{"canonical_record":{"source":{"id":"1902.11105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-28T14:39:19Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"c9b5df5649970ff75434192fe3765323dd9eceb845bef585b60384328ed1c51f","abstract_canon_sha256":"cf626dc5094be29015a52c03203f3fc4179756f612267d842c2a5c27a8ab8fb6"},"schema_version":"1.0"},"canonical_sha256":"c62b2e10f7f2fc4cd5693973793b08bbf5d5c4472a5d7ff136f602ced94c1044","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:25.783145Z","signature_b64":"3BxBA9gAYYZjI6BlOKFX+1ePhTrp1YBcrSvKoOUAgMuNyKEcwB7OO3l8n1a6L7O4R4x70+2VtVGPoL2+79eIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c62b2e10f7f2fc4cd5693973793b08bbf5d5c4472a5d7ff136f602ced94c1044","last_reissued_at":"2026-05-17T23:52:25.782540Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:25.782540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.11105","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-17T23:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLEky2zOfPS0x+6QhEzFemPOqzsiEiNt+2bbdu5hSjuLDS786GAsOKjKbefofeCSSMJa7YkJmwdNrguvDVghCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:46:40.463845Z"},"content_sha256":"2bd6d55826816c00985cda3f545d283d06defb6aad98e74c32072ed044a13853","schema_version":"1.0","event_id":"sha256:2bd6d55826816c00985cda3f545d283d06defb6aad98e74c32072ed044a13853"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YYVS4EHX6L6EZVLJHFZXSOYIXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum walk inspired algorithm for graph similarity and isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"quant-ph","authors_text":"Callum Schofield, Jingbo B. Wang, Yuying Li","submitted_at":"2019-02-28T14:39:19Z","abstract_excerpt":"Large scale complex systems, such as social networks, electrical power grid, database structure, consumption pattern or brain connectivity, are often modeled using network graphs. Valuable insight can be gained by measuring the similarity between network graphs in order to make quantitative comparisons. Since these networks can be very large, scalability and efficiency of the algorithm are key concerns. More importantly, for graphs with unknown labeling, this graph similarity problem requires exponential time to solve using existing algorithms. In this paper, we propose a quantum walk inspired"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.11105","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-17T23:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtpEHeSXG0u2cNPDhpR4hVqYE3RyoHBWtY1ExT/+sIHJ4PUDnqPswPvGVqSKg0z44R8MhBvObMKZ0zMX7et7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:46:40.464184Z"},"content_sha256":"c56affb55d5e272f5af6613ea60f8015947b84a03dd6b6364522b2d4f4d815db","schema_version":"1.0","event_id":"sha256:c56affb55d5e272f5af6613ea60f8015947b84a03dd6b6364522b2d4f4d815db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYVS4EHX6L6EZVLJHFZXSOYIXP/bundle.json","state_url":"https://pith.science/pith/YYVS4EHX6L6EZVLJHFZXSOYIXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYVS4EHX6L6EZVLJHFZXSOYIXP/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-05-28T10:46:40Z","links":{"resolver":"https://pith.science/pith/YYVS4EHX6L6EZVLJHFZXSOYIXP","bundle":"https://pith.science/pith/YYVS4EHX6L6EZVLJHFZXSOYIXP/bundle.json","state":"https://pith.science/pith/YYVS4EHX6L6EZVLJHFZXSOYIXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYVS4EHX6L6EZVLJHFZXSOYIXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YYVS4EHX6L6EZVLJHFZXSOYIXP","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":"cf626dc5094be29015a52c03203f3fc4179756f612267d842c2a5c27a8ab8fb6","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-28T14:39:19Z","title_canon_sha256":"c9b5df5649970ff75434192fe3765323dd9eceb845bef585b60384328ed1c51f"},"schema_version":"1.0","source":{"id":"1902.11105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.11105","created_at":"2026-05-17T23:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1902.11105v1","created_at":"2026-05-17T23:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.11105","created_at":"2026-05-17T23:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"YYVS4EHX6L6E","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YYVS4EHX6L6EZVLJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YYVS4EHX","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:c56affb55d5e272f5af6613ea60f8015947b84a03dd6b6364522b2d4f4d815db","target":"graph","created_at":"2026-05-17T23:52:25Z","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":"Large scale complex systems, such as social networks, electrical power grid, database structure, consumption pattern or brain connectivity, are often modeled using network graphs. Valuable insight can be gained by measuring the similarity between network graphs in order to make quantitative comparisons. Since these networks can be very large, scalability and efficiency of the algorithm are key concerns. More importantly, for graphs with unknown labeling, this graph similarity problem requires exponential time to solve using existing algorithms. In this paper, we propose a quantum walk inspired","authors_text":"Callum Schofield, Jingbo B. Wang, Yuying Li","cross_cats":["cs.DS","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-28T14:39:19Z","title":"Quantum walk inspired algorithm for graph similarity and isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.11105","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:2bd6d55826816c00985cda3f545d283d06defb6aad98e74c32072ed044a13853","target":"record","created_at":"2026-05-17T23:52:25Z","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":"cf626dc5094be29015a52c03203f3fc4179756f612267d842c2a5c27a8ab8fb6","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-28T14:39:19Z","title_canon_sha256":"c9b5df5649970ff75434192fe3765323dd9eceb845bef585b60384328ed1c51f"},"schema_version":"1.0","source":{"id":"1902.11105","kind":"arxiv","version":1}},"canonical_sha256":"c62b2e10f7f2fc4cd5693973793b08bbf5d5c4472a5d7ff136f602ced94c1044","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c62b2e10f7f2fc4cd5693973793b08bbf5d5c4472a5d7ff136f602ced94c1044","first_computed_at":"2026-05-17T23:52:25.782540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:25.782540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3BxBA9gAYYZjI6BlOKFX+1ePhTrp1YBcrSvKoOUAgMuNyKEcwB7OO3l8n1a6L7O4R4x70+2VtVGPoL2+79eIAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:25.783145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.11105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bd6d55826816c00985cda3f545d283d06defb6aad98e74c32072ed044a13853","sha256:c56affb55d5e272f5af6613ea60f8015947b84a03dd6b6364522b2d4f4d815db"],"state_sha256":"56c16432e41bcd508f394e0c44a0729a078c4e97a7dad4e0033b29807157e21f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPMCaJ1Qb36pAX4PE9FRDwK9vmaUzkwYsJGKvORzK4SrvugjLgPXcARAvgIYxKwbxXWRyuyJuoiYF/BuZ+2NAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:46:40.466157Z","bundle_sha256":"82bfb5e975f5f52dfba0ed96c8d20e2a1680b2e7271893aa6e67a61bbb93378d"}}