{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NU2MGUPT7HZXDHBKXUAFB2U2B5","short_pith_number":"pith:NU2MGUPT","canonical_record":{"source":{"id":"1705.08379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-23T15:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"1de6da0fcf8d81421ceb7bdb14d2bf9f3965f50b2c40829dbc13871598a336a9","abstract_canon_sha256":"14927fa9579b3193f37ad0c6bd32705d2eda6f45a513fe455d1514b9b2dfce11"},"schema_version":"1.0"},"canonical_sha256":"6d34c351f3f9f3719c2abd0050ea9a0f4016cb496f47446c6393fb410b643811","source":{"kind":"arxiv","id":"1705.08379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08379","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08379v1","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08379","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"NU2MGUPT7HZX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NU2MGUPT7HZXDHBK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NU2MGUPT","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NU2MGUPT7HZXDHBKXUAFB2U2B5","target":"record","payload":{"canonical_record":{"source":{"id":"1705.08379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-23T15:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"1de6da0fcf8d81421ceb7bdb14d2bf9f3965f50b2c40829dbc13871598a336a9","abstract_canon_sha256":"14927fa9579b3193f37ad0c6bd32705d2eda6f45a513fe455d1514b9b2dfce11"},"schema_version":"1.0"},"canonical_sha256":"6d34c351f3f9f3719c2abd0050ea9a0f4016cb496f47446c6393fb410b643811","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.429964Z","signature_b64":"dk6g2oOrBqZG8JMsdVR6xjbPbfSnsFPJ0Mm5e85ruc1Ljsm2wPnQjHFfWyKDLVX+FkfGCQZpEm8aOvAVkDL3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d34c351f3f9f3719c2abd0050ea9a0f4016cb496f47446c6393fb410b643811","last_reissued_at":"2026-05-18T00:43:48.429507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.429507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.08379","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:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQplQc5aXAGJoPJZ69hvAfCK+ZcY5YJ6Z6EHTwT0b+z1BLuNtxb8bnOg56nzI0Jj3C86mhIb3AjT44UkIU56Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:16:59.739740Z"},"content_sha256":"4fcbefc350e4bab294f63e6e355f15e6c95aee2acd77922883821da88d8d6d65","schema_version":"1.0","event_id":"sha256:4fcbefc350e4bab294f63e6e355f15e6c95aee2acd77922883821da88d8d6d65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NU2MGUPT7HZXDHBKXUAFB2U2B5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect Edge Domination: Hard and Solvable Cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jayme L. Szwarcfiter, Min Chih Lin, Vadim Lozin, Veronica A. Moyano","submitted_at":"2017-05-23T15:53:04Z","abstract_excerpt":"Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E'$ of edges of $G$ is an edge dominating set of $G$, if every edge of the graph is dominated by some edge of $E'$. We say that $E'$ is a perfect edge dominating set of $G$, if every edge not in $E'$ is dominated by exactly one edge of $E'$. The perfect edge dominating problem is to determine a least cardinality perfect edge dominating set of $G$. For this problem, we describe two NP-completeness proofs, for the classes of claw-free graphs of degree at most 3, and for bounded degree graphs, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08379","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:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VubUYNnGtYlcihlz3H4DfMrQ3OklnNrq9lYlxdhNsUQlLp/pomuTvivnHeGFb0eqLY3MDtqztoRedSQUSwd6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:16:59.740448Z"},"content_sha256":"fa318426b7b0296faf84aa4e41b1646c075779c7375d57b200bffe9f2e4921ef","schema_version":"1.0","event_id":"sha256:fa318426b7b0296faf84aa4e41b1646c075779c7375d57b200bffe9f2e4921ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NU2MGUPT7HZXDHBKXUAFB2U2B5/bundle.json","state_url":"https://pith.science/pith/NU2MGUPT7HZXDHBKXUAFB2U2B5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NU2MGUPT7HZXDHBKXUAFB2U2B5/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-07T16:16:59Z","links":{"resolver":"https://pith.science/pith/NU2MGUPT7HZXDHBKXUAFB2U2B5","bundle":"https://pith.science/pith/NU2MGUPT7HZXDHBKXUAFB2U2B5/bundle.json","state":"https://pith.science/pith/NU2MGUPT7HZXDHBKXUAFB2U2B5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NU2MGUPT7HZXDHBKXUAFB2U2B5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NU2MGUPT7HZXDHBKXUAFB2U2B5","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":"14927fa9579b3193f37ad0c6bd32705d2eda6f45a513fe455d1514b9b2dfce11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-23T15:53:04Z","title_canon_sha256":"1de6da0fcf8d81421ceb7bdb14d2bf9f3965f50b2c40829dbc13871598a336a9"},"schema_version":"1.0","source":{"id":"1705.08379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.08379","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.08379v1","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08379","created_at":"2026-05-18T00:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"NU2MGUPT7HZX","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NU2MGUPT7HZXDHBK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NU2MGUPT","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:fa318426b7b0296faf84aa4e41b1646c075779c7375d57b200bffe9f2e4921ef","target":"graph","created_at":"2026-05-18T00:43:48Z","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$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E'$ of edges of $G$ is an edge dominating set of $G$, if every edge of the graph is dominated by some edge of $E'$. We say that $E'$ is a perfect edge dominating set of $G$, if every edge not in $E'$ is dominated by exactly one edge of $E'$. The perfect edge dominating problem is to determine a least cardinality perfect edge dominating set of $G$. For this problem, we describe two NP-completeness proofs, for the classes of claw-free graphs of degree at most 3, and for bounded degree graphs, ","authors_text":"Jayme L. Szwarcfiter, Min Chih Lin, Vadim Lozin, Veronica A. Moyano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-23T15:53:04Z","title":"Perfect Edge Domination: Hard and Solvable Cases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08379","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:4fcbefc350e4bab294f63e6e355f15e6c95aee2acd77922883821da88d8d6d65","target":"record","created_at":"2026-05-18T00:43:48Z","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":"14927fa9579b3193f37ad0c6bd32705d2eda6f45a513fe455d1514b9b2dfce11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-23T15:53:04Z","title_canon_sha256":"1de6da0fcf8d81421ceb7bdb14d2bf9f3965f50b2c40829dbc13871598a336a9"},"schema_version":"1.0","source":{"id":"1705.08379","kind":"arxiv","version":1}},"canonical_sha256":"6d34c351f3f9f3719c2abd0050ea9a0f4016cb496f47446c6393fb410b643811","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d34c351f3f9f3719c2abd0050ea9a0f4016cb496f47446c6393fb410b643811","first_computed_at":"2026-05-18T00:43:48.429507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:48.429507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dk6g2oOrBqZG8JMsdVR6xjbPbfSnsFPJ0Mm5e85ruc1Ljsm2wPnQjHFfWyKDLVX+FkfGCQZpEm8aOvAVkDL3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:48.429964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.08379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fcbefc350e4bab294f63e6e355f15e6c95aee2acd77922883821da88d8d6d65","sha256:fa318426b7b0296faf84aa4e41b1646c075779c7375d57b200bffe9f2e4921ef"],"state_sha256":"4da3b574aedf4a475628ab5b2f22b2f37e1c6ec7b3afac8eb0c16d03d9660e9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrFnnrlRxGekYWNcWFYv6MTt+hXazH9bWi+xX/VHlwzKWFG1UhwcotIbH9fxvp/tZVGeQLZ4WLgHZs3PHZzBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:16:59.744126Z","bundle_sha256":"19947e9a99094bda04eb3c1182a7b0f3c0374610d38e6e38630fd4e284ab4a19"}}