{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C2XOKZZSK5QYHA2HU2NGBTCDON","short_pith_number":"pith:C2XOKZZS","canonical_record":{"source":{"id":"1605.04330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T02:59:04Z","cross_cats_sorted":[],"title_canon_sha256":"b5e41c4977fc600e478055f75aa1dac168b2915cc1c9bfc0d245a5af07fc21e9","abstract_canon_sha256":"aff96901d9af5ec6faf79fc6124a9101d77427ae5735cf11f8fa92ff3001c2fb"},"schema_version":"1.0"},"canonical_sha256":"16aee567325761838347a69a60cc43735401199b5eb7f231a275a71c9a4f781b","source":{"kind":"arxiv","id":"1605.04330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04330","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04330v1","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04330","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"C2XOKZZSK5QY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C2XOKZZSK5QYHA2H","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C2XOKZZS","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C2XOKZZSK5QYHA2HU2NGBTCDON","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T02:59:04Z","cross_cats_sorted":[],"title_canon_sha256":"b5e41c4977fc600e478055f75aa1dac168b2915cc1c9bfc0d245a5af07fc21e9","abstract_canon_sha256":"aff96901d9af5ec6faf79fc6124a9101d77427ae5735cf11f8fa92ff3001c2fb"},"schema_version":"1.0"},"canonical_sha256":"16aee567325761838347a69a60cc43735401199b5eb7f231a275a71c9a4f781b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:52.032569Z","signature_b64":"zw5S745/C27E8aM2MlAjz2xh+tVkHQrL02klihus98+M7vNpq6I1EKARreR4MqleftT74JXjmwPiXXmdLqj5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16aee567325761838347a69a60cc43735401199b5eb7f231a275a71c9a4f781b","last_reissued_at":"2026-05-18T01:14:52.031915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:52.031915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04330","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-18T01:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITpWy/lewJTrzOREDjnBnY6FjQRacF4SN8F1IYNL94HdbdTfRSUSvt67KEedBc/2ahK4ucUgGVb9Tf0wxFmSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:06:40.513245Z"},"content_sha256":"ad2097552b89e1f02344d0660bbca5c106bbd05be36158aecabb1fe6fccbdeb6","schema_version":"1.0","event_id":"sha256:ad2097552b89e1f02344d0660bbca5c106bbd05be36158aecabb1fe6fccbdeb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C2XOKZZSK5QYHA2HU2NGBTCDON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge Cut Domination, Irredundance, and Independence in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Renu Laskar, Stephen Hedetniemi, Todd Fenstermacher","submitted_at":"2016-05-06T02:59:04Z","abstract_excerpt":"An edge dominating set $F$ of a graph $G=(V,E)$ is an \\textit{edge cut dominating set} if the subgraph $\\langle V,G-F \\rangle$ is disconnected. The \\textit{edge cut domination number} $\\gamma_{ct}(G)$ of $G$ is the minimum cardinality of an edge cut dominating set of $G.$ In this paper we study the edge cut domination number and investigate its relationships with other parameters of graphs. We also introduce the properties edge cut irredundance and edge cut independence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04330","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-18T01:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JN80L25M/BOKyEN8cL/oKiI3x4s7xNs1kFMi08OiRIpl5MoOqBgSlhJe9sab81WV63YFmswheLelCU5wyyMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:06:40.513600Z"},"content_sha256":"4228f72d68f59899d0d89a0f3a63770dcbb95b7bd7f13d59a8b13ad0be5c2260","schema_version":"1.0","event_id":"sha256:4228f72d68f59899d0d89a0f3a63770dcbb95b7bd7f13d59a8b13ad0be5c2260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2XOKZZSK5QYHA2HU2NGBTCDON/bundle.json","state_url":"https://pith.science/pith/C2XOKZZSK5QYHA2HU2NGBTCDON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2XOKZZSK5QYHA2HU2NGBTCDON/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-02T10:06:40Z","links":{"resolver":"https://pith.science/pith/C2XOKZZSK5QYHA2HU2NGBTCDON","bundle":"https://pith.science/pith/C2XOKZZSK5QYHA2HU2NGBTCDON/bundle.json","state":"https://pith.science/pith/C2XOKZZSK5QYHA2HU2NGBTCDON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2XOKZZSK5QYHA2HU2NGBTCDON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C2XOKZZSK5QYHA2HU2NGBTCDON","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":"aff96901d9af5ec6faf79fc6124a9101d77427ae5735cf11f8fa92ff3001c2fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T02:59:04Z","title_canon_sha256":"b5e41c4977fc600e478055f75aa1dac168b2915cc1c9bfc0d245a5af07fc21e9"},"schema_version":"1.0","source":{"id":"1605.04330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04330","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04330v1","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04330","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"C2XOKZZSK5QY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C2XOKZZSK5QYHA2H","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C2XOKZZS","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:4228f72d68f59899d0d89a0f3a63770dcbb95b7bd7f13d59a8b13ad0be5c2260","target":"graph","created_at":"2026-05-18T01:14:52Z","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":"An edge dominating set $F$ of a graph $G=(V,E)$ is an \\textit{edge cut dominating set} if the subgraph $\\langle V,G-F \\rangle$ is disconnected. The \\textit{edge cut domination number} $\\gamma_{ct}(G)$ of $G$ is the minimum cardinality of an edge cut dominating set of $G.$ In this paper we study the edge cut domination number and investigate its relationships with other parameters of graphs. We also introduce the properties edge cut irredundance and edge cut independence.","authors_text":"Renu Laskar, Stephen Hedetniemi, Todd Fenstermacher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T02:59:04Z","title":"Edge Cut Domination, Irredundance, and Independence in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04330","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:ad2097552b89e1f02344d0660bbca5c106bbd05be36158aecabb1fe6fccbdeb6","target":"record","created_at":"2026-05-18T01:14:52Z","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":"aff96901d9af5ec6faf79fc6124a9101d77427ae5735cf11f8fa92ff3001c2fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T02:59:04Z","title_canon_sha256":"b5e41c4977fc600e478055f75aa1dac168b2915cc1c9bfc0d245a5af07fc21e9"},"schema_version":"1.0","source":{"id":"1605.04330","kind":"arxiv","version":1}},"canonical_sha256":"16aee567325761838347a69a60cc43735401199b5eb7f231a275a71c9a4f781b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16aee567325761838347a69a60cc43735401199b5eb7f231a275a71c9a4f781b","first_computed_at":"2026-05-18T01:14:52.031915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:52.031915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zw5S745/C27E8aM2MlAjz2xh+tVkHQrL02klihus98+M7vNpq6I1EKARreR4MqleftT74JXjmwPiXXmdLqj5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:52.032569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad2097552b89e1f02344d0660bbca5c106bbd05be36158aecabb1fe6fccbdeb6","sha256:4228f72d68f59899d0d89a0f3a63770dcbb95b7bd7f13d59a8b13ad0be5c2260"],"state_sha256":"915b7f31d45756c3daa4a381938305f12480417a50bdfffd196a388d3332f58e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFD8EOjVFlu1Uk0/N9uKJ/ekhFKAyjpXemoC0+4p/bGQShhGOD2sAAtuOEfY4BtUmCmvr9CZVaSsVIZGIuHHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:06:40.515510Z","bundle_sha256":"970f2eb17e68fcce328f2024456404a7367bd6992332271f20c173dd6ae052f9"}}