{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DFPZYCMF4AN4NI3GIQLHDCE6RM","short_pith_number":"pith:DFPZYCMF","schema_version":"1.0","canonical_sha256":"195f9c0985e01bc6a366441671889e8b2db7943921d07ab8c3902a4e8ff49c3c","source":{"kind":"arxiv","id":"2207.00353","version":2},"attestation_state":"computed","paper":{"title":"On the Vertex-Degree-Function Indices of Connected (n,m)-Graphs of Maximum Degree at Most Four","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abeer M. Albalahi, Akbar Ali, Amjad E. Hamza, Igor Z. Milovanovic, Zahid Raza","submitted_at":"2022-07-01T11:42:41Z","abstract_excerpt":"Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$, where $d_v$ represents the degree of a vertex $v$ of $G$. This paper gives sharp bounds on the index $H_f(G)$ in terms of order and size of $G$ when $G$ is connected and has the maximum degree at most $4$. All the graphs achieving the derived bounds are also determined. Bounds involving several existing indices - including the general zeroth-order Randi\\'c ind"},"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":"2207.00353","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T11:42:41Z","cross_cats_sorted":[],"title_canon_sha256":"b75f160729cdf6299cc2519aec0e83d09a73f1782a477afb07d78351d8d1fd1c","abstract_canon_sha256":"6e7e94c831a357a89cc79346663682afe50f9d759e07847f27081417a1d5ec75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:03.237739Z","signature_b64":"yfIbNFqD1PM5tu1CoHzfNuOgXUhhZqM19NUpzyEjBuZtVTVabh/0zxjTXsacX8bUy3lYaiHC1SEM7PRGV3C+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"195f9c0985e01bc6a366441671889e8b2db7943921d07ab8c3902a4e8ff49c3c","last_reissued_at":"2026-07-05T05:59:03.237368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:03.237368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Vertex-Degree-Function Indices of Connected (n,m)-Graphs of Maximum Degree at Most Four","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abeer M. Albalahi, Akbar Ali, Amjad E. Hamza, Igor Z. Milovanovic, Zahid Raza","submitted_at":"2022-07-01T11:42:41Z","abstract_excerpt":"Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$, where $d_v$ represents the degree of a vertex $v$ of $G$. This paper gives sharp bounds on the index $H_f(G)$ in terms of order and size of $G$ when $G$ is connected and has the maximum degree at most $4$. All the graphs achieving the derived bounds are also determined. Bounds involving several existing indices - including the general zeroth-order Randi\\'c ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00353","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.00353/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.00353","created_at":"2026-07-05T05:59:03.237431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.00353v2","created_at":"2026-07-05T05:59:03.237431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00353","created_at":"2026-07-05T05:59:03.237431+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFPZYCMF4AN4","created_at":"2026-07-05T05:59:03.237431+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFPZYCMF4AN4NI3G","created_at":"2026-07-05T05:59:03.237431+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFPZYCMF","created_at":"2026-07-05T05:59:03.237431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.18845","citing_title":"Enhancing Federated Graph Learning via Adaptive Fusion of Structural and Node Characteristics","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM","json":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM.json","graph_json":"https://pith.science/api/pith-number/DFPZYCMF4AN4NI3GIQLHDCE6RM/graph.json","events_json":"https://pith.science/api/pith-number/DFPZYCMF4AN4NI3GIQLHDCE6RM/events.json","paper":"https://pith.science/paper/DFPZYCMF"},"agent_actions":{"view_html":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM","download_json":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM.json","view_paper":"https://pith.science/paper/DFPZYCMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.00353&json=true","fetch_graph":"https://pith.science/api/pith-number/DFPZYCMF4AN4NI3GIQLHDCE6RM/graph.json","fetch_events":"https://pith.science/api/pith-number/DFPZYCMF4AN4NI3GIQLHDCE6RM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/action/storage_attestation","attest_author":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/action/author_attestation","sign_citation":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/action/citation_signature","submit_replication":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/action/replication_record"}},"created_at":"2026-07-05T05:59:03.237431+00:00","updated_at":"2026-07-05T05:59:03.237431+00:00"}