{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GUFV24XEGUQILFJMNK3NXPL7HP","short_pith_number":"pith:GUFV24XE","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"},"canonical_sha256":"350b5d72e4352085952c6ab6dbbd7f3bcdb1480233de5f5ce5700ae3c9bc2414","source":{"kind":"arxiv","id":"1707.01245","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01245","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01245v2","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01245","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"GUFV24XEGUQI","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GUFV24XEGUQILFJM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GUFV24XE","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GUFV24XEGUQILFJMNK3NXPL7HP","target":"record","payload":{"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"},"canonical_sha256":"350b5d72e4352085952c6ab6dbbd7f3bcdb1480233de5f5ce5700ae3c9bc2414","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"},"source_kind":"arxiv","source_id":"1707.01245","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LQKjts5ItdYQ1o3aFL0p0bBRIaCeVAtO3BzWIpUVbPNvj5YMOgwpctJPGT+0EflRk9iLaW+XmJX5BO7xsBtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:12:21.720010Z"},"content_sha256":"04d3cefaf796b11ebeedfa7fdc079c80cc80d8dcda5d63cb73fa148bd84b1c05","schema_version":"1.0","event_id":"sha256:04d3cefaf796b11ebeedfa7fdc079c80cc80d8dcda5d63cb73fa148bd84b1c05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GUFV24XEGUQILFJMNK3NXPL7HP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8ZistATvklPCErB1PObUm9ppI8HvmYymoeiJaSbvfy5Vq+AGizn9jYUGjGoBTq/PyHBvO49LXDu1dLtObNSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:12:21.720369Z"},"content_sha256":"4df77900a1b59441ead3323b8a008a294c732ccf513bfbee70f2838e044cc959","schema_version":"1.0","event_id":"sha256:4df77900a1b59441ead3323b8a008a294c732ccf513bfbee70f2838e044cc959"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/bundle.json","state_url":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUFV24XEGUQILFJMNK3NXPL7HP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T20:12:21Z","links":{"resolver":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP","bundle":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/bundle.json","state":"https://pith.science/pith/GUFV24XEGUQILFJMNK3NXPL7HP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUFV24XEGUQILFJMNK3NXPL7HP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GUFV24XEGUQILFJMNK3NXPL7HP","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":"98d1133b2f0eba35ad88cf311eb1dabb8652a44c27e7d2f56e3fa45fa82fbac3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T07:49:22Z","title_canon_sha256":"4b770085ae64cabd6bc896c5be9e24cc17e75f544c67cd1d9dd7bb4fc761b757"},"schema_version":"1.0","source":{"id":"1707.01245","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01245","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01245v2","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01245","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"GUFV24XEGUQI","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GUFV24XEGUQILFJM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GUFV24XE","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:4df77900a1b59441ead3323b8a008a294c732ccf513bfbee70f2838e044cc959","target":"graph","created_at":"2026-05-18T00:34:37Z","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"},"paper":{"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","authors_text":"Lalla Mouatadid, Michel Habib","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T07:49:22Z","title":"Maximum Induced Matching Algorithms via Vertex Ordering Characterizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01245","kind":"arxiv","version":2},"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:04d3cefaf796b11ebeedfa7fdc079c80cc80d8dcda5d63cb73fa148bd84b1c05","target":"record","created_at":"2026-05-18T00:34:37Z","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":"98d1133b2f0eba35ad88cf311eb1dabb8652a44c27e7d2f56e3fa45fa82fbac3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T07:49:22Z","title_canon_sha256":"4b770085ae64cabd6bc896c5be9e24cc17e75f544c67cd1d9dd7bb4fc761b757"},"schema_version":"1.0","source":{"id":"1707.01245","kind":"arxiv","version":2}},"canonical_sha256":"350b5d72e4352085952c6ab6dbbd7f3bcdb1480233de5f5ce5700ae3c9bc2414","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"350b5d72e4352085952c6ab6dbbd7f3bcdb1480233de5f5ce5700ae3c9bc2414","first_computed_at":"2026-05-18T00:34:37.008695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:37.008695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IoBXbjk82MS8CyHeOMoblvlow77J8bCU+cM+SSIfyph8ds1hH64t7nJ8oAKyVBtsQwFJhIGsz/g9XW1H6lCnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:37.009170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01245","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04d3cefaf796b11ebeedfa7fdc079c80cc80d8dcda5d63cb73fa148bd84b1c05","sha256:4df77900a1b59441ead3323b8a008a294c732ccf513bfbee70f2838e044cc959"],"state_sha256":"e3f281028792300898ed66cb7311a788f1a0213741937dc9057bda0fffadc030"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"evOPugZId6tTZ5DzPbBVYixhXVKkzsy0JGyYenp8lAbct1efhDf1eD9JZb9qeQnl4rjK3bmnJuFe1P/VF4TdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:12:21.722418Z","bundle_sha256":"2b0b446d6594e6189aeb39d7bb8916f17b909357b3c00b0847920fe6f69be11c"}}