{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5H4FBHWHX46VMSU6CEECIBUIR4","short_pith_number":"pith:5H4FBHWH","schema_version":"1.0","canonical_sha256":"e9f8509ec7bf3d564a9e11082406888f292a7bfb63d0643e2998fcbcae534f85","source":{"kind":"arxiv","id":"2303.14929","version":2},"attestation_state":"computed","paper":{"title":"On ABC spectral radius of uniform hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Hongying Lin","submitted_at":"2023-03-27T06:09:46Z","abstract_excerpt":"Given a $k$-uniform hypergraph $G$ with vertex set $[n]$ and edge set $E(G)$, the ABC tensor $\\mathcal{ABC}(G)$ of $G$ is the $k$-order $n$-dimensional tensor with \\[\n  \\mathcal{ABC}(G)_{i_1, \\dots, i_k}=\n  \\begin{cases}\n  \\dfrac{1}{(k-1)!}\\sqrt[k]{\\dfrac{\\sum_{i\\in e}d_{i}-k}{\\prod_{i\\in e}d_{i}}} & \\mbox{if $e\\in E(G)$}\n  0 & \\mbox{otherwise} \\end{cases} \\] for $i_j\\in [n]$ with $j\\in [k]$, where $d_i$ is the degree of vertex $i$ in $G$. The ABC spectral radius of a uniform hypergraph is the spectral radius of its ABC tensor. We give tight lower and upper bounds for the ABC spectra radius, a"},"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":"2303.14929","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-27T06:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"3ceb93de47e709ddb98a258df55fac97e5c690dd3004b390869a10c46444a9b4","abstract_canon_sha256":"726142c43d4dae874caa2816c52223b467ac826e74c01b8069f58f45449c5bb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:55:23.187002Z","signature_b64":"yY7JPszlt4WabGi7b5To9/T3iYrrxTe6m9lVjpQlQafhf5MTANSHyR3BM8/uaJ0ZJUAbHIPPZZ8Q7LZ4HGAWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9f8509ec7bf3d564a9e11082406888f292a7bfb63d0643e2998fcbcae534f85","last_reissued_at":"2026-07-05T05:55:23.186574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:55:23.186574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On ABC spectral radius of uniform hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Hongying Lin","submitted_at":"2023-03-27T06:09:46Z","abstract_excerpt":"Given a $k$-uniform hypergraph $G$ with vertex set $[n]$ and edge set $E(G)$, the ABC tensor $\\mathcal{ABC}(G)$ of $G$ is the $k$-order $n$-dimensional tensor with \\[\n  \\mathcal{ABC}(G)_{i_1, \\dots, i_k}=\n  \\begin{cases}\n  \\dfrac{1}{(k-1)!}\\sqrt[k]{\\dfrac{\\sum_{i\\in e}d_{i}-k}{\\prod_{i\\in e}d_{i}}} & \\mbox{if $e\\in E(G)$}\n  0 & \\mbox{otherwise} \\end{cases} \\] for $i_j\\in [n]$ with $j\\in [k]$, where $d_i$ is the degree of vertex $i$ in $G$. The ABC spectral radius of a uniform hypergraph is the spectral radius of its ABC tensor. We give tight lower and upper bounds for the ABC spectra radius, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14929","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/2303.14929/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":"2303.14929","created_at":"2026-07-05T05:55:23.186633+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.14929v2","created_at":"2026-07-05T05:55:23.186633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14929","created_at":"2026-07-05T05:55:23.186633+00:00"},{"alias_kind":"pith_short_12","alias_value":"5H4FBHWHX46V","created_at":"2026-07-05T05:55:23.186633+00:00"},{"alias_kind":"pith_short_16","alias_value":"5H4FBHWHX46VMSU6","created_at":"2026-07-05T05:55:23.186633+00:00"},{"alias_kind":"pith_short_8","alias_value":"5H4FBHWH","created_at":"2026-07-05T05:55:23.186633+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/5H4FBHWHX46VMSU6CEECIBUIR4","json":"https://pith.science/pith/5H4FBHWHX46VMSU6CEECIBUIR4.json","graph_json":"https://pith.science/api/pith-number/5H4FBHWHX46VMSU6CEECIBUIR4/graph.json","events_json":"https://pith.science/api/pith-number/5H4FBHWHX46VMSU6CEECIBUIR4/events.json","paper":"https://pith.science/paper/5H4FBHWH"},"agent_actions":{"view_html":"https://pith.science/pith/5H4FBHWHX46VMSU6CEECIBUIR4","download_json":"https://pith.science/pith/5H4FBHWHX46VMSU6CEECIBUIR4.json","view_paper":"https://pith.science/paper/5H4FBHWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.14929&json=true","fetch_graph":"https://pith.science/api/pith-number/5H4FBHWHX46VMSU6CEECIBUIR4/graph.json","fetch_events":"https://pith.science/api/pith-number/5H4FBHWHX46VMSU6CEECIBUIR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5H4FBHWHX46VMSU6CEECIBUIR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5H4FBHWHX46VMSU6CEECIBUIR4/action/storage_attestation","attest_author":"https://pith.science/pith/5H4FBHWHX46VMSU6CEECIBUIR4/action/author_attestation","sign_citation":"https://pith.science/pith/5H4FBHWHX46VMSU6CEECIBUIR4/action/citation_signature","submit_replication":"https://pith.science/pith/5H4FBHWHX46VMSU6CEECIBUIR4/action/replication_record"}},"created_at":"2026-07-05T05:55:23.186633+00:00","updated_at":"2026-07-05T05:55:23.186633+00:00"}