{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PTJE5P7SKKMW7RBBULHLKDV7PE","short_pith_number":"pith:PTJE5P7S","schema_version":"1.0","canonical_sha256":"7cd24ebff252996fc421a2ceb50ebf790933403fc92371cea6d339edc8572a45","source":{"kind":"arxiv","id":"1911.06511","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.06511","created_at":"2026-07-05T00:19:24.265981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.06511v1","created_at":"2026-07-05T00:19:24.265981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06511","created_at":"2026-07-05T00:19:24.265981+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTJE5P7SKKMW","created_at":"2026-07-05T00:19:24.265981+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTJE5P7SKKMW7RBB","created_at":"2026-07-05T00:19:24.265981+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTJE5P7S","created_at":"2026-07-05T00:19:24.265981+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE","json":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE.json","graph_json":"https://pith.science/api/pith-number/PTJE5P7SKKMW7RBBULHLKDV7PE/graph.json","events_json":"https://pith.science/api/pith-number/PTJE5P7SKKMW7RBBULHLKDV7PE/events.json","paper":"https://pith.science/paper/PTJE5P7S"},"agent_actions":{"view_html":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE","download_json":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE.json","view_paper":"https://pith.science/paper/PTJE5P7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.06511&json=true","fetch_graph":"https://pith.science/api/pith-number/PTJE5P7SKKMW7RBBULHLKDV7PE/graph.json","fetch_events":"https://pith.science/api/pith-number/PTJE5P7SKKMW7RBBULHLKDV7PE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/action/storage_attestation","attest_author":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/action/author_attestation","sign_citation":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/action/citation_signature","submit_replication":"https://pith.science/pith/PTJE5P7SKKMW7RBBULHLKDV7PE/action/replication_record"}},"created_at":"2026-07-05T00:19:24.265981+00:00","updated_at":"2026-07-05T00:19:24.265981+00:00"}