{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LYO2CUFU7ICIRTO2REJVMVYJWR","short_pith_number":"pith:LYO2CUFU","schema_version":"1.0","canonical_sha256":"5e1da150b4fa0488cdda8913565709b444e0b380fe2282435f72a02f4d372e73","source":{"kind":"arxiv","id":"2201.06252","version":1},"attestation_state":"computed","paper":{"title":"A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chu-Min Li, Jianrong Zhou, Jiongzhi Zheng, Kun He, Yanli Liu","submitted_at":"2022-01-17T07:32:06Z","abstract_excerpt":"We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) and Leaf vertex Union Match (LUM). Given two graphs for which we search for the maximum common (connected) induced subgraph, the first operator of LSM maintains a score for the branching node using the short-term reward of each vertex of the first graph and the long-term reward of each vertex pair of the two graphs. In this way, the BnB process learns to reduce the search tree size significantly and improve the algori"},"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":"2201.06252","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-17T07:32:06Z","cross_cats_sorted":[],"title_canon_sha256":"59184288fbd3783cfbfb6e00626896ef7e77a2746a1c8c94ab16cb9e99525fcf","abstract_canon_sha256":"b8320d87a8a07f84a2ce7c57b18cb9d0765e547a0c5a2ec6665c140d921afd74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:56.294878Z","signature_b64":"az2X/KPxtHEOaTUdciyMgP990YmFrcNymnnRYsdYbq53gi+mb0V2WuahryrnPz9Z6NZeB5Z7S8df65Vmn/iRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e1da150b4fa0488cdda8913565709b444e0b380fe2282435f72a02f4d372e73","last_reissued_at":"2026-07-05T03:48:56.294356Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:56.294356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chu-Min Li, Jianrong Zhou, Jiongzhi Zheng, Kun He, Yanli Liu","submitted_at":"2022-01-17T07:32:06Z","abstract_excerpt":"We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) and Leaf vertex Union Match (LUM). Given two graphs for which we search for the maximum common (connected) induced subgraph, the first operator of LSM maintains a score for the branching node using the short-term reward of each vertex of the first graph and the long-term reward of each vertex pair of the two graphs. In this way, the BnB process learns to reduce the search tree size significantly and improve the algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06252","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/2201.06252/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":"2201.06252","created_at":"2026-07-05T03:48:56.294422+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.06252v1","created_at":"2026-07-05T03:48:56.294422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06252","created_at":"2026-07-05T03:48:56.294422+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYO2CUFU7ICI","created_at":"2026-07-05T03:48:56.294422+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYO2CUFU7ICIRTO2","created_at":"2026-07-05T03:48:56.294422+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYO2CUFU","created_at":"2026-07-05T03:48:56.294422+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/LYO2CUFU7ICIRTO2REJVMVYJWR","json":"https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR.json","graph_json":"https://pith.science/api/pith-number/LYO2CUFU7ICIRTO2REJVMVYJWR/graph.json","events_json":"https://pith.science/api/pith-number/LYO2CUFU7ICIRTO2REJVMVYJWR/events.json","paper":"https://pith.science/paper/LYO2CUFU"},"agent_actions":{"view_html":"https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR","download_json":"https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR.json","view_paper":"https://pith.science/paper/LYO2CUFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.06252&json=true","fetch_graph":"https://pith.science/api/pith-number/LYO2CUFU7ICIRTO2REJVMVYJWR/graph.json","fetch_events":"https://pith.science/api/pith-number/LYO2CUFU7ICIRTO2REJVMVYJWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR/action/storage_attestation","attest_author":"https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR/action/author_attestation","sign_citation":"https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR/action/citation_signature","submit_replication":"https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR/action/replication_record"}},"created_at":"2026-07-05T03:48:56.294422+00:00","updated_at":"2026-07-05T03:48:56.294422+00:00"}