{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:F6TZO6RLBDCUTHTGME3YMRDXDP","short_pith_number":"pith:F6TZO6RL","schema_version":"1.0","canonical_sha256":"2fa7977a2b08c5499e6661378644771bc2ae72647b8ddbefa7020e3e03a13522","source":{"kind":"arxiv","id":"1906.12202","version":1},"attestation_state":"computed","paper":{"title":"On extremal results of multiplicative Zagreb indices of trees with given distance $k$-domination number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fazal Hayat","submitted_at":"2019-06-28T13:20:35Z","abstract_excerpt":"The first multiplicative Zagreb index $\\Pi_1$ of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index $\\Pi_2$ is the product of the products of degrees of pairs of adjacent vertices. In this paper, we give sharp lower bound for $\\Pi_1$ and upper bound for $\\Pi_2$ of trees with given distance $k$-domination number, and characterize those trees attaining the bounds."},"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":"1906.12202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-28T13:20:35Z","cross_cats_sorted":[],"title_canon_sha256":"0fcef11696a9ab8e94ba8b2f9825588437a6ea94d31cdf37f2fb711be159f9e3","abstract_canon_sha256":"a01c2d5f8bf9cd0937fabf019d80aacbad1663c4f77a5eecbd2309dad7f27a95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:59.014018Z","signature_b64":"BzUGlwzYZ9sbhMesJRULlWU09C246w7sbDN5OgWH30ta3WSAVvqaFPQFH4oiCKJ+Zebm07cF3YDLRvzGp0lwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fa7977a2b08c5499e6661378644771bc2ae72647b8ddbefa7020e3e03a13522","last_reissued_at":"2026-05-17T23:41:59.013440Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:59.013440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On extremal results of multiplicative Zagreb indices of trees with given distance $k$-domination number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fazal Hayat","submitted_at":"2019-06-28T13:20:35Z","abstract_excerpt":"The first multiplicative Zagreb index $\\Pi_1$ of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index $\\Pi_2$ is the product of the products of degrees of pairs of adjacent vertices. In this paper, we give sharp lower bound for $\\Pi_1$ and upper bound for $\\Pi_2$ of trees with given distance $k$-domination number, and characterize those trees attaining the bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12202","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":"1906.12202","created_at":"2026-05-17T23:41:59.013522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.12202v1","created_at":"2026-05-17T23:41:59.013522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12202","created_at":"2026-05-17T23:41:59.013522+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6TZO6RLBDCU","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6TZO6RLBDCUTHTG","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6TZO6RL","created_at":"2026-05-18T12:33:15.570797+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/F6TZO6RLBDCUTHTGME3YMRDXDP","json":"https://pith.science/pith/F6TZO6RLBDCUTHTGME3YMRDXDP.json","graph_json":"https://pith.science/api/pith-number/F6TZO6RLBDCUTHTGME3YMRDXDP/graph.json","events_json":"https://pith.science/api/pith-number/F6TZO6RLBDCUTHTGME3YMRDXDP/events.json","paper":"https://pith.science/paper/F6TZO6RL"},"agent_actions":{"view_html":"https://pith.science/pith/F6TZO6RLBDCUTHTGME3YMRDXDP","download_json":"https://pith.science/pith/F6TZO6RLBDCUTHTGME3YMRDXDP.json","view_paper":"https://pith.science/paper/F6TZO6RL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.12202&json=true","fetch_graph":"https://pith.science/api/pith-number/F6TZO6RLBDCUTHTGME3YMRDXDP/graph.json","fetch_events":"https://pith.science/api/pith-number/F6TZO6RLBDCUTHTGME3YMRDXDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6TZO6RLBDCUTHTGME3YMRDXDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6TZO6RLBDCUTHTGME3YMRDXDP/action/storage_attestation","attest_author":"https://pith.science/pith/F6TZO6RLBDCUTHTGME3YMRDXDP/action/author_attestation","sign_citation":"https://pith.science/pith/F6TZO6RLBDCUTHTGME3YMRDXDP/action/citation_signature","submit_replication":"https://pith.science/pith/F6TZO6RLBDCUTHTGME3YMRDXDP/action/replication_record"}},"created_at":"2026-05-17T23:41:59.013522+00:00","updated_at":"2026-05-17T23:41:59.013522+00:00"}