{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7B2RYG6SA5NWSPEPJ5SKSYCT7A","short_pith_number":"pith:7B2RYG6S","canonical_record":{"source":{"id":"1707.02039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-07T05:29:09Z","cross_cats_sorted":[],"title_canon_sha256":"e484ad37017bdc35a131ad01568ab5d129614ef69bab9fa87e30d1aba877f039","abstract_canon_sha256":"6a5d8aae8eda0b7507134f87e82d5c59d9a7ef6aeef672798bef45010c25890f"},"schema_version":"1.0"},"canonical_sha256":"f8751c1bd2075b693c8f4f64a96053f809118d582db0103719c24390ddcd77e0","source":{"kind":"arxiv","id":"1707.02039","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02039","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02039v1","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02039","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"7B2RYG6SA5NW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7B2RYG6SA5NWSPEP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7B2RYG6S","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7B2RYG6SA5NWSPEPJ5SKSYCT7A","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-07T05:29:09Z","cross_cats_sorted":[],"title_canon_sha256":"e484ad37017bdc35a131ad01568ab5d129614ef69bab9fa87e30d1aba877f039","abstract_canon_sha256":"6a5d8aae8eda0b7507134f87e82d5c59d9a7ef6aeef672798bef45010c25890f"},"schema_version":"1.0"},"canonical_sha256":"f8751c1bd2075b693c8f4f64a96053f809118d582db0103719c24390ddcd77e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:45.401077Z","signature_b64":"njAy/kYVsQJGp+xYCCHkiGtSjuUnVJhkU4WywcQWxo0L5cLOsWxrphulg48OJWz8KWMeVNFUyeVVdJhGHxsuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8751c1bd2075b693c8f4f64a96053f809118d582db0103719c24390ddcd77e0","last_reissued_at":"2026-05-18T00:40:45.400406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:45.400406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02039","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:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dlLAZyNdFAdm8zCp//JriS5/Wljy6tOlVrAFXQxeanTtfux6mqpW0vZTTBOcbRM2Yz89tDukEz3QTvnrbarCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:35:56.586756Z"},"content_sha256":"97e164f0c63bcdb5bc859f0b2916b4020b60f4f4d5c3829306583234ca387d36","schema_version":"1.0","event_id":"sha256:97e164f0c63bcdb5bc859f0b2916b4020b60f4f4d5c3829306583234ca387d36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7B2RYG6SA5NWSPEPJ5SKSYCT7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on some variations of the $\\gamma$-graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C.M. Mynhardt, L.E. Teshima","submitted_at":"2017-07-07T05:29:09Z","abstract_excerpt":"For a graph $G$, the $\\gamma$-graph of $G$, $G(\\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\\gamma)$ are adjacent if and only if their corresponding dominating sets in $G$ differ by exactly two adjacent vertices. In this paper, we present several variations of the $\\gamma$-graph including those using identifying codes, locating-domination, total-domination, paired-domination, and the upper-domination number. For each, we show that for any graph $H$, there exist infinitely many graphs whose $\\gamma$-graph variant is isomorp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02039","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:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrqmG8c94HQoOuY+7YY9/kT76QbftFFY+/FGEVVK4qFrZrB2hjSg6BRVzWpeRvJkafBkujrwfrI4jRmGaHPlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:35:56.587404Z"},"content_sha256":"410ba4ae4c3a5f3df13cd0f8637b9a0c5e6d3759fc68a8bccc0889eda69a89f6","schema_version":"1.0","event_id":"sha256:410ba4ae4c3a5f3df13cd0f8637b9a0c5e6d3759fc68a8bccc0889eda69a89f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/bundle.json","state_url":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/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-07T04:35:56Z","links":{"resolver":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A","bundle":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/bundle.json","state":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7B2RYG6SA5NWSPEPJ5SKSYCT7A","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":"6a5d8aae8eda0b7507134f87e82d5c59d9a7ef6aeef672798bef45010c25890f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-07T05:29:09Z","title_canon_sha256":"e484ad37017bdc35a131ad01568ab5d129614ef69bab9fa87e30d1aba877f039"},"schema_version":"1.0","source":{"id":"1707.02039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02039","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02039v1","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02039","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"7B2RYG6SA5NW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7B2RYG6SA5NWSPEP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7B2RYG6S","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:410ba4ae4c3a5f3df13cd0f8637b9a0c5e6d3759fc68a8bccc0889eda69a89f6","target":"graph","created_at":"2026-05-18T00:40:45Z","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":"For a graph $G$, the $\\gamma$-graph of $G$, $G(\\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\\gamma)$ are adjacent if and only if their corresponding dominating sets in $G$ differ by exactly two adjacent vertices. In this paper, we present several variations of the $\\gamma$-graph including those using identifying codes, locating-domination, total-domination, paired-domination, and the upper-domination number. For each, we show that for any graph $H$, there exist infinitely many graphs whose $\\gamma$-graph variant is isomorp","authors_text":"C.M. Mynhardt, L.E. Teshima","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-07T05:29:09Z","title":"A note on some variations of the $\\gamma$-graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02039","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:97e164f0c63bcdb5bc859f0b2916b4020b60f4f4d5c3829306583234ca387d36","target":"record","created_at":"2026-05-18T00:40:45Z","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":"6a5d8aae8eda0b7507134f87e82d5c59d9a7ef6aeef672798bef45010c25890f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-07T05:29:09Z","title_canon_sha256":"e484ad37017bdc35a131ad01568ab5d129614ef69bab9fa87e30d1aba877f039"},"schema_version":"1.0","source":{"id":"1707.02039","kind":"arxiv","version":1}},"canonical_sha256":"f8751c1bd2075b693c8f4f64a96053f809118d582db0103719c24390ddcd77e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8751c1bd2075b693c8f4f64a96053f809118d582db0103719c24390ddcd77e0","first_computed_at":"2026-05-18T00:40:45.400406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:45.400406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"njAy/kYVsQJGp+xYCCHkiGtSjuUnVJhkU4WywcQWxo0L5cLOsWxrphulg48OJWz8KWMeVNFUyeVVdJhGHxsuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:45.401077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97e164f0c63bcdb5bc859f0b2916b4020b60f4f4d5c3829306583234ca387d36","sha256:410ba4ae4c3a5f3df13cd0f8637b9a0c5e6d3759fc68a8bccc0889eda69a89f6"],"state_sha256":"25d14dcb76a838ac5a4b80ab722023279af39af86c47158f771f38e6e3c2aa22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3yeFxBKPxLqUkVh7HVEUVRPXV7zrmsnqwS/BPfaEZpBIA7F/YEZVx1AVus8/qXaBbgjEDudO61TuNVlqb6MDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:35:56.590597Z","bundle_sha256":"198bc609ecf02e3e4b772dde176062d87ac2d5065bea4bd04ef6742534847481"}}