{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A2UKOV6BBW5KB4XES7RMJ3PW5Z","short_pith_number":"pith:A2UKOV6B","schema_version":"1.0","canonical_sha256":"06a8a757c10dbaa0f2e497e2c4edf6ee76211905ec84f67ad2d7dcf85d1476ac","source":{"kind":"arxiv","id":"1702.05447","version":2},"attestation_state":"computed","paper":{"title":"Counting edge-injective homomorphisms and matchings on restricted graph classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holger Dell, Marc Roth, Radu Curticapean","submitted_at":"2017-02-17T17:20:21Z","abstract_excerpt":"We consider the $\\#\\mathsf{W}[1]$-hard problem of counting all matchings with exactly $k$ edges in a given input graph $G$; we prove that it remains $\\#\\mathsf{W}[1]$-hard on graphs $G$ that are line graphs or bipartite graphs with degree $2$ on one side. In our proofs, we use that $k$-matchings in line graphs can be equivalently viewed as edge-injective homomorphisms from the disjoint union of $k$ length-$2$ paths into (arbitrary) host graphs. Here, a homomorphism from $H$ to $G$ is edge-injective if it maps any two distinct edges of $H$ to distinct edges in $G$. We show that edge-injective h"},"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":"1702.05447","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-02-17T17:20:21Z","cross_cats_sorted":[],"title_canon_sha256":"ac8e23a979af165bfd94daa7bd561b23e912c1d94541efb1981521c7ff2f2215","abstract_canon_sha256":"5b5d86a43cb7cdc6651b8deeeaf04625f352d47ef95dac8fc2d39aed7853c1fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:34.618476Z","signature_b64":"M+z3OvDaP2bEtcpbulqxNBf+GwkYT8NAEngwNiKLsRxj51xjg1Hql/fbVTeb+eMo9z9NtVPQaYpe8AafdO6vDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06a8a757c10dbaa0f2e497e2c4edf6ee76211905ec84f67ad2d7dcf85d1476ac","last_reissued_at":"2026-05-18T00:25:34.617751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:34.617751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting edge-injective homomorphisms and matchings on restricted graph classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holger Dell, Marc Roth, Radu Curticapean","submitted_at":"2017-02-17T17:20:21Z","abstract_excerpt":"We consider the $\\#\\mathsf{W}[1]$-hard problem of counting all matchings with exactly $k$ edges in a given input graph $G$; we prove that it remains $\\#\\mathsf{W}[1]$-hard on graphs $G$ that are line graphs or bipartite graphs with degree $2$ on one side. In our proofs, we use that $k$-matchings in line graphs can be equivalently viewed as edge-injective homomorphisms from the disjoint union of $k$ length-$2$ paths into (arbitrary) host graphs. Here, a homomorphism from $H$ to $G$ is edge-injective if it maps any two distinct edges of $H$ to distinct edges in $G$. We show that edge-injective h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05447","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1702.05447","created_at":"2026-05-18T00:25:34.617868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05447v2","created_at":"2026-05-18T00:25:34.617868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05447","created_at":"2026-05-18T00:25:34.617868+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2UKOV6BBW5K","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2UKOV6BBW5KB4XE","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2UKOV6B","created_at":"2026-05-18T12:31:05.417338+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/A2UKOV6BBW5KB4XES7RMJ3PW5Z","json":"https://pith.science/pith/A2UKOV6BBW5KB4XES7RMJ3PW5Z.json","graph_json":"https://pith.science/api/pith-number/A2UKOV6BBW5KB4XES7RMJ3PW5Z/graph.json","events_json":"https://pith.science/api/pith-number/A2UKOV6BBW5KB4XES7RMJ3PW5Z/events.json","paper":"https://pith.science/paper/A2UKOV6B"},"agent_actions":{"view_html":"https://pith.science/pith/A2UKOV6BBW5KB4XES7RMJ3PW5Z","download_json":"https://pith.science/pith/A2UKOV6BBW5KB4XES7RMJ3PW5Z.json","view_paper":"https://pith.science/paper/A2UKOV6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05447&json=true","fetch_graph":"https://pith.science/api/pith-number/A2UKOV6BBW5KB4XES7RMJ3PW5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/A2UKOV6BBW5KB4XES7RMJ3PW5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2UKOV6BBW5KB4XES7RMJ3PW5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2UKOV6BBW5KB4XES7RMJ3PW5Z/action/storage_attestation","attest_author":"https://pith.science/pith/A2UKOV6BBW5KB4XES7RMJ3PW5Z/action/author_attestation","sign_citation":"https://pith.science/pith/A2UKOV6BBW5KB4XES7RMJ3PW5Z/action/citation_signature","submit_replication":"https://pith.science/pith/A2UKOV6BBW5KB4XES7RMJ3PW5Z/action/replication_record"}},"created_at":"2026-05-18T00:25:34.617868+00:00","updated_at":"2026-05-18T00:25:34.617868+00:00"}