{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PTJE5P7SKKMW7RBBULHLKDV7PE","short_pith_number":"pith:PTJE5P7S","canonical_record":{"source":{"id":"1911.06511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T08:25:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8ddde3fe70e5d2e497b336278c96bcaec9173122df60e57ea84b189a5a38d657","abstract_canon_sha256":"fd98d1a233c9c28ede6d71f5bcf67a4367270f92d6f06fa7d7e279faf2aaa7d1"},"schema_version":"1.0"},"canonical_sha256":"7cd24ebff252996fc421a2ceb50ebf790933403fc92371cea6d339edc8572a45","source":{"kind":"arxiv","id":"1911.06511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06511","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06511v1","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06511","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"PTJE5P7SKKMW","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"PTJE5P7SKKMW7RBB","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"PTJE5P7S","created_at":"2026-07-05T00:19:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PTJE5P7SKKMW7RBBULHLKDV7PE","target":"record","payload":{"canonical_record":{"source":{"id":"1911.06511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T08:25:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8ddde3fe70e5d2e497b336278c96bcaec9173122df60e57ea84b189a5a38d657","abstract_canon_sha256":"fd98d1a233c9c28ede6d71f5bcf67a4367270f92d6f06fa7d7e279faf2aaa7d1"},"schema_version":"1.0"},"canonical_sha256":"7cd24ebff252996fc421a2ceb50ebf790933403fc92371cea6d339edc8572a45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:24.266384Z","signature_b64":"/X5Po2GMJ8XLZ9nI/XuvQhklrEwxr5kKM4sKoEDfr34eDViMKoA0NS7GhVllJzvSNeUpZG8ZF8zbTjfKlFEQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cd24ebff252996fc421a2ceb50ebf790933403fc92371cea6d339edc8572a45","last_reissued_at":"2026-07-05T00:19:24.265923Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:24.265923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.06511","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:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eEbLuPEW1IKA/DzWrGwEJlphMcJ85jJGMT0OWlEmuOe8JP/uREF0BcH4TQW+32nkadNo87l3Swzrr9JqcR8LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:17:34.424764Z"},"content_sha256":"2e21c87d1d086ac8edd5abcda81fa7a1d7374c0a0568771e3e17696443a25a0a","schema_version":"1.0","event_id":"sha256:2e21c87d1d086ac8edd5abcda81fa7a1d7374c0a0568771e3e17696443a25a0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PTJE5P7SKKMW7RBBULHLKDV7PE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Iso/Auto-morphism: A Divide-&-Conquer Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Can Lu, Hong Cheng, Jeffrey Xu Yu, Zhiwei Zhang","submitted_at":"2019-11-15T08:25:13Z","abstract_excerpt":"The graph isomorphism is to determine whether two graphs are isomorphic. A closely related problem is automorphism detection, where an isomorphism between two graphs is a bijection between their vertex sets that preserves adjacency, and an automorphism is an isomorphism from a graph to itself. Applications of graph isomorphism/automorphism include database indexing, network simplification, network anonymization. By graph automorphism, we deal with symmetric subgraph matching (SSM), which is to find all subgraphs that are symmetric to a given subgraph in G. An application of SSM is to identify "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06511","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/1911.06511/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:19:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDC0XOOUSrLgLw9xQ6ZqQbAMopnYnydz/6Mryw62F1r5ratrG4v4VxPwjUescuHD/cr7l8Kkw83grPlvmXIuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T16:17:34.425618Z"},"content_sha256":"3e22575d0cba9d48dbde162a68c7d30b27acce5d291aad2e46f359f5f41441df","schema_version":"1.0","event_id":"sha256:3e22575d0cba9d48dbde162a68c7d30b27acce5d291aad2e46f359f5f41441df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/bundle.json","state_url":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/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-13T16:17:34Z","links":{"resolver":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE","bundle":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/bundle.json","state":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PTJE5P7SKKMW7RBBULHLKDV7PE","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":"fd98d1a233c9c28ede6d71f5bcf67a4367270f92d6f06fa7d7e279faf2aaa7d1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T08:25:13Z","title_canon_sha256":"8ddde3fe70e5d2e497b336278c96bcaec9173122df60e57ea84b189a5a38d657"},"schema_version":"1.0","source":{"id":"1911.06511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06511","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06511v1","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06511","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"pith_short_12","alias_value":"PTJE5P7SKKMW","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"pith_short_16","alias_value":"PTJE5P7SKKMW7RBB","created_at":"2026-07-05T00:19:24Z"},{"alias_kind":"pith_short_8","alias_value":"PTJE5P7S","created_at":"2026-07-05T00:19:24Z"}],"graph_snapshots":[{"event_id":"sha256:3e22575d0cba9d48dbde162a68c7d30b27acce5d291aad2e46f359f5f41441df","target":"graph","created_at":"2026-07-05T00:19: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/1911.06511/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The graph isomorphism is to determine whether two graphs are isomorphic. A closely related problem is automorphism detection, where an isomorphism between two graphs is a bijection between their vertex sets that preserves adjacency, and an automorphism is an isomorphism from a graph to itself. Applications of graph isomorphism/automorphism include database indexing, network simplification, network anonymization. By graph automorphism, we deal with symmetric subgraph matching (SSM), which is to find all subgraphs that are symmetric to a given subgraph in G. An application of SSM is to identify ","authors_text":"Can Lu, Hong Cheng, Jeffrey Xu Yu, Zhiwei Zhang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T08:25:13Z","title":"Graph Iso/Auto-morphism: A Divide-&-Conquer Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06511","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:2e21c87d1d086ac8edd5abcda81fa7a1d7374c0a0568771e3e17696443a25a0a","target":"record","created_at":"2026-07-05T00:19: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":"fd98d1a233c9c28ede6d71f5bcf67a4367270f92d6f06fa7d7e279faf2aaa7d1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T08:25:13Z","title_canon_sha256":"8ddde3fe70e5d2e497b336278c96bcaec9173122df60e57ea84b189a5a38d657"},"schema_version":"1.0","source":{"id":"1911.06511","kind":"arxiv","version":1}},"canonical_sha256":"7cd24ebff252996fc421a2ceb50ebf790933403fc92371cea6d339edc8572a45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cd24ebff252996fc421a2ceb50ebf790933403fc92371cea6d339edc8572a45","first_computed_at":"2026-07-05T00:19:24.265923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:24.265923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/X5Po2GMJ8XLZ9nI/XuvQhklrEwxr5kKM4sKoEDfr34eDViMKoA0NS7GhVllJzvSNeUpZG8ZF8zbTjfKlFEQBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:24.266384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.06511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e21c87d1d086ac8edd5abcda81fa7a1d7374c0a0568771e3e17696443a25a0a","sha256:3e22575d0cba9d48dbde162a68c7d30b27acce5d291aad2e46f359f5f41441df"],"state_sha256":"dbb2fd17f30a94fb5712ad4229084ce9a953ae6e7c45217203093502f5c90afe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dP/t35W4eRJ2I/BXxqmL2tRzv8enBKowRekfLCssbtbN6NpOWjSegAREzbdzCnD79RNIfB5Hq6Z/PDrRNoLdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T16:17:34.434296Z","bundle_sha256":"2c696b7675f1bd89e9f9ff786d1d2cd8c419d022276609e7791c6d7e31a2881c"}}