{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NNBJXIOQKOU5Z4JT422C56Q4C3","short_pith_number":"pith:NNBJXIOQ","canonical_record":{"source":{"id":"1809.01901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T09:31:52Z","cross_cats_sorted":[],"title_canon_sha256":"a94c0d9f66a15a8960ecf8875ff80795ed67f3b1affec916f53a1504dc49f6ef","abstract_canon_sha256":"5443fead6a3c930d98bf3a7eb2df98234b5b0fdeb434cc423e18b0e042a185c1"},"schema_version":"1.0"},"canonical_sha256":"6b429ba1d053a9dcf133e6b42efa1c16fc370e9d276d892cc90761c29c5279b0","source":{"kind":"arxiv","id":"1809.01901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01901","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01901v1","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01901","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"NNBJXIOQKOU5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NNBJXIOQKOU5Z4JT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NNBJXIOQ","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NNBJXIOQKOU5Z4JT422C56Q4C3","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T09:31:52Z","cross_cats_sorted":[],"title_canon_sha256":"a94c0d9f66a15a8960ecf8875ff80795ed67f3b1affec916f53a1504dc49f6ef","abstract_canon_sha256":"5443fead6a3c930d98bf3a7eb2df98234b5b0fdeb434cc423e18b0e042a185c1"},"schema_version":"1.0"},"canonical_sha256":"6b429ba1d053a9dcf133e6b42efa1c16fc370e9d276d892cc90761c29c5279b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.710189Z","signature_b64":"hDqgFIJfQrGLc42pZO/JTLdhMRlodkBPlThtjEPbRaxvziuxXWfjTxCTctL0uEcRDHynzqgblwUFJ5n14cJbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b429ba1d053a9dcf133e6b42efa1c16fc370e9d276d892cc90761c29c5279b0","last_reissued_at":"2026-05-18T00:06:21.709818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.709818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01901","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-18T00:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgLYEhX+mSobTYVR0zxIu5vnHU/eoh6WOf8cnC7N3y8r1G6DygWC3klO+JtlNfXOHOJbV80wDn076KipXphDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:57:14.410979Z"},"content_sha256":"8affe71d8892955afa4be8cd6e02b47dd8adb063b11accda21f9ad6b2aca7e34","schema_version":"1.0","event_id":"sha256:8affe71d8892955afa4be8cd6e02b47dd8adb063b11accda21f9ad6b2aca7e34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NNBJXIOQKOU5Z4JT422C56Q4C3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal graphs for vertex-degree-based invariants with given degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kexiang Xu, Muhuo Liu, Xiao-Dong Zhang","submitted_at":"2018-09-06T09:31:52Z","abstract_excerpt":"For a symmetric bivariable function $f(x,y)$, let the {\\it connectivity function} of a connected graph $G$ be $M_f(G)=\\sum_{uv\\in E(G)}f(d(u),d(v))$, where $d(u)$ is the degree of vertex $u$. In this paper, we prove that for an escalating (de-escalating) function $f(x,y)$, there exists a BFS-graph with the maximum (minimum) connectivity function $M_f(G)$ among all graphs with a $c-$cyclic degree sequence $\\pi=(d_1,d_2, \\ldots, d_n)$ and $d_n=1$, and obtain the majorization theorem for connectivity function for unicyclic and bicyclic degree sequences. Moreover, some applications of graph invari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01901","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-18T00:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TaExUf0XVfcQ6w1/mRaeik7SBDPKqeDHgJKP1A1Ny+VDuwf++q7iwO/sGEhbjolE7vWLHVjDd1S1QZcJSX2OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:57:14.411703Z"},"content_sha256":"f74db27cbdfde89b27b905d425dbcbe25644c62f9a778ec01743a66e2f1d8be6","schema_version":"1.0","event_id":"sha256:f74db27cbdfde89b27b905d425dbcbe25644c62f9a778ec01743a66e2f1d8be6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNBJXIOQKOU5Z4JT422C56Q4C3/bundle.json","state_url":"https://pith.science/pith/NNBJXIOQKOU5Z4JT422C56Q4C3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNBJXIOQKOU5Z4JT422C56Q4C3/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-06-09T08:57:14Z","links":{"resolver":"https://pith.science/pith/NNBJXIOQKOU5Z4JT422C56Q4C3","bundle":"https://pith.science/pith/NNBJXIOQKOU5Z4JT422C56Q4C3/bundle.json","state":"https://pith.science/pith/NNBJXIOQKOU5Z4JT422C56Q4C3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNBJXIOQKOU5Z4JT422C56Q4C3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NNBJXIOQKOU5Z4JT422C56Q4C3","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":"5443fead6a3c930d98bf3a7eb2df98234b5b0fdeb434cc423e18b0e042a185c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T09:31:52Z","title_canon_sha256":"a94c0d9f66a15a8960ecf8875ff80795ed67f3b1affec916f53a1504dc49f6ef"},"schema_version":"1.0","source":{"id":"1809.01901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01901","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01901v1","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01901","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"NNBJXIOQKOU5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NNBJXIOQKOU5Z4JT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NNBJXIOQ","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:f74db27cbdfde89b27b905d425dbcbe25644c62f9a778ec01743a66e2f1d8be6","target":"graph","created_at":"2026-05-18T00:06: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":"For a symmetric bivariable function $f(x,y)$, let the {\\it connectivity function} of a connected graph $G$ be $M_f(G)=\\sum_{uv\\in E(G)}f(d(u),d(v))$, where $d(u)$ is the degree of vertex $u$. In this paper, we prove that for an escalating (de-escalating) function $f(x,y)$, there exists a BFS-graph with the maximum (minimum) connectivity function $M_f(G)$ among all graphs with a $c-$cyclic degree sequence $\\pi=(d_1,d_2, \\ldots, d_n)$ and $d_n=1$, and obtain the majorization theorem for connectivity function for unicyclic and bicyclic degree sequences. Moreover, some applications of graph invari","authors_text":"Kexiang Xu, Muhuo Liu, Xiao-Dong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T09:31:52Z","title":"Extremal graphs for vertex-degree-based invariants with given degree sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01901","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:8affe71d8892955afa4be8cd6e02b47dd8adb063b11accda21f9ad6b2aca7e34","target":"record","created_at":"2026-05-18T00:06: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":"5443fead6a3c930d98bf3a7eb2df98234b5b0fdeb434cc423e18b0e042a185c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T09:31:52Z","title_canon_sha256":"a94c0d9f66a15a8960ecf8875ff80795ed67f3b1affec916f53a1504dc49f6ef"},"schema_version":"1.0","source":{"id":"1809.01901","kind":"arxiv","version":1}},"canonical_sha256":"6b429ba1d053a9dcf133e6b42efa1c16fc370e9d276d892cc90761c29c5279b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b429ba1d053a9dcf133e6b42efa1c16fc370e9d276d892cc90761c29c5279b0","first_computed_at":"2026-05-18T00:06:21.709818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:21.709818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hDqgFIJfQrGLc42pZO/JTLdhMRlodkBPlThtjEPbRaxvziuxXWfjTxCTctL0uEcRDHynzqgblwUFJ5n14cJbBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:21.710189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8affe71d8892955afa4be8cd6e02b47dd8adb063b11accda21f9ad6b2aca7e34","sha256:f74db27cbdfde89b27b905d425dbcbe25644c62f9a778ec01743a66e2f1d8be6"],"state_sha256":"ab26a4490fd3ddaaed8fe53290ebddc02b3f3bcc132aabb16df1d6f2de021fc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHIZZ0zMauTbdCqSZ9bLP3L1eBuulJR6Yd/iQL41umc1etKk/8S0neCoPj/BPmlvMu0Lhc6lyTi1ZbU4hUQ7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:57:14.415848Z","bundle_sha256":"ad2a5a637934548c254a8012011b71b3624d5bd2aa6705fa8466a21f6f67ee52"}}