{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MRZOWSSNEYYOCUWSN4H2AIMKCF","short_pith_number":"pith:MRZOWSSN","schema_version":"1.0","canonical_sha256":"6472eb4a4d2630e152d26f0fa0218a1143defe2ec48225e7b48d52128a13f028","source":{"kind":"arxiv","id":"2605.18125","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Finding and Enumerating Interconnection Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"No\\'e Demange, Yann Strozecki","submitted_at":"2026-05-18T09:31:19Z","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"},"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":"2605.18125","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-18T09:31:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ae3a42fa86de5873fae33cabb98049babf59677618355882c9a94047fcf5e47","abstract_canon_sha256":"092c7748b2f722973a4b6624c1bc3d2cbdeeec428eb9581d00b11f7fa1a89bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:17.279860Z","signature_b64":"J2GBTnkpbiO8aNP5HJvh1eC+Ty174FzSCBj9A011J0ht+eC+6gSAfMXppMnnrOFWlLHB8GTPMcF+D60dWVhUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6472eb4a4d2630e152d26f0fa0218a1143defe2ec48225e7b48d52128a13f028","last_reissued_at":"2026-05-20T00:05:17.278859Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:17.278859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Finding and Enumerating Interconnection Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"No\\'e Demange, Yann Strozecki","submitted_at":"2026-05-18T09:31:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18125","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/2605.18125/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"6360f937ba351f739ee6c6e990b74d02427f48827d0407efa2d08ee3c568baef"},"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":"2605.18125","created_at":"2026-05-20T00:05:17.279018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18125v1","created_at":"2026-05-20T00:05:17.279018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18125","created_at":"2026-05-20T00:05:17.279018+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRZOWSSNEYYO","created_at":"2026-05-20T00:05:17.279018+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRZOWSSNEYYOCUWS","created_at":"2026-05-20T00:05:17.279018+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRZOWSSN","created_at":"2026-05-20T00:05:17.279018+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/MRZOWSSNEYYOCUWSN4H2AIMKCF","json":"https://pith.science/pith/MRZOWSSNEYYOCUWSN4H2AIMKCF.json","graph_json":"https://pith.science/api/pith-number/MRZOWSSNEYYOCUWSN4H2AIMKCF/graph.json","events_json":"https://pith.science/api/pith-number/MRZOWSSNEYYOCUWSN4H2AIMKCF/events.json","paper":"https://pith.science/paper/MRZOWSSN"},"agent_actions":{"view_html":"https://pith.science/pith/MRZOWSSNEYYOCUWSN4H2AIMKCF","download_json":"https://pith.science/pith/MRZOWSSNEYYOCUWSN4H2AIMKCF.json","view_paper":"https://pith.science/paper/MRZOWSSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18125&json=true","fetch_graph":"https://pith.science/api/pith-number/MRZOWSSNEYYOCUWSN4H2AIMKCF/graph.json","fetch_events":"https://pith.science/api/pith-number/MRZOWSSNEYYOCUWSN4H2AIMKCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRZOWSSNEYYOCUWSN4H2AIMKCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRZOWSSNEYYOCUWSN4H2AIMKCF/action/storage_attestation","attest_author":"https://pith.science/pith/MRZOWSSNEYYOCUWSN4H2AIMKCF/action/author_attestation","sign_citation":"https://pith.science/pith/MRZOWSSNEYYOCUWSN4H2AIMKCF/action/citation_signature","submit_replication":"https://pith.science/pith/MRZOWSSNEYYOCUWSN4H2AIMKCF/action/replication_record"}},"created_at":"2026-05-20T00:05:17.279018+00:00","updated_at":"2026-05-20T00:05:17.279018+00:00"}