{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ML45YJYSNHU2TU2KNDH5W5NW3D","short_pith_number":"pith:ML45YJYS","schema_version":"1.0","canonical_sha256":"62f9dc271269e9a9d34a68cfdb75b6d8d0933626529e0b05ee8df7e107f352a4","source":{"kind":"arxiv","id":"1707.02740","version":1},"attestation_state":"computed","paper":{"title":"Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroki Arimura, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno","submitted_at":"2017-07-10T08:27:48Z","abstract_excerpt":"We address the induced matching enumeration problem. An edge set $M$ is an induced matching of a graph $G =(V,E)$. The enumeration of matchings are widely studied in literature, but the induced matching has not been paid much attention. A straightforward algorithm takes $O(|V|)$ time for each solution, that is coming from the time to generate a subproblem. We investigated local structures that enables us to generate subproblems in short time, and proved that the time complexity will be $O(1)$ if the input graph is $C_4$-free. A $C_4$-free graph is a graph any whose subgraph is not a cycle of l"},"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":"1707.02740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:27:48Z","cross_cats_sorted":[],"title_canon_sha256":"33b065b3a091a8d7b431060560b6bfcd0fa9f4d97ce9a7f72a7bbf54d25c6f6d","abstract_canon_sha256":"b392733ac642da5e713b753d39b1a125cd3655d85acd32bd66d99e5c5fe1126c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.743395Z","signature_b64":"suRMTaMM11HOlsAxDVYrhMOHSXUfsSsM+delXb7I9g+kEIcfRHTbanmxs7JacGXF3TwYjnkWpWnWsZFvlKBmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62f9dc271269e9a9d34a68cfdb75b6d8d0933626529e0b05ee8df7e107f352a4","last_reissued_at":"2026-05-18T00:05:19.742756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.742756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroki Arimura, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno","submitted_at":"2017-07-10T08:27:48Z","abstract_excerpt":"We address the induced matching enumeration problem. An edge set $M$ is an induced matching of a graph $G =(V,E)$. The enumeration of matchings are widely studied in literature, but the induced matching has not been paid much attention. A straightforward algorithm takes $O(|V|)$ time for each solution, that is coming from the time to generate a subproblem. We investigated local structures that enables us to generate subproblems in short time, and proved that the time complexity will be $O(1)$ if the input graph is $C_4$-free. A $C_4$-free graph is a graph any whose subgraph is not a cycle of l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02740","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":""},"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":"1707.02740","created_at":"2026-05-18T00:05:19.742881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02740v1","created_at":"2026-05-18T00:05:19.742881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02740","created_at":"2026-05-18T00:05:19.742881+00:00"},{"alias_kind":"pith_short_12","alias_value":"ML45YJYSNHU2","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"ML45YJYSNHU2TU2K","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"ML45YJYS","created_at":"2026-05-18T12:31:31.346846+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/ML45YJYSNHU2TU2KNDH5W5NW3D","json":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D.json","graph_json":"https://pith.science/api/pith-number/ML45YJYSNHU2TU2KNDH5W5NW3D/graph.json","events_json":"https://pith.science/api/pith-number/ML45YJYSNHU2TU2KNDH5W5NW3D/events.json","paper":"https://pith.science/paper/ML45YJYS"},"agent_actions":{"view_html":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D","download_json":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D.json","view_paper":"https://pith.science/paper/ML45YJYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02740&json=true","fetch_graph":"https://pith.science/api/pith-number/ML45YJYSNHU2TU2KNDH5W5NW3D/graph.json","fetch_events":"https://pith.science/api/pith-number/ML45YJYSNHU2TU2KNDH5W5NW3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/action/storage_attestation","attest_author":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/action/author_attestation","sign_citation":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/action/citation_signature","submit_replication":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/action/replication_record"}},"created_at":"2026-05-18T00:05:19.742881+00:00","updated_at":"2026-05-18T00:05:19.742881+00:00"}