{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7B2RYG6SA5NWSPEPJ5SKSYCT7A","short_pith_number":"pith:7B2RYG6S","schema_version":"1.0","canonical_sha256":"f8751c1bd2075b693c8f4f64a96053f809118d582db0103719c24390ddcd77e0","source":{"kind":"arxiv","id":"1707.02039","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.02039","created_at":"2026-05-18T00:40:45.400501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02039v1","created_at":"2026-05-18T00:40:45.400501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02039","created_at":"2026-05-18T00:40:45.400501+00:00"},{"alias_kind":"pith_short_12","alias_value":"7B2RYG6SA5NW","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7B2RYG6SA5NWSPEP","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7B2RYG6S","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A","json":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A.json","graph_json":"https://pith.science/api/pith-number/7B2RYG6SA5NWSPEPJ5SKSYCT7A/graph.json","events_json":"https://pith.science/api/pith-number/7B2RYG6SA5NWSPEPJ5SKSYCT7A/events.json","paper":"https://pith.science/paper/7B2RYG6S"},"agent_actions":{"view_html":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A","download_json":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A.json","view_paper":"https://pith.science/paper/7B2RYG6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02039&json=true","fetch_graph":"https://pith.science/api/pith-number/7B2RYG6SA5NWSPEPJ5SKSYCT7A/graph.json","fetch_events":"https://pith.science/api/pith-number/7B2RYG6SA5NWSPEPJ5SKSYCT7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/action/storage_attestation","attest_author":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/action/author_attestation","sign_citation":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/action/citation_signature","submit_replication":"https://pith.science/pith/7B2RYG6SA5NWSPEPJ5SKSYCT7A/action/replication_record"}},"created_at":"2026-05-18T00:40:45.400501+00:00","updated_at":"2026-05-18T00:40:45.400501+00:00"}