{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:STNDO2NU4LWFRS4O4H7UXIEDLX","short_pith_number":"pith:STNDO2NU","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"},"canonical_sha256":"94da3769b4e2ec58cb8ee1ff4ba0835dc70ffcb0ff77d698433c0f76328d486e","source":{"kind":"arxiv","id":"1603.07398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07398","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07398v1","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07398","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"STNDO2NU4LWF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"STNDO2NU4LWFRS4O","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"STNDO2NU","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:STNDO2NU4LWFRS4O4H7UXIEDLX","target":"record","payload":{"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"},"canonical_sha256":"94da3769b4e2ec58cb8ee1ff4ba0835dc70ffcb0ff77d698433c0f76328d486e","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"},"source_kind":"arxiv","source_id":"1603.07398","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:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXWoWybQ24sHtGnVP4LUsgAfr6YUL4+5N9+3OrFkcUgvrUUf60EItgojC0RuEQI4ZZl7XKvoKflttGmAZc3FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:20:34.781413Z"},"content_sha256":"af13765960e9332c9e2b628961bfa2e953cc7847ab6c3a349d91f0747b9ccdf2","schema_version":"1.0","event_id":"sha256:af13765960e9332c9e2b628961bfa2e953cc7847ab6c3a349d91f0747b9ccdf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:STNDO2NU4LWFRS4O4H7UXIEDLX","target":"graph","payload":{"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"},"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:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ep8FBtvAzhbBYgNaBtjjfqVfY2WJ3PbTNUUTOVroYaIJgCOMtSqkOu+sU4b39RmqvFdmK9Q1wbFPBytnHazIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:20:34.782057Z"},"content_sha256":"c3617cdd7409df5ac2272f5a1f1cab195df1525ac82f3d7c85a843a4a382d7b0","schema_version":"1.0","event_id":"sha256:c3617cdd7409df5ac2272f5a1f1cab195df1525ac82f3d7c85a843a4a382d7b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/bundle.json","state_url":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/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-05-31T11:20:34Z","links":{"resolver":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX","bundle":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/bundle.json","state":"https://pith.science/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STNDO2NU4LWFRS4O4H7UXIEDLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:STNDO2NU4LWFRS4O4H7UXIEDLX","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":"0d2d884c24896d72acae2216febbf3045d3988b49f10f975d33c8d46094063b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T00:28:51Z","title_canon_sha256":"1bad13fea384d34f381da797c15fa9427ea035e9bbf416390b3a9322b16b2865"},"schema_version":"1.0","source":{"id":"1603.07398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07398","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07398v1","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07398","created_at":"2026-05-18T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"STNDO2NU4LWF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"STNDO2NU4LWFRS4O","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"STNDO2NU","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:c3617cdd7409df5ac2272f5a1f1cab195df1525ac82f3d7c85a843a4a382d7b0","target":"graph","created_at":"2026-05-18T01:18:21Z","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":"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","authors_text":"Lang Tang, Shenglin Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T00:28:51Z","title":"Domination number in block designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07398","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:af13765960e9332c9e2b628961bfa2e953cc7847ab6c3a349d91f0747b9ccdf2","target":"record","created_at":"2026-05-18T01:18:21Z","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":"0d2d884c24896d72acae2216febbf3045d3988b49f10f975d33c8d46094063b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T00:28:51Z","title_canon_sha256":"1bad13fea384d34f381da797c15fa9427ea035e9bbf416390b3a9322b16b2865"},"schema_version":"1.0","source":{"id":"1603.07398","kind":"arxiv","version":1}},"canonical_sha256":"94da3769b4e2ec58cb8ee1ff4ba0835dc70ffcb0ff77d698433c0f76328d486e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94da3769b4e2ec58cb8ee1ff4ba0835dc70ffcb0ff77d698433c0f76328d486e","first_computed_at":"2026-05-18T01:18:21.077591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:21.077591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4iXv9bdihged+oorpDvQZnY6TMwLWGyjOXCAvuzgBTKCbwF7iizrHPuLs7fpYavN9/g+ZeOQZpYEf3yfnUhPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:21.078098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af13765960e9332c9e2b628961bfa2e953cc7847ab6c3a349d91f0747b9ccdf2","sha256:c3617cdd7409df5ac2272f5a1f1cab195df1525ac82f3d7c85a843a4a382d7b0"],"state_sha256":"2bbdb3f93688281d09ca6353d68b882ff55d5363f3bed240e5a879f0130b8a84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igDXjRu8xXuJtkj24oEI0wNLu6mzSGJ3sGttR+2YnUezUlxXiwgsUB/4DC0sBwMJONDQydZbH+yjvGkh6DB8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:20:34.785340Z","bundle_sha256":"2ff5c51b6f3691459c1d82fafacad7673eb6a3fa94cec6e96cbb6119f13f84d1"}}