{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E7ZJAN3TECGFX3WVIH5FDC6LEB","short_pith_number":"pith:E7ZJAN3T","schema_version":"1.0","canonical_sha256":"27f2903773208c5beed541fa518bcb20541546b47f6283036efbbab829a3be02","source":{"kind":"arxiv","id":"1704.06093","version":1},"attestation_state":"computed","paper":{"title":"Independent transversal domination number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Hongting Wang, Xinhui An","submitted_at":"2017-04-20T11:31:18Z","abstract_excerpt":"Let $G=(V, E)$ be a graph. A set $S\\subseteq V(G)$ is a {\\it dominating set} of $G$ if every vertex in $V\\setminus S$ is adjacent to a vertex of $S$. The {\\it domination number} of $G$, denoted by $\\gamma(G)$, is the cardinality of a minimum dominating set of $G$. Furthermore, a dominating set $S$ is an {\\it independent transversal dominating set} of $G$ if it intersects every maximum independent set of $G$. The {\\it independent transversal domination number} of $G$, denoted by $\\gamma_{it}(G)$, is the cardinality of a minimum independent transversal dominating set of $G$. In 2012, Hamid initi"},"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":"1704.06093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-20T11:31:18Z","cross_cats_sorted":[],"title_canon_sha256":"3275ac135e2d417ee79e368b3862dfdb2bc0d0bc5df160cf08b264d670bd0915","abstract_canon_sha256":"6351e1672626b698797f940c36e8dd3b7078a9d4278850f8a352dfac557790f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:03.328242Z","signature_b64":"fNtr6TF+bfj4u2KvcsnvXNIpgsmCuBtL3ZLFKPVRH2ay9Ch9NWcFfFVGKUAsYcHv7MGjKZskI1Vuw7iGLI3ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27f2903773208c5beed541fa518bcb20541546b47f6283036efbbab829a3be02","last_reissued_at":"2026-05-18T00:46:03.327701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:03.327701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent transversal domination number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Hongting Wang, Xinhui An","submitted_at":"2017-04-20T11:31:18Z","abstract_excerpt":"Let $G=(V, E)$ be a graph. A set $S\\subseteq V(G)$ is a {\\it dominating set} of $G$ if every vertex in $V\\setminus S$ is adjacent to a vertex of $S$. The {\\it domination number} of $G$, denoted by $\\gamma(G)$, is the cardinality of a minimum dominating set of $G$. Furthermore, a dominating set $S$ is an {\\it independent transversal dominating set} of $G$ if it intersects every maximum independent set of $G$. The {\\it independent transversal domination number} of $G$, denoted by $\\gamma_{it}(G)$, is the cardinality of a minimum independent transversal dominating set of $G$. In 2012, Hamid initi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06093","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":"1704.06093","created_at":"2026-05-18T00:46:03.327774+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06093v1","created_at":"2026-05-18T00:46:03.327774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06093","created_at":"2026-05-18T00:46:03.327774+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7ZJAN3TECGF","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7ZJAN3TECGFX3WV","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7ZJAN3T","created_at":"2026-05-18T12:31:12.930513+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/E7ZJAN3TECGFX3WVIH5FDC6LEB","json":"https://pith.science/pith/E7ZJAN3TECGFX3WVIH5FDC6LEB.json","graph_json":"https://pith.science/api/pith-number/E7ZJAN3TECGFX3WVIH5FDC6LEB/graph.json","events_json":"https://pith.science/api/pith-number/E7ZJAN3TECGFX3WVIH5FDC6LEB/events.json","paper":"https://pith.science/paper/E7ZJAN3T"},"agent_actions":{"view_html":"https://pith.science/pith/E7ZJAN3TECGFX3WVIH5FDC6LEB","download_json":"https://pith.science/pith/E7ZJAN3TECGFX3WVIH5FDC6LEB.json","view_paper":"https://pith.science/paper/E7ZJAN3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06093&json=true","fetch_graph":"https://pith.science/api/pith-number/E7ZJAN3TECGFX3WVIH5FDC6LEB/graph.json","fetch_events":"https://pith.science/api/pith-number/E7ZJAN3TECGFX3WVIH5FDC6LEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7ZJAN3TECGFX3WVIH5FDC6LEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7ZJAN3TECGFX3WVIH5FDC6LEB/action/storage_attestation","attest_author":"https://pith.science/pith/E7ZJAN3TECGFX3WVIH5FDC6LEB/action/author_attestation","sign_citation":"https://pith.science/pith/E7ZJAN3TECGFX3WVIH5FDC6LEB/action/citation_signature","submit_replication":"https://pith.science/pith/E7ZJAN3TECGFX3WVIH5FDC6LEB/action/replication_record"}},"created_at":"2026-05-18T00:46:03.327774+00:00","updated_at":"2026-05-18T00:46:03.327774+00:00"}