{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:STNDO2NU4LWFRS4O4H7UXIEDLX","short_pith_number":"pith:STNDO2NU","schema_version":"1.0","canonical_sha256":"94da3769b4e2ec58cb8ee1ff4ba0835dc70ffcb0ff77d698433c0f76328d486e","source":{"kind":"arxiv","id":"1603.07398","version":1},"attestation_state":"computed","paper":{"title":"Domination number in block designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lang Tang, Shenglin Zhou","submitted_at":"2016-03-24T00:28:51Z","abstract_excerpt":"Let $G=(V,E)$ be a simple connected graph. A set of vertices $S\\subseteq V$ is said to be a dominating set if for any vertex in $V\\setminus S$ is adjacent to at least one vertex in $S$. The domination number $\\gamma(G)$ of $G$ is the minimum cardinality among all such sets. In this paper, we obtain some results on the domination number of the incidence graphs of combinatorial designs. In particular, we prove a conjecture and disprove another conjecture in a recent paper by Goldberg, Rajendraprasad and Mathew. We also prove a third conjecture by the same authors for block-transitive symmetric d"},"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":"1603.07398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T00:28:51Z","cross_cats_sorted":[],"title_canon_sha256":"1bad13fea384d34f381da797c15fa9427ea035e9bbf416390b3a9322b16b2865","abstract_canon_sha256":"0d2d884c24896d72acae2216febbf3045d3988b49f10f975d33c8d46094063b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:21.078098Z","signature_b64":"4iXv9bdihged+oorpDvQZnY6TMwLWGyjOXCAvuzgBTKCbwF7iizrHPuLs7fpYavN9/g+ZeOQZpYEf3yfnUhPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94da3769b4e2ec58cb8ee1ff4ba0835dc70ffcb0ff77d698433c0f76328d486e","last_reissued_at":"2026-05-18T01:18:21.077591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:21.077591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination number in block designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lang Tang, Shenglin Zhou","submitted_at":"2016-03-24T00:28:51Z","abstract_excerpt":"Let $G=(V,E)$ be a simple connected graph. A set of vertices $S\\subseteq V$ is said to be a dominating set if for any vertex in $V\\setminus S$ is adjacent to at least one vertex in $S$. The domination number $\\gamma(G)$ of $G$ is the minimum cardinality among all such sets. In this paper, we obtain some results on the domination number of the incidence graphs of combinatorial designs. In particular, we prove a conjecture and disprove another conjecture in a recent paper by Goldberg, Rajendraprasad and Mathew. We also prove a third conjecture by the same authors for block-transitive symmetric d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07398","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":"1603.07398","created_at":"2026-05-18T01:18:21.077682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07398v1","created_at":"2026-05-18T01:18:21.077682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07398","created_at":"2026-05-18T01:18:21.077682+00:00"},{"alias_kind":"pith_short_12","alias_value":"STNDO2NU4LWF","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"STNDO2NU4LWFRS4O","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"STNDO2NU","created_at":"2026-05-18T12:30:44.179134+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/STNDO2NU4LWFRS4O4H7UXIEDLX","json":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX.json","graph_json":"https://pith.science/api/pith-number/STNDO2NU4LWFRS4O4H7UXIEDLX/graph.json","events_json":"https://pith.science/api/pith-number/STNDO2NU4LWFRS4O4H7UXIEDLX/events.json","paper":"https://pith.science/paper/STNDO2NU"},"agent_actions":{"view_html":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX","download_json":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX.json","view_paper":"https://pith.science/paper/STNDO2NU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07398&json=true","fetch_graph":"https://pith.science/api/pith-number/STNDO2NU4LWFRS4O4H7UXIEDLX/graph.json","fetch_events":"https://pith.science/api/pith-number/STNDO2NU4LWFRS4O4H7UXIEDLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/action/storage_attestation","attest_author":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/action/author_attestation","sign_citation":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/action/citation_signature","submit_replication":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/action/replication_record"}},"created_at":"2026-05-18T01:18:21.077682+00:00","updated_at":"2026-05-18T01:18:21.077682+00:00"}