{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GIOL3WKPEO247EQXAXHZWFZOCA","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":"99d95500bb232846410d9ebf4040ad7f12025624755c5e8a1cd18fb140d75f52","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-06T13:25:41Z","title_canon_sha256":"1f9fcb173c93cf40d302edd9524e18074fc47ac4c0a2b32d5a6c3d0527e381ed"},"schema_version":"1.0","source":{"id":"2403.03696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.03696","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"2403.03696v1","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03696","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"GIOL3WKPEO24","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"pith_short_16","alias_value":"GIOL3WKPEO247EQX","created_at":"2026-07-05T07:52:51Z"},{"alias_kind":"pith_short_8","alias_value":"GIOL3WKP","created_at":"2026-07-05T07:52:51Z"}],"graph_snapshots":[{"event_id":"sha256:3af4c448ce06588809b46761fffef5052e60885324a082dd080d9ebf3482f101","target":"graph","created_at":"2026-07-05T07:52:51Z","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/2403.03696/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A common subgraph of two graphs $G_1$ and $G_2$ is a graph that is isomorphic to subgraphs of $G_1$ and $G_2$. In the largest common subgraph problem the task is to determine a common subgraph for two given graphs $G_1$ and $G_2$ that is of maximum possible size ${\\rm lcs}(G_1,G_2)$. This natural problem generalizes the well-studied graph isomorphism problem, has many applications, and remains NP-hard even restricted to unions of paths. We present a simple $4$-approximation algorithm for forests, and, for every fixed $\\epsilon\\in (0,1)$, we show that, for two given forests $F_1$ and $F_2$ of o","authors_text":"Dieter Rautenbach, Florian Werner","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-06T13:25:41Z","title":"Largest common subgraph of two forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03696","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:84fa9f7a64c6c01bfca6090cd87dd68308323ba0fc1dd066372ea3a0fa6ba5fa","target":"record","created_at":"2026-07-05T07:52:51Z","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":"99d95500bb232846410d9ebf4040ad7f12025624755c5e8a1cd18fb140d75f52","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-06T13:25:41Z","title_canon_sha256":"1f9fcb173c93cf40d302edd9524e18074fc47ac4c0a2b32d5a6c3d0527e381ed"},"schema_version":"1.0","source":{"id":"2403.03696","kind":"arxiv","version":1}},"canonical_sha256":"321cbdd94f23b5cf921705cf9b172e100a745978b0e579d3b5887f37ba9cb9ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"321cbdd94f23b5cf921705cf9b172e100a745978b0e579d3b5887f37ba9cb9ef","first_computed_at":"2026-07-05T07:52:51.803492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:52:51.803492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gfPTYPLHi9MtUprppFkp9U03Cp9Wnw3mWGrmvPdIMSpyBl6Zctx8zKyMx2q9vlApylXLnd5MbCPsfWUk6owcBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:52:51.803876Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.03696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84fa9f7a64c6c01bfca6090cd87dd68308323ba0fc1dd066372ea3a0fa6ba5fa","sha256:3af4c448ce06588809b46761fffef5052e60885324a082dd080d9ebf3482f101"],"state_sha256":"af725d063e4132f0265edb0f92b82ed05206dd7dd53a41f296ad351336c0e02f"}