{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GUFV24XEGUQILFJMNK3NXPL7HP","short_pith_number":"pith:GUFV24XE","schema_version":"1.0","canonical_sha256":"350b5d72e4352085952c6ab6dbbd7f3bcdb1480233de5f5ce5700ae3c9bc2414","source":{"kind":"arxiv","id":"1707.01245","version":2},"attestation_state":"computed","paper":{"title":"Maximum Induced Matching Algorithms via Vertex Ordering Characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lalla Mouatadid, Michel Habib","submitted_at":"2017-07-05T07:49:22Z","abstract_excerpt":"We study the maximum induced matching problem on a graph g. Induced matchings correspond to independent sets in L2(g), the square of the line graph of g. The problem is NP-complete on bipartite graphs. In this work, we show that for a number of graph families with forbidden vertex orderings, almost all forbidden patterns on three vertices are preserved when taking the square of the line graph. These orderings can be computed in linear time in the size of the input graph. In particular, given a graph class G characterized by a vertex ordering, and a graph g = (V, E) in G with a corresponding ve"},"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.01245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T07:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"4b770085ae64cabd6bc896c5be9e24cc17e75f544c67cd1d9dd7bb4fc761b757","abstract_canon_sha256":"98d1133b2f0eba35ad88cf311eb1dabb8652a44c27e7d2f56e3fa45fa82fbac3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:37.009170Z","signature_b64":"IoBXbjk82MS8CyHeOMoblvlow77J8bCU+cM+SSIfyph8ds1hH64t7nJ8oAKyVBtsQwFJhIGsz/g9XW1H6lCnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"350b5d72e4352085952c6ab6dbbd7f3bcdb1480233de5f5ce5700ae3c9bc2414","last_reissued_at":"2026-05-18T00:34:37.008695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:37.008695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Induced Matching Algorithms via Vertex Ordering Characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lalla Mouatadid, Michel Habib","submitted_at":"2017-07-05T07:49:22Z","abstract_excerpt":"We study the maximum induced matching problem on a graph g. Induced matchings correspond to independent sets in L2(g), the square of the line graph of g. The problem is NP-complete on bipartite graphs. In this work, we show that for a number of graph families with forbidden vertex orderings, almost all forbidden patterns on three vertices are preserved when taking the square of the line graph. These orderings can be computed in linear time in the size of the input graph. In particular, given a graph class G characterized by a vertex ordering, and a graph g = (V, E) in G with a corresponding ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01245","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":"1707.01245","created_at":"2026-05-18T00:34:37.008765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01245v2","created_at":"2026-05-18T00:34:37.008765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01245","created_at":"2026-05-18T00:34:37.008765+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUFV24XEGUQI","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUFV24XEGUQILFJM","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUFV24XE","created_at":"2026-05-18T12:31:18.294218+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/GUFV24XEGUQILFJMNK3NXPL7HP","json":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP.json","graph_json":"https://pith.science/api/pith-number/GUFV24XEGUQILFJMNK3NXPL7HP/graph.json","events_json":"https://pith.science/api/pith-number/GUFV24XEGUQILFJMNK3NXPL7HP/events.json","paper":"https://pith.science/paper/GUFV24XE"},"agent_actions":{"view_html":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP","download_json":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP.json","view_paper":"https://pith.science/paper/GUFV24XE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01245&json=true","fetch_graph":"https://pith.science/api/pith-number/GUFV24XEGUQILFJMNK3NXPL7HP/graph.json","fetch_events":"https://pith.science/api/pith-number/GUFV24XEGUQILFJMNK3NXPL7HP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/action/storage_attestation","attest_author":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/action/author_attestation","sign_citation":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/action/citation_signature","submit_replication":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/action/replication_record"}},"created_at":"2026-05-18T00:34:37.008765+00:00","updated_at":"2026-05-18T00:34:37.008765+00:00"}