{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SOWJRFMS5755DNDUGM2DO7TVPU","short_pith_number":"pith:SOWJRFMS","schema_version":"1.0","canonical_sha256":"93ac989592effbd1b4743334377e757d28a7c135bf5ac9ff1279e24a0103308f","source":{"kind":"arxiv","id":"2502.11557","version":1},"attestation_state":"computed","paper":{"title":"Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Cheng Long, Kaiqiang Yu, Kaixin Wang, Laks Lakshmanan, Reynold Cheng","submitted_at":"2025-02-17T08:43:49Z","abstract_excerpt":"Given two input graphs, finding the largest subgraph that occurs in both, i.e., finding the maximum common subgraph, is a fundamental operator for evaluating the similarity between two graphs in graph data analysis. Existing works for solving the problem are of either theoretical or practical interest, but not both. Specifically, the algorithms with a theoretical guarantee on the running time are known to be not practically efficient; algorithms following the recently proposed backtracking framework called McSplit, run fast in practice but do not have any theoretical guarantees. In this paper,"},"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":"2502.11557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-17T08:43:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0ce53b66b0ae41678427233b9fd0c50c1d539e4357ea92d426dc009e05dc8db5","abstract_canon_sha256":"127c87a3e214807da373e798f34f3b129092eb9b4091f814786f6260f3d5bb50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:30.772749Z","signature_b64":"cVtXFGa55x5qU++DAEyH0GIYXr8OxvxVqRj1nO2Gc52W208M4jYwtKPqDmkkKUhkvcOILdLusoWfZy2xnLKlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93ac989592effbd1b4743334377e757d28a7c135bf5ac9ff1279e24a0103308f","last_reissued_at":"2026-07-05T10:15:30.772268Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:30.772268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Cheng Long, Kaiqiang Yu, Kaixin Wang, Laks Lakshmanan, Reynold Cheng","submitted_at":"2025-02-17T08:43:49Z","abstract_excerpt":"Given two input graphs, finding the largest subgraph that occurs in both, i.e., finding the maximum common subgraph, is a fundamental operator for evaluating the similarity between two graphs in graph data analysis. Existing works for solving the problem are of either theoretical or practical interest, but not both. Specifically, the algorithms with a theoretical guarantee on the running time are known to be not practically efficient; algorithms following the recently proposed backtracking framework called McSplit, run fast in practice but do not have any theoretical guarantees. In this paper,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11557","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/2502.11557/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":"2502.11557","created_at":"2026-07-05T10:15:30.772324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.11557v1","created_at":"2026-07-05T10:15:30.772324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11557","created_at":"2026-07-05T10:15:30.772324+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOWJRFMS5755","created_at":"2026-07-05T10:15:30.772324+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOWJRFMS5755DNDU","created_at":"2026-07-05T10:15:30.772324+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOWJRFMS","created_at":"2026-07-05T10:15:30.772324+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/SOWJRFMS5755DNDUGM2DO7TVPU","json":"https://pith.science/pith/SOWJRFMS5755DNDUGM2DO7TVPU.json","graph_json":"https://pith.science/api/pith-number/SOWJRFMS5755DNDUGM2DO7TVPU/graph.json","events_json":"https://pith.science/api/pith-number/SOWJRFMS5755DNDUGM2DO7TVPU/events.json","paper":"https://pith.science/paper/SOWJRFMS"},"agent_actions":{"view_html":"https://pith.science/pith/SOWJRFMS5755DNDUGM2DO7TVPU","download_json":"https://pith.science/pith/SOWJRFMS5755DNDUGM2DO7TVPU.json","view_paper":"https://pith.science/paper/SOWJRFMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.11557&json=true","fetch_graph":"https://pith.science/api/pith-number/SOWJRFMS5755DNDUGM2DO7TVPU/graph.json","fetch_events":"https://pith.science/api/pith-number/SOWJRFMS5755DNDUGM2DO7TVPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOWJRFMS5755DNDUGM2DO7TVPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOWJRFMS5755DNDUGM2DO7TVPU/action/storage_attestation","attest_author":"https://pith.science/pith/SOWJRFMS5755DNDUGM2DO7TVPU/action/author_attestation","sign_citation":"https://pith.science/pith/SOWJRFMS5755DNDUGM2DO7TVPU/action/citation_signature","submit_replication":"https://pith.science/pith/SOWJRFMS5755DNDUGM2DO7TVPU/action/replication_record"}},"created_at":"2026-07-05T10:15:30.772324+00:00","updated_at":"2026-07-05T10:15:30.772324+00:00"}