{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GTONSVIOBM4NOCYUEHOTCUJQR2","short_pith_number":"pith:GTONSVIO","canonical_record":{"source":{"id":"1706.09301","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-27T15:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"4a899a6039ea5f7e0bb385b323641db5ec1c85a83ea031369c59a7b05b4786ad","abstract_canon_sha256":"3e2f41c3e73de69b7ed584cda116a268dddf3580ae78d640f38e65af211925bb"},"schema_version":"1.0"},"canonical_sha256":"34dcd9550e0b38d70b1421dd3151308e940b01d7f63c862b1522e292297735aa","source":{"kind":"arxiv","id":"1706.09301","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09301","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09301v3","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09301","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"GTONSVIOBM4N","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GTONSVIOBM4NOCYU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GTONSVIO","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GTONSVIOBM4NOCYUEHOTCUJQR2","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09301","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-27T15:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"4a899a6039ea5f7e0bb385b323641db5ec1c85a83ea031369c59a7b05b4786ad","abstract_canon_sha256":"3e2f41c3e73de69b7ed584cda116a268dddf3580ae78d640f38e65af211925bb"},"schema_version":"1.0"},"canonical_sha256":"34dcd9550e0b38d70b1421dd3151308e940b01d7f63c862b1522e292297735aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:53.144283Z","signature_b64":"0J10e41M0AvLOJ224cD8N+jC8bD7CcrstmWTx3PYyrbiTg2Fdiysi1do5V7pwpoPvLLWqwJdJTnZrd1zMb5FBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34dcd9550e0b38d70b1421dd3151308e940b01d7f63c862b1522e292297735aa","last_reissued_at":"2026-05-17T23:48:53.143838Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:53.143838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09301","source_version":3,"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-17T23:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WNrA3rvJ0PbtPMmhQVIRP9ykZiorJl06kDQXWvvWZU6sVZZvK4FQqQw7BjZbM2BaSpa+cv+9R194YCyHim4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:22:38.526102Z"},"content_sha256":"f01adf2e71ad0dc6cde29d9b7dfd5a6e72d3373cc0c959bc1ef328fb52073365","schema_version":"1.0","event_id":"sha256:f01adf2e71ad0dc6cde29d9b7dfd5a6e72d3373cc0c959bc1ef328fb52073365"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GTONSVIOBM4NOCYUEHOTCUJQR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dominating Induced Matchings in $S_{1,2,4}$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","submitted_at":"2017-06-27T15:27:42Z","abstract_excerpt":"Let $G=(V,E)$ be a finite undirected graph without loops and multiple edges. A subset $M \\subseteq E$ of edges is a {\\em dominating induced matching} ({\\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly one edge of $M$. In particular, this means that $M$ is an induced matching, and every edge not in $M$ shares exactly one vertex with an edge in $M$. Clearly, not every graph has a d.i.m.\n  The \\emph{Dominating Induced Matching} (\\emph{DIM}) problem asks for the existence of a d.i.m.\\ in $G$; this problem is also known as the \\emph{Efficient Edge Domination} problem; it is the {\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09301","kind":"arxiv","version":3},"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-17T23:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3cZPp3vEvAh/oD/JA/Cr5ucpYPqP0Q+iN7QJA+RRPZTO2JAmXKfzM5TcSPhjyKwKn8M8JNiVRnCDlSGl0lgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:22:38.526821Z"},"content_sha256":"e8733830523c90f40c13a944fe8c9a8a8db9f150545c66b7e145b8225d1cd8a1","schema_version":"1.0","event_id":"sha256:e8733830523c90f40c13a944fe8c9a8a8db9f150545c66b7e145b8225d1cd8a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTONSVIOBM4NOCYUEHOTCUJQR2/bundle.json","state_url":"https://pith.science/pith/GTONSVIOBM4NOCYUEHOTCUJQR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTONSVIOBM4NOCYUEHOTCUJQR2/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-04T22:22:38Z","links":{"resolver":"https://pith.science/pith/GTONSVIOBM4NOCYUEHOTCUJQR2","bundle":"https://pith.science/pith/GTONSVIOBM4NOCYUEHOTCUJQR2/bundle.json","state":"https://pith.science/pith/GTONSVIOBM4NOCYUEHOTCUJQR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTONSVIOBM4NOCYUEHOTCUJQR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GTONSVIOBM4NOCYUEHOTCUJQR2","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":"3e2f41c3e73de69b7ed584cda116a268dddf3580ae78d640f38e65af211925bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-27T15:27:42Z","title_canon_sha256":"4a899a6039ea5f7e0bb385b323641db5ec1c85a83ea031369c59a7b05b4786ad"},"schema_version":"1.0","source":{"id":"1706.09301","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09301","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09301v3","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09301","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"GTONSVIOBM4N","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GTONSVIOBM4NOCYU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GTONSVIO","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:e8733830523c90f40c13a944fe8c9a8a8db9f150545c66b7e145b8225d1cd8a1","target":"graph","created_at":"2026-05-17T23:48:53Z","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":"Let $G=(V,E)$ be a finite undirected graph without loops and multiple edges. A subset $M \\subseteq E$ of edges is a {\\em dominating induced matching} ({\\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly one edge of $M$. In particular, this means that $M$ is an induced matching, and every edge not in $M$ shares exactly one vertex with an edge in $M$. Clearly, not every graph has a d.i.m.\n  The \\emph{Dominating Induced Matching} (\\emph{DIM}) problem asks for the existence of a d.i.m.\\ in $G$; this problem is also known as the \\emph{Efficient Edge Domination} problem; it is the {\\","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-27T15:27:42Z","title":"Dominating Induced Matchings in $S_{1,2,4}$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09301","kind":"arxiv","version":3},"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:f01adf2e71ad0dc6cde29d9b7dfd5a6e72d3373cc0c959bc1ef328fb52073365","target":"record","created_at":"2026-05-17T23:48:53Z","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":"3e2f41c3e73de69b7ed584cda116a268dddf3580ae78d640f38e65af211925bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-27T15:27:42Z","title_canon_sha256":"4a899a6039ea5f7e0bb385b323641db5ec1c85a83ea031369c59a7b05b4786ad"},"schema_version":"1.0","source":{"id":"1706.09301","kind":"arxiv","version":3}},"canonical_sha256":"34dcd9550e0b38d70b1421dd3151308e940b01d7f63c862b1522e292297735aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34dcd9550e0b38d70b1421dd3151308e940b01d7f63c862b1522e292297735aa","first_computed_at":"2026-05-17T23:48:53.143838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:53.143838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0J10e41M0AvLOJ224cD8N+jC8bD7CcrstmWTx3PYyrbiTg2Fdiysi1do5V7pwpoPvLLWqwJdJTnZrd1zMb5FBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:53.144283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09301","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f01adf2e71ad0dc6cde29d9b7dfd5a6e72d3373cc0c959bc1ef328fb52073365","sha256:e8733830523c90f40c13a944fe8c9a8a8db9f150545c66b7e145b8225d1cd8a1"],"state_sha256":"0fdf47ba758bc6052b7011b789c1e37b7c006db4d56a8c9189c3abd9234b55c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7NgyCyPNWZjq+MmjPiqMNqG2q6peYh5g/U1B8jVQ+cdOQsOYJEUAsIId/QreEwWLvqcSdmb8CjdOuKLi7N0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:22:38.530031Z","bundle_sha256":"8ef367eecbfb85435a00fcd11ada4d476b9ebf6d7f95a2bd51a93cd43341d2c3"}}