{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XRIR4PKAGRXKEZMUZYNZ7ZOQMV","short_pith_number":"pith:XRIR4PKA","canonical_record":{"source":{"id":"1706.04894","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-14T13:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"0097ee5c290c4edaa8ae5904f3bdd373b68e3286f3288e120e8d46af8ba08294","abstract_canon_sha256":"bc59ea5a79afd3c4d022bc8187cbf9c8afa13f08a2e16411c512578adc19d423"},"schema_version":"1.0"},"canonical_sha256":"bc511e3d40346ea26594ce1b9fe5d06556b5d8239cec27b35eed26a238966f22","source":{"kind":"arxiv","id":"1706.04894","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04894","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04894v5","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04894","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"pith_short_12","alias_value":"XRIR4PKAGRXK","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"XRIR4PKAGRXKEZMU","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"XRIR4PKA","created_at":"2026-07-05T00:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XRIR4PKAGRXKEZMUZYNZ7ZOQMV","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04894","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-14T13:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"0097ee5c290c4edaa8ae5904f3bdd373b68e3286f3288e120e8d46af8ba08294","abstract_canon_sha256":"bc59ea5a79afd3c4d022bc8187cbf9c8afa13f08a2e16411c512578adc19d423"},"schema_version":"1.0"},"canonical_sha256":"bc511e3d40346ea26594ce1b9fe5d06556b5d8239cec27b35eed26a238966f22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:34.604214Z","signature_b64":"asTSiry2fp8y1ljCKxIXHpkXNy9bc9nDaBZJE0lI59cBQh4/rKZ7k88oKfiomBdTTO45rgNdz1m1bHilR2HJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc511e3d40346ea26594ce1b9fe5d06556b5d8239cec27b35eed26a238966f22","last_reissued_at":"2026-07-05T00:29:34.603817Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:34.603817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04894","source_version":5,"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-07-05T00:29:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kWkEc9nDBAKApWcNCSODlId6HsYlkf/OJq9v1+7TvLvLS0aQV4xs5XLRC9QaZZCBK9njrOynfMsRpKVVlTp2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:42:03.198460Z"},"content_sha256":"ab1e79e303446b677d0e5d807422f50195cb68ef1ba242ba0bd510a4b7e837f3","schema_version":"1.0","event_id":"sha256:ab1e79e303446b677d0e5d807422f50195cb68ef1ba242ba0bd510a4b7e837f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XRIR4PKAGRXKEZMUZYNZ7ZOQMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time","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-14T13:45:52Z","abstract_excerpt":"Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \\subseteq E$ is a {\\em dominating induced matching} ({\\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. 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 Efficient Domination problem for line graphs.\n  The DIM problem is \\NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree 3 and is solvable in linear time for $P_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04894","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1706.04894/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:29:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nULhQKx5skmBKdziw0QRAjRm8SBO/Zob9IdGaSFbV9l2tknAJA8aquu2hjK0tHzNAYw/rEZQnyTlFhVPtFheAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:42:03.199053Z"},"content_sha256":"597c6ea081c61d84b39d8a70456516026a7ecf5f9cd47342ccb526696273aa3e","schema_version":"1.0","event_id":"sha256:597c6ea081c61d84b39d8a70456516026a7ecf5f9cd47342ccb526696273aa3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRIR4PKAGRXKEZMUZYNZ7ZOQMV/bundle.json","state_url":"https://pith.science/pith/XRIR4PKAGRXKEZMUZYNZ7ZOQMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRIR4PKAGRXKEZMUZYNZ7ZOQMV/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-08-22T08:42:03Z","links":{"resolver":"https://pith.science/pith/XRIR4PKAGRXKEZMUZYNZ7ZOQMV","bundle":"https://pith.science/pith/XRIR4PKAGRXKEZMUZYNZ7ZOQMV/bundle.json","state":"https://pith.science/pith/XRIR4PKAGRXKEZMUZYNZ7ZOQMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRIR4PKAGRXKEZMUZYNZ7ZOQMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XRIR4PKAGRXKEZMUZYNZ7ZOQMV","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":"bc59ea5a79afd3c4d022bc8187cbf9c8afa13f08a2e16411c512578adc19d423","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-14T13:45:52Z","title_canon_sha256":"0097ee5c290c4edaa8ae5904f3bdd373b68e3286f3288e120e8d46af8ba08294"},"schema_version":"1.0","source":{"id":"1706.04894","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04894","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04894v5","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04894","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"pith_short_12","alias_value":"XRIR4PKAGRXK","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"XRIR4PKAGRXKEZMU","created_at":"2026-07-05T00:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"XRIR4PKA","created_at":"2026-07-05T00:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:597c6ea081c61d84b39d8a70456516026a7ecf5f9cd47342ccb526696273aa3e","target":"graph","created_at":"2026-07-05T00:29:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1706.04894/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \\subseteq E$ is a {\\em dominating induced matching} ({\\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. 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 Efficient Domination problem for line graphs.\n  The DIM problem is \\NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree 3 and is solvable in linear time for $P_","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-14T13:45:52Z","title":"Finding Dominating Induced Matchings in $(S_{2,2,3})$-Free Graphs in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04894","kind":"arxiv","version":5},"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:ab1e79e303446b677d0e5d807422f50195cb68ef1ba242ba0bd510a4b7e837f3","target":"record","created_at":"2026-07-05T00:29:34Z","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":"bc59ea5a79afd3c4d022bc8187cbf9c8afa13f08a2e16411c512578adc19d423","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-14T13:45:52Z","title_canon_sha256":"0097ee5c290c4edaa8ae5904f3bdd373b68e3286f3288e120e8d46af8ba08294"},"schema_version":"1.0","source":{"id":"1706.04894","kind":"arxiv","version":5}},"canonical_sha256":"bc511e3d40346ea26594ce1b9fe5d06556b5d8239cec27b35eed26a238966f22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc511e3d40346ea26594ce1b9fe5d06556b5d8239cec27b35eed26a238966f22","first_computed_at":"2026-07-05T00:29:34.603817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:34.603817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"asTSiry2fp8y1ljCKxIXHpkXNy9bc9nDaBZJE0lI59cBQh4/rKZ7k88oKfiomBdTTO45rgNdz1m1bHilR2HJDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:34.604214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04894","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab1e79e303446b677d0e5d807422f50195cb68ef1ba242ba0bd510a4b7e837f3","sha256:597c6ea081c61d84b39d8a70456516026a7ecf5f9cd47342ccb526696273aa3e"],"state_sha256":"1b9d18b95bef4ced5fb1cabc4711c83749c0cb36c9b2d6dc334db59c4100c10e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"biAawsuE2nJjAVsR2fi92519o02sIChLjSMyhulXbr6ZQ5FDa5ipkZGV6tOvVSyHjKXWUQk3jKgpZfdfDm6RBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T08:42:03.203907Z","bundle_sha256":"f8353c1f84d443b8413f6c274a057ad19b30823ab235e7a057b901f4a9b5aa9e"}}