{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LHADXKWP6X3JBN466CCU27SVPA","short_pith_number":"pith:LHADXKWP","schema_version":"1.0","canonical_sha256":"59c03baacff5f690b79ef0854d7e55783d8c3b5a49a120cd09ba919cc3f33d05","source":{"kind":"arxiv","id":"1804.02550","version":1},"attestation_state":"computed","paper":{"title":"Domination in 4-regular Kn\\\"odel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doost Ali Mojdeh, Esmaeil Nazari, Seyed Reza Musawi","submitted_at":"2018-04-07T12:22:07Z","abstract_excerpt":"A subset $D$ of vertices of a graph $G$ is a dominating set if for each $u\\in V(G)\\setminus D$, $u$ is adjacent to some vertex $v\\in D$. The domination number, $\\gamma(G)$ of $G$, is the minimum cardinality of a dominating set of $G$. For an even integer $n\\ge2$ and $1\\le\\Delta\\le\\lfloor\\log_2n\\rfloor$, a Kn\\\"odel graph $W_{\\Delta,n}$ is a $Delta$-regular bipartite graph of even order $n$, with vertices$(i,j)$, for $i=1,2$ and $0\\le j\\le n/2-1$, where for every $j$, $0\\le j\\le n/2-1$, there is an edge between $(1,j)$ and $(2,j+2^k-1 \\text{(mod(n/2)})$, for $k=0,1,\\cdots,\\Delta-1$. In this pape"},"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":"1804.02550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-07T12:22:07Z","cross_cats_sorted":[],"title_canon_sha256":"765bd7d824e7386fcd8db22a3cff920b48273b20aae8c1ed866db2a0775da000","abstract_canon_sha256":"f2159d3e667f4f4a23daa2b113a63dc1d0326fc54baa9b710137f0f8677d1fad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:59.149766Z","signature_b64":"2HRW71ZO29sixs9VMW/llJQD9IXdAZL+pA7Ry8FiaNxGDRaGcCYWnJjiDv0wDu1vsFswGz1AroNHuC+FMrcUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59c03baacff5f690b79ef0854d7e55783d8c3b5a49a120cd09ba919cc3f33d05","last_reissued_at":"2026-05-18T00:18:59.149286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:59.149286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination in 4-regular Kn\\\"odel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doost Ali Mojdeh, Esmaeil Nazari, Seyed Reza Musawi","submitted_at":"2018-04-07T12:22:07Z","abstract_excerpt":"A subset $D$ of vertices of a graph $G$ is a dominating set if for each $u\\in V(G)\\setminus D$, $u$ is adjacent to some vertex $v\\in D$. The domination number, $\\gamma(G)$ of $G$, is the minimum cardinality of a dominating set of $G$. For an even integer $n\\ge2$ and $1\\le\\Delta\\le\\lfloor\\log_2n\\rfloor$, a Kn\\\"odel graph $W_{\\Delta,n}$ is a $Delta$-regular bipartite graph of even order $n$, with vertices$(i,j)$, for $i=1,2$ and $0\\le j\\le n/2-1$, where for every $j$, $0\\le j\\le n/2-1$, there is an edge between $(1,j)$ and $(2,j+2^k-1 \\text{(mod(n/2)})$, for $k=0,1,\\cdots,\\Delta-1$. In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02550","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":"1804.02550","created_at":"2026-05-18T00:18:59.149377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02550v1","created_at":"2026-05-18T00:18:59.149377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02550","created_at":"2026-05-18T00:18:59.149377+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHADXKWP6X3J","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHADXKWP6X3JBN46","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHADXKWP","created_at":"2026-05-18T12:32:37.024351+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/LHADXKWP6X3JBN466CCU27SVPA","json":"https://pith.science/pith/LHADXKWP6X3JBN466CCU27SVPA.json","graph_json":"https://pith.science/api/pith-number/LHADXKWP6X3JBN466CCU27SVPA/graph.json","events_json":"https://pith.science/api/pith-number/LHADXKWP6X3JBN466CCU27SVPA/events.json","paper":"https://pith.science/paper/LHADXKWP"},"agent_actions":{"view_html":"https://pith.science/pith/LHADXKWP6X3JBN466CCU27SVPA","download_json":"https://pith.science/pith/LHADXKWP6X3JBN466CCU27SVPA.json","view_paper":"https://pith.science/paper/LHADXKWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02550&json=true","fetch_graph":"https://pith.science/api/pith-number/LHADXKWP6X3JBN466CCU27SVPA/graph.json","fetch_events":"https://pith.science/api/pith-number/LHADXKWP6X3JBN466CCU27SVPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHADXKWP6X3JBN466CCU27SVPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHADXKWP6X3JBN466CCU27SVPA/action/storage_attestation","attest_author":"https://pith.science/pith/LHADXKWP6X3JBN466CCU27SVPA/action/author_attestation","sign_citation":"https://pith.science/pith/LHADXKWP6X3JBN466CCU27SVPA/action/citation_signature","submit_replication":"https://pith.science/pith/LHADXKWP6X3JBN466CCU27SVPA/action/replication_record"}},"created_at":"2026-05-18T00:18:59.149377+00:00","updated_at":"2026-05-18T00:18:59.149377+00:00"}