{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OJMNVMW2QRVMEBVAZYFTI3HPCV","short_pith_number":"pith:OJMNVMW2","schema_version":"1.0","canonical_sha256":"7258dab2da846ac206a0ce0b346cef15471c33e7d5ce46f3f2bf447953161d78","source":{"kind":"arxiv","id":"2302.08686","version":1},"attestation_state":"computed","paper":{"title":"The maximum Wiener index of a uniform hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey Tompkins, Ervin Gy\\H{o}ri, James Tuite, Nika Salia, Stijn Cambie","submitted_at":"2023-02-17T04:34:28Z","abstract_excerpt":"The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$-vertex $k$-uniform hypergraph and characterize for every~$n$ all hypergraphs attaining the maximum Wiener index."},"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":"2302.08686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-17T04:34:28Z","cross_cats_sorted":[],"title_canon_sha256":"2b19852766b362809220bb9e893ad1ded6a690d2f01d81bfada4d8a9cbad91c7","abstract_canon_sha256":"3685f010dd76b3d02a64d7bd521b82c87d66f84dc4ee7f3480549ecbc098d7a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:42:53.554977Z","signature_b64":"vPmEiHBu/aazKq/h+k3seAUDtv2M/0MiP+S13NFcRU9RBqWXjrDAgEUQQXSzU51dCMxBeo8+No9rCX3V1CPXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7258dab2da846ac206a0ce0b346cef15471c33e7d5ce46f3f2bf447953161d78","last_reissued_at":"2026-07-05T05:42:53.554482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:42:53.554482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum Wiener index of a uniform hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey Tompkins, Ervin Gy\\H{o}ri, James Tuite, Nika Salia, Stijn Cambie","submitted_at":"2023-02-17T04:34:28Z","abstract_excerpt":"The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$-vertex $k$-uniform hypergraph and characterize for every~$n$ all hypergraphs attaining the maximum Wiener index."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08686","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/2302.08686/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":"2302.08686","created_at":"2026-07-05T05:42:53.554538+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.08686v1","created_at":"2026-07-05T05:42:53.554538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08686","created_at":"2026-07-05T05:42:53.554538+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJMNVMW2QRVM","created_at":"2026-07-05T05:42:53.554538+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJMNVMW2QRVMEBVA","created_at":"2026-07-05T05:42:53.554538+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJMNVMW2","created_at":"2026-07-05T05:42:53.554538+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07511","citing_title":"Uniform \\v{S}olt\\'es' hypergraphs and \\v{S}olt\\'es' weighted graphs","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV","json":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV.json","graph_json":"https://pith.science/api/pith-number/OJMNVMW2QRVMEBVAZYFTI3HPCV/graph.json","events_json":"https://pith.science/api/pith-number/OJMNVMW2QRVMEBVAZYFTI3HPCV/events.json","paper":"https://pith.science/paper/OJMNVMW2"},"agent_actions":{"view_html":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV","download_json":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV.json","view_paper":"https://pith.science/paper/OJMNVMW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.08686&json=true","fetch_graph":"https://pith.science/api/pith-number/OJMNVMW2QRVMEBVAZYFTI3HPCV/graph.json","fetch_events":"https://pith.science/api/pith-number/OJMNVMW2QRVMEBVAZYFTI3HPCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV/action/storage_attestation","attest_author":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV/action/author_attestation","sign_citation":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV/action/citation_signature","submit_replication":"https://pith.science/pith/OJMNVMW2QRVMEBVAZYFTI3HPCV/action/replication_record"}},"created_at":"2026-07-05T05:42:53.554538+00:00","updated_at":"2026-07-05T05:42:53.554538+00:00"}