{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LYO2CUFU7ICIRTO2REJVMVYJWR","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":"b8320d87a8a07f84a2ce7c57b18cb9d0765e547a0c5a2ec6665c140d921afd74","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-17T07:32:06Z","title_canon_sha256":"59184288fbd3783cfbfb6e00626896ef7e77a2746a1c8c94ab16cb9e99525fcf"},"schema_version":"1.0","source":{"id":"2201.06252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06252","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06252v1","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06252","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_12","alias_value":"LYO2CUFU7ICI","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_16","alias_value":"LYO2CUFU7ICIRTO2","created_at":"2026-07-05T03:48:56Z"},{"alias_kind":"pith_short_8","alias_value":"LYO2CUFU","created_at":"2026-07-05T03:48:56Z"}],"graph_snapshots":[{"event_id":"sha256:c8389ff6901781bd51c86e1600cd150a86ed0dc5ee1db8f132a19b8cf5e6cea5","target":"graph","created_at":"2026-07-05T03:48:56Z","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/2201.06252/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chu-Min Li, Jianrong Zhou, Jiongzhi Zheng, Kun He, Yanli Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-17T07:32:06Z","title":"A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06252","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:b2027ac35936dff4a3f5ee93185d0fb8f23adf83d988113c2e670022c0fbf7f8","target":"record","created_at":"2026-07-05T03:48:56Z","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":"b8320d87a8a07f84a2ce7c57b18cb9d0765e547a0c5a2ec6665c140d921afd74","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-17T07:32:06Z","title_canon_sha256":"59184288fbd3783cfbfb6e00626896ef7e77a2746a1c8c94ab16cb9e99525fcf"},"schema_version":"1.0","source":{"id":"2201.06252","kind":"arxiv","version":1}},"canonical_sha256":"5e1da150b4fa0488cdda8913565709b444e0b380fe2282435f72a02f4d372e73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e1da150b4fa0488cdda8913565709b444e0b380fe2282435f72a02f4d372e73","first_computed_at":"2026-07-05T03:48:56.294356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:56.294356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"az2X/KPxtHEOaTUdciyMgP990YmFrcNymnnRYsdYbq53gi+mb0V2WuahryrnPz9Z6NZeB5Z7S8df65Vmn/iRAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:56.294878Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.06252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2027ac35936dff4a3f5ee93185d0fb8f23adf83d988113c2e670022c0fbf7f8","sha256:c8389ff6901781bd51c86e1600cd150a86ed0dc5ee1db8f132a19b8cf5e6cea5"],"state_sha256":"1bae250582f42c2562ed3dd5074c8dfe9b0e24c079e69fa883cadac865785270"}