{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MRZOWSSNEYYOCUWSN4H2AIMKCF","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":"092c7748b2f722973a4b6624c1bc3d2cbdeeec428eb9581d00b11f7fa1a89bc9","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-18T09:31:19Z","title_canon_sha256":"5ae3a42fa86de5873fae33cabb98049babf59677618355882c9a94047fcf5e47"},"schema_version":"1.0","source":{"id":"2605.18125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18125","created_at":"2026-05-20T00:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18125v1","created_at":"2026-05-20T00:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18125","created_at":"2026-05-20T00:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"MRZOWSSNEYYO","created_at":"2026-05-20T00:05:17Z"},{"alias_kind":"pith_short_16","alias_value":"MRZOWSSNEYYOCUWS","created_at":"2026-05-20T00:05:17Z"},{"alias_kind":"pith_short_8","alias_value":"MRZOWSSN","created_at":"2026-05-20T00:05:17Z"}],"graph_snapshots":[{"event_id":"sha256:e0cd60dbb1bb14e400ee3ded46a7cd88d7dd9d58c27aa9877fd76fafef12472a","target":"graph","created_at":"2026-05-20T00:05:17Z","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":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T23:41:59.137448Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.398518Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.18125/integrity.json","findings":[],"snapshot_sha256":"6360f937ba351f739ee6c6e990b74d02427f48827d0407efa2d08ee3c568baef","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of connecting the parts of a multipartite graph using a minimum number of edges under a matching constraint. We introduce interconnection trees, defined as matchings whose projections onto the quotient graph form a spanning tree. Motivated by applications in chemoinformatics, we investigate the decision, counting, and enumeration variants of this problem.\n  We show that the decision problem is $NP$-complete. Nevertheless, it becomes tractable in several structured settings: it is fixed-parameter tractable in the number of parts, and admits polynomial or linear-time algorit","authors_text":"No\\'e Demange, Yann Strozecki","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-18T09:31:19Z","title":"Complexity of Finding and Enumerating Interconnection Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18125","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:d926f5316a3f0b9b5fc8d3f91277026c46525cc8f619f26ce2ac52b4062b0ac7","target":"record","created_at":"2026-05-20T00:05:17Z","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":"092c7748b2f722973a4b6624c1bc3d2cbdeeec428eb9581d00b11f7fa1a89bc9","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-18T09:31:19Z","title_canon_sha256":"5ae3a42fa86de5873fae33cabb98049babf59677618355882c9a94047fcf5e47"},"schema_version":"1.0","source":{"id":"2605.18125","kind":"arxiv","version":1}},"canonical_sha256":"6472eb4a4d2630e152d26f0fa0218a1143defe2ec48225e7b48d52128a13f028","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6472eb4a4d2630e152d26f0fa0218a1143defe2ec48225e7b48d52128a13f028","first_computed_at":"2026-05-20T00:05:17.278859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:17.278859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J2GBTnkpbiO8aNP5HJvh1eC+Ty174FzSCBj9A011J0ht+eC+6gSAfMXppMnnrOFWlLHB8GTPMcF+D60dWVhUBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:17.279860Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d926f5316a3f0b9b5fc8d3f91277026c46525cc8f619f26ce2ac52b4062b0ac7","sha256:e0cd60dbb1bb14e400ee3ded46a7cd88d7dd9d58c27aa9877fd76fafef12472a"],"state_sha256":"3acfbf56a0ff2b62684a32444456eeffc9e6dd72f9afd7abf3fbdd787a142955"}