{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DFPZYCMF4AN4NI3GIQLHDCE6RM","short_pith_number":"pith:DFPZYCMF","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"},"canonical_sha256":"195f9c0985e01bc6a366441671889e8b2db7943921d07ab8c3902a4e8ff49c3c","source":{"kind":"arxiv","id":"2207.00353","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.00353","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"2207.00353v2","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00353","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"DFPZYCMF4AN4","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"pith_short_16","alias_value":"DFPZYCMF4AN4NI3G","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"pith_short_8","alias_value":"DFPZYCMF","created_at":"2026-07-05T05:59:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DFPZYCMF4AN4NI3GIQLHDCE6RM","target":"record","payload":{"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"},"canonical_sha256":"195f9c0985e01bc6a366441671889e8b2db7943921d07ab8c3902a4e8ff49c3c","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"},"source_kind":"arxiv","source_id":"2207.00353","source_version":2,"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-07-05T05:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6Blao/3tiZQ98EpjeEQyYjuWAgDXd4KCC+17O36jFa9n2cel1ko8GplELsbclEXeo/vbeh4kl6AnQGKt6XTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T12:21:03.436889Z"},"content_sha256":"65094bc3f6f4353270422752baa241cef49eb13e6545aca00d19ece23a2644b6","schema_version":"1.0","event_id":"sha256:65094bc3f6f4353270422752baa241cef49eb13e6545aca00d19ece23a2644b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DFPZYCMF4AN4NI3GIQLHDCE6RM","target":"graph","payload":{"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"},"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-07-05T05:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3ToDcegxqncSXIoSkHIHJN+UneTaw3+RG3wBVKla7rl65e4qasZbtKA+cnuyWGhuQPVlBOK4LWREC29CSWYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T12:21:03.437815Z"},"content_sha256":"233ea099c544c6dbbdaed173e07c097c0403a7a07b539d9e9295b7c8c5796bd4","schema_version":"1.0","event_id":"sha256:233ea099c544c6dbbdaed173e07c097c0403a7a07b539d9e9295b7c8c5796bd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/bundle.json","state_url":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/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-08-15T12:21:03Z","links":{"resolver":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM","bundle":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/bundle.json","state":"https://pith.science/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DFPZYCMF4AN4NI3GIQLHDCE6RM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DFPZYCMF4AN4NI3GIQLHDCE6RM","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":"6e7e94c831a357a89cc79346663682afe50f9d759e07847f27081417a1d5ec75","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T11:42:41Z","title_canon_sha256":"b75f160729cdf6299cc2519aec0e83d09a73f1782a477afb07d78351d8d1fd1c"},"schema_version":"1.0","source":{"id":"2207.00353","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.00353","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"2207.00353v2","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00353","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"DFPZYCMF4AN4","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"pith_short_16","alias_value":"DFPZYCMF4AN4NI3G","created_at":"2026-07-05T05:59:03Z"},{"alias_kind":"pith_short_8","alias_value":"DFPZYCMF","created_at":"2026-07-05T05:59:03Z"}],"graph_snapshots":[{"event_id":"sha256:233ea099c544c6dbbdaed173e07c097c0403a7a07b539d9e9295b7c8c5796bd4","target":"graph","created_at":"2026-07-05T05:59:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.00353/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Abeer M. Albalahi, Akbar Ali, Amjad E. Hamza, Igor Z. Milovanovic, Zahid Raza","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T11:42:41Z","title":"On the Vertex-Degree-Function Indices of Connected (n,m)-Graphs of Maximum Degree at Most Four"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00353","kind":"arxiv","version":2},"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:65094bc3f6f4353270422752baa241cef49eb13e6545aca00d19ece23a2644b6","target":"record","created_at":"2026-07-05T05:59:03Z","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":"6e7e94c831a357a89cc79346663682afe50f9d759e07847f27081417a1d5ec75","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-01T11:42:41Z","title_canon_sha256":"b75f160729cdf6299cc2519aec0e83d09a73f1782a477afb07d78351d8d1fd1c"},"schema_version":"1.0","source":{"id":"2207.00353","kind":"arxiv","version":2}},"canonical_sha256":"195f9c0985e01bc6a366441671889e8b2db7943921d07ab8c3902a4e8ff49c3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"195f9c0985e01bc6a366441671889e8b2db7943921d07ab8c3902a4e8ff49c3c","first_computed_at":"2026-07-05T05:59:03.237368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:59:03.237368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yfIbNFqD1PM5tu1CoHzfNuOgXUhhZqM19NUpzyEjBuZtVTVabh/0zxjTXsacX8bUy3lYaiHC1SEM7PRGV3C+Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:59:03.237739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.00353","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65094bc3f6f4353270422752baa241cef49eb13e6545aca00d19ece23a2644b6","sha256:233ea099c544c6dbbdaed173e07c097c0403a7a07b539d9e9295b7c8c5796bd4"],"state_sha256":"a09b052db17fffcdae27df78cee43d6a939d145661344aeaf4707d0a04e2698c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KPMRYgGGbRhZ112z35ctD8j5omapZt7HNioBL0W8j89GcC/65S2cXFrhdm9GkOr/Felpnq09hmL0X8f9yKMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T12:21:03.445224Z","bundle_sha256":"f22045fd2e86ac6bd087662d8e453ffc825ec3e7c57c71bea9d4f29fd4cc6cb8"}}