{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:76DRN2UOW7KCRDSD66VQAWASF2","short_pith_number":"pith:76DRN2UO","canonical_record":{"source":{"id":"1408.6196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T18:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"1652fefb3165e1b9fe99333cfc863b99175f4fec84bcc698a73b625faacc9864","abstract_canon_sha256":"65e5cebcc1d4286f266c256fb5cfb6c849077ef7d3218586a42b700baba2b3b5"},"schema_version":"1.0"},"canonical_sha256":"ff8716ea8eb7d4288e43f7ab0058122e839259667fb2820340df8bb3d7babec5","source":{"kind":"arxiv","id":"1408.6196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6196","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6196v1","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6196","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"76DRN2UOW7KC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"76DRN2UOW7KCRDSD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"76DRN2UO","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:76DRN2UOW7KCRDSD66VQAWASF2","target":"record","payload":{"canonical_record":{"source":{"id":"1408.6196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T18:10:49Z","cross_cats_sorted":[],"title_canon_sha256":"1652fefb3165e1b9fe99333cfc863b99175f4fec84bcc698a73b625faacc9864","abstract_canon_sha256":"65e5cebcc1d4286f266c256fb5cfb6c849077ef7d3218586a42b700baba2b3b5"},"schema_version":"1.0"},"canonical_sha256":"ff8716ea8eb7d4288e43f7ab0058122e839259667fb2820340df8bb3d7babec5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:36.819636Z","signature_b64":"XXBenx2Q2lmH4I7vnoxYUPCbTQ7nufHzvU2SjjkUCBuS8JDXICU74hU/0HgYWBHV8aLOIpOTsit1bKps5l6TBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff8716ea8eb7d4288e43f7ab0058122e839259667fb2820340df8bb3d7babec5","last_reissued_at":"2026-05-18T00:38:36.819151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:36.819151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.6196","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:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/u1+QzYpnGs71szd0JDCvfnoEq9EUVFEoeEWrPAl0AXMgD9TheNFMrWPZA7sqpBRJVv01h7q1EB28CgFqACABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:09:06.829029Z"},"content_sha256":"e77f4fae700291c878fbb870e333a50807a56d88c57cda4bc375e69a493fea9a","schema_version":"1.0","event_id":"sha256:e77f4fae700291c878fbb870e333a50807a56d88c57cda4bc375e69a493fea9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:76DRN2UOW7KCRDSD66VQAWASF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Algorithms for Dominating Induced Matching Based on Graph Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Nagamochi, Mingyu Xiao","submitted_at":"2014-08-26T18:10:49Z","abstract_excerpt":"A dominating induced matching, also called an efficient edge domination, of a graph $G=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges is a subset $F \\subseteq E$ of edges in the graph such that no two edges in $F$ share a common endpoint and each edge in $E\\setminus F$ is incident with exactly one edge in $F$. It is NP-hard to decide whether a graph admits a dominating induced matching or not. In this paper, we design a $1.1467^nn^{O(1)}$-time exact algorithm for this problem, improving all previous results. This problem can be redefined as a partition problem that is to partition the vertex s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6196","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:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CVsgpqzYhI7H5G6Twdlbcm8pDNFCoPr/URlVxxg2uWlxFsETR7KWrKPJfEOVWTojSSU91hPUsMIviFmbAiBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:09:06.829651Z"},"content_sha256":"28d8f919b9719998f4e2ab193075834396ea28856cb840fc7d9d323b4b423e12","schema_version":"1.0","event_id":"sha256:28d8f919b9719998f4e2ab193075834396ea28856cb840fc7d9d323b4b423e12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/bundle.json","state_url":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76DRN2UOW7KCRDSD66VQAWASF2/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-28T08:09:06Z","links":{"resolver":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2","bundle":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/bundle.json","state":"https://pith.science/pith/76DRN2UOW7KCRDSD66VQAWASF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76DRN2UOW7KCRDSD66VQAWASF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:76DRN2UOW7KCRDSD66VQAWASF2","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":"65e5cebcc1d4286f266c256fb5cfb6c849077ef7d3218586a42b700baba2b3b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T18:10:49Z","title_canon_sha256":"1652fefb3165e1b9fe99333cfc863b99175f4fec84bcc698a73b625faacc9864"},"schema_version":"1.0","source":{"id":"1408.6196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6196","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6196v1","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6196","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"76DRN2UOW7KC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"76DRN2UOW7KCRDSD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"76DRN2UO","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:28d8f919b9719998f4e2ab193075834396ea28856cb840fc7d9d323b4b423e12","target":"graph","created_at":"2026-05-18T00:38:36Z","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":"A dominating induced matching, also called an efficient edge domination, of a graph $G=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges is a subset $F \\subseteq E$ of edges in the graph such that no two edges in $F$ share a common endpoint and each edge in $E\\setminus F$ is incident with exactly one edge in $F$. It is NP-hard to decide whether a graph admits a dominating induced matching or not. In this paper, we design a $1.1467^nn^{O(1)}$-time exact algorithm for this problem, improving all previous results. This problem can be redefined as a partition problem that is to partition the vertex s","authors_text":"Hiroshi Nagamochi, Mingyu Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T18:10:49Z","title":"Exact Algorithms for Dominating Induced Matching Based on Graph Partition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6196","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:e77f4fae700291c878fbb870e333a50807a56d88c57cda4bc375e69a493fea9a","target":"record","created_at":"2026-05-18T00:38:36Z","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":"65e5cebcc1d4286f266c256fb5cfb6c849077ef7d3218586a42b700baba2b3b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T18:10:49Z","title_canon_sha256":"1652fefb3165e1b9fe99333cfc863b99175f4fec84bcc698a73b625faacc9864"},"schema_version":"1.0","source":{"id":"1408.6196","kind":"arxiv","version":1}},"canonical_sha256":"ff8716ea8eb7d4288e43f7ab0058122e839259667fb2820340df8bb3d7babec5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff8716ea8eb7d4288e43f7ab0058122e839259667fb2820340df8bb3d7babec5","first_computed_at":"2026-05-18T00:38:36.819151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:36.819151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XXBenx2Q2lmH4I7vnoxYUPCbTQ7nufHzvU2SjjkUCBuS8JDXICU74hU/0HgYWBHV8aLOIpOTsit1bKps5l6TBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:36.819636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.6196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e77f4fae700291c878fbb870e333a50807a56d88c57cda4bc375e69a493fea9a","sha256:28d8f919b9719998f4e2ab193075834396ea28856cb840fc7d9d323b4b423e12"],"state_sha256":"80a9a559a6fde5142fe06c5ff3c8c877cdb795bd5978316046976c3f2691159a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDUbKWHGcG701psVxJ8XCRzaNYAuoCrADrwjqgeNiWZXuDpliLq2hs89SaTWGH6JJoNdC9hrbR5t6iXdIYKfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:09:06.832439Z","bundle_sha256":"dde89aab12bfc933f2709a9171a728a8b48ea411d25900a05ad45f87ef90736e"}}