{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ML45YJYSNHU2TU2KNDH5W5NW3D","short_pith_number":"pith:ML45YJYS","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"},"canonical_sha256":"62f9dc271269e9a9d34a68cfdb75b6d8d0933626529e0b05ee8df7e107f352a4","source":{"kind":"arxiv","id":"1707.02740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02740","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02740v1","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02740","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"ML45YJYSNHU2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"ML45YJYSNHU2TU2K","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"ML45YJYS","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ML45YJYSNHU2TU2KNDH5W5NW3D","target":"record","payload":{"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"},"canonical_sha256":"62f9dc271269e9a9d34a68cfdb75b6d8d0933626529e0b05ee8df7e107f352a4","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"},"source_kind":"arxiv","source_id":"1707.02740","source_version":1,"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:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpr9pgPlJbxVxNr72JDD/9AfylSQ6bfWJVcDuOLen2MKeQmnGVmXBUUDJuEYh15zzq7qDW9NzJpnfQnzFv76Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:16:53.327160Z"},"content_sha256":"fe6ca341f43e4be8d1536ab670f55e8c60b6fa8a706032870666b7880ddefd0e","schema_version":"1.0","event_id":"sha256:fe6ca341f43e4be8d1536ab670f55e8c60b6fa8a706032870666b7880ddefd0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ML45YJYSNHU2TU2KNDH5W5NW3D","target":"graph","payload":{"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"},"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:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvGYwmGZPa7UuI46+EcUGOrQ6owdfOFwGu70kIDx4J+qZvgCEjUEFZfEGKAveHW4WD8Ql+3AwiXd9vfJ12EFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:16:53.327839Z"},"content_sha256":"322950bd25e0fab9ed0f619886d66a5dc3b23a8c99103d357028eee405bcb11f","schema_version":"1.0","event_id":"sha256:322950bd25e0fab9ed0f619886d66a5dc3b23a8c99103d357028eee405bcb11f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/bundle.json","state_url":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/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-05-27T10:16:53Z","links":{"resolver":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D","bundle":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/bundle.json","state":"https://pith.science/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ML45YJYSNHU2TU2KNDH5W5NW3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ML45YJYSNHU2TU2KNDH5W5NW3D","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":"b392733ac642da5e713b753d39b1a125cd3655d85acd32bd66d99e5c5fe1126c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:27:48Z","title_canon_sha256":"33b065b3a091a8d7b431060560b6bfcd0fa9f4d97ce9a7f72a7bbf54d25c6f6d"},"schema_version":"1.0","source":{"id":"1707.02740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02740","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02740v1","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02740","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"ML45YJYSNHU2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"ML45YJYSNHU2TU2K","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"ML45YJYS","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:322950bd25e0fab9ed0f619886d66a5dc3b23a8c99103d357028eee405bcb11f","target":"graph","created_at":"2026-05-18T00:05:19Z","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 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","authors_text":"Hiroki Arimura, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:27:48Z","title":"Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02740","kind":"arxiv","version":1},"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:fe6ca341f43e4be8d1536ab670f55e8c60b6fa8a706032870666b7880ddefd0e","target":"record","created_at":"2026-05-18T00:05:19Z","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":"b392733ac642da5e713b753d39b1a125cd3655d85acd32bd66d99e5c5fe1126c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:27:48Z","title_canon_sha256":"33b065b3a091a8d7b431060560b6bfcd0fa9f4d97ce9a7f72a7bbf54d25c6f6d"},"schema_version":"1.0","source":{"id":"1707.02740","kind":"arxiv","version":1}},"canonical_sha256":"62f9dc271269e9a9d34a68cfdb75b6d8d0933626529e0b05ee8df7e107f352a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62f9dc271269e9a9d34a68cfdb75b6d8d0933626529e0b05ee8df7e107f352a4","first_computed_at":"2026-05-18T00:05:19.742756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:19.742756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"suRMTaMM11HOlsAxDVYrhMOHSXUfsSsM+delXb7I9g+kEIcfRHTbanmxs7JacGXF3TwYjnkWpWnWsZFvlKBmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:19.743395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe6ca341f43e4be8d1536ab670f55e8c60b6fa8a706032870666b7880ddefd0e","sha256:322950bd25e0fab9ed0f619886d66a5dc3b23a8c99103d357028eee405bcb11f"],"state_sha256":"b3255aa394d919eff239e6afabb11dba19019de2cf8ac9a355396e938470df5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vf/IyKSQaISfHy2MNnP6/P4r2j/zs5GDbbi7GHZVM9Njva7wPRYd8dCr/yOgN+5n9BanBq/PArxYADkUOVYjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:16:53.331542Z","bundle_sha256":"9b681cf6846b6f69ded24d511e2407a8392483f68f2eec61c3d18d4ca20dcd8a"}}