{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ","short_pith_number":"pith:FL6BTRXD","canonical_record":{"source":{"id":"2606.00843","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T18:33:11Z","cross_cats_sorted":[],"title_canon_sha256":"567e7f6656b5371eb466beca7720278d2e2bc478b78b4234aff47e79c0f107b4","abstract_canon_sha256":"d3390e7ac4715e7b9f154d3531ec789f5bb28d145a33217f33383ecc231172f5"},"schema_version":"1.0"},"canonical_sha256":"2afc19c6e3de5e6f233a1e5d4e649dc41c1af6bcb7553d1dde10210fc571a50d","source":{"kind":"arxiv","id":"2606.00843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00843","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00843v1","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00843","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"FL6BTRXD3ZPG","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"FL6BTRXD3ZPG6IZ2","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"FL6BTRXD","created_at":"2026-06-02T01:04:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00843","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T18:33:11Z","cross_cats_sorted":[],"title_canon_sha256":"567e7f6656b5371eb466beca7720278d2e2bc478b78b4234aff47e79c0f107b4","abstract_canon_sha256":"d3390e7ac4715e7b9f154d3531ec789f5bb28d145a33217f33383ecc231172f5"},"schema_version":"1.0"},"canonical_sha256":"2afc19c6e3de5e6f233a1e5d4e649dc41c1af6bcb7553d1dde10210fc571a50d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:07.401922Z","signature_b64":"nQHKBfqqgcsxud4U9WGNp6sghNtmvvWLdfAyjtrJDpPisQuvWQA3dvLpPJaKh9/N8V5tQetaOG8Qo43u2PCVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2afc19c6e3de5e6f233a1e5d4e649dc41c1af6bcb7553d1dde10210fc571a50d","last_reissued_at":"2026-06-02T01:04:07.401569Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:07.401569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00843","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-06-02T01:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHptt3nQ5nt7aw8xgjriTZN+kR2sgW3LOT0PKRDkFdXiDdjz6V6omElGg/JPh1sflKPsfBI+SZ00MT+FEBPsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:16:44.169550Z"},"content_sha256":"01b798564358d35961ea1acf969b275cc6753988324b8e97a6176b88697e826e","schema_version":"1.0","event_id":"sha256:01b798564358d35961ea1acf969b275cc6753988324b8e97a6176b88697e826e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp upper bounds on the $A_\\alpha$-spectral radius of graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zheng-Jiang Xia, Zhen-Mu Hong, Zhi Qiao","submitted_at":"2026-05-30T18:33:11Z","abstract_excerpt":"Let $G$ be a simple graph with degree diagonal matrix $D(G)$ and adjacency matrix $A(G)$. The signless Laplacian matrix of $G$ is defined as $Q(G)=D(G)+A(G)$. For a real number $\\alpha \\in [0, 1]$, Nikiforov (2017) proposed the $A_\\alpha$-matrix of a graph $G$ as $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$. The $A_\\alpha$-spectral radius of $G$, denoted by $\\rho_\\alpha(G)$, is the largest eigenvalue of $A_\\alpha(G)$, where $\\rho_0(G)=\\rho(G)$ is the spectral radius of $A(G)$ and $2\\rho_{\\frac{1}{2}}(G)=q(G)$ is the spectral radius of $Q(G)$. Sun and Das (2020) proved that for any non-isolated v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00843","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.00843/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-06-02T01:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0C4gMDBNiA0HjyQt/hiLWYyNOxjy3f/Eu3bajJybnC/e/kHFQz62/IcMhAgPQCGvzaM9d+iYmMPvoz35ng8UDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T15:16:44.169899Z"},"content_sha256":"e980d85c415ce375e37c645899908b4b7da3a90daf8aa6f1d9d2248111fa62ed","schema_version":"1.0","event_id":"sha256:e980d85c415ce375e37c645899908b4b7da3a90daf8aa6f1d9d2248111fa62ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/bundle.json","state_url":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/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-30T15:16:44Z","links":{"resolver":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ","bundle":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/bundle.json","state":"https://pith.science/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FL6BTRXD3ZPG6IZ2DZOU4ZE5YQ","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":"d3390e7ac4715e7b9f154d3531ec789f5bb28d145a33217f33383ecc231172f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T18:33:11Z","title_canon_sha256":"567e7f6656b5371eb466beca7720278d2e2bc478b78b4234aff47e79c0f107b4"},"schema_version":"1.0","source":{"id":"2606.00843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00843","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00843v1","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00843","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"FL6BTRXD3ZPG","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"FL6BTRXD3ZPG6IZ2","created_at":"2026-06-02T01:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"FL6BTRXD","created_at":"2026-06-02T01:04:07Z"}],"graph_snapshots":[{"event_id":"sha256:e980d85c415ce375e37c645899908b4b7da3a90daf8aa6f1d9d2248111fa62ed","target":"graph","created_at":"2026-06-02T01:04:07Z","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/2606.00843/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a simple graph with degree diagonal matrix $D(G)$ and adjacency matrix $A(G)$. The signless Laplacian matrix of $G$ is defined as $Q(G)=D(G)+A(G)$. For a real number $\\alpha \\in [0, 1]$, Nikiforov (2017) proposed the $A_\\alpha$-matrix of a graph $G$ as $A_{\\alpha}(G)=\\alpha D(G)+(1-\\alpha)A(G)$. The $A_\\alpha$-spectral radius of $G$, denoted by $\\rho_\\alpha(G)$, is the largest eigenvalue of $A_\\alpha(G)$, where $\\rho_0(G)=\\rho(G)$ is the spectral radius of $A(G)$ and $2\\rho_{\\frac{1}{2}}(G)=q(G)$ is the spectral radius of $Q(G)$. Sun and Das (2020) proved that for any non-isolated v","authors_text":"Zheng-Jiang Xia, Zhen-Mu Hong, Zhi Qiao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T18:33:11Z","title":"Sharp upper bounds on the $A_\\alpha$-spectral radius of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00843","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:01b798564358d35961ea1acf969b275cc6753988324b8e97a6176b88697e826e","target":"record","created_at":"2026-06-02T01:04:07Z","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":"d3390e7ac4715e7b9f154d3531ec789f5bb28d145a33217f33383ecc231172f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T18:33:11Z","title_canon_sha256":"567e7f6656b5371eb466beca7720278d2e2bc478b78b4234aff47e79c0f107b4"},"schema_version":"1.0","source":{"id":"2606.00843","kind":"arxiv","version":1}},"canonical_sha256":"2afc19c6e3de5e6f233a1e5d4e649dc41c1af6bcb7553d1dde10210fc571a50d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2afc19c6e3de5e6f233a1e5d4e649dc41c1af6bcb7553d1dde10210fc571a50d","first_computed_at":"2026-06-02T01:04:07.401569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:04:07.401569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nQHKBfqqgcsxud4U9WGNp6sghNtmvvWLdfAyjtrJDpPisQuvWQA3dvLpPJaKh9/N8V5tQetaOG8Qo43u2PCVDA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:04:07.401922Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01b798564358d35961ea1acf969b275cc6753988324b8e97a6176b88697e826e","sha256:e980d85c415ce375e37c645899908b4b7da3a90daf8aa6f1d9d2248111fa62ed"],"state_sha256":"877f129b5ac182fac47fe4b5e2a6782596c6b3389044a8907f6881901b579145"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5RmRd4AOy3yP83DPuv7EOf7HrK0egqiv8CtSu4CbV85Qcpr8VXVUoJrXwlo8ZvekzeRJRoizSPR9TdfdSwQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T15:16:44.171826Z","bundle_sha256":"2b4329ddb166b97996c5d51eab2fdac8497c96190a18d7065079a0d4e55c6feb"}}