{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2WME2LWF5LLJR3UT2MVINBAPNA","short_pith_number":"pith:2WME2LWF","canonical_record":{"source":{"id":"1709.09594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"50c92f54efedf4f4064b1b761031f4ee8322fb98b1854e91331033a20a5e74ce","abstract_canon_sha256":"0a96b9f841305a225aa88216330a02a80eb1b71a0a7ca78254492800797a3596"},"schema_version":"1.0"},"canonical_sha256":"d5984d2ec5ead698ee93d32a86840f683c52fdfc6ee98ad4be530ab04dd3bff0","source":{"kind":"arxiv","id":"1709.09594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09594","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09594v1","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09594","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"2WME2LWF5LLJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WME2LWF5LLJR3UT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WME2LWF","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2WME2LWF5LLJR3UT2MVINBAPNA","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"50c92f54efedf4f4064b1b761031f4ee8322fb98b1854e91331033a20a5e74ce","abstract_canon_sha256":"0a96b9f841305a225aa88216330a02a80eb1b71a0a7ca78254492800797a3596"},"schema_version":"1.0"},"canonical_sha256":"d5984d2ec5ead698ee93d32a86840f683c52fdfc6ee98ad4be530ab04dd3bff0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:11.208508Z","signature_b64":"xYE7JtmmbvV/e6EqLEAxitjTnJ0EZUNYvfn+rq0hDA1psPS25FeTn2oogZL/De9b4fpb3ZlXBTHGD3iGiwHSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5984d2ec5ead698ee93d32a86840f683c52fdfc6ee98ad4be530ab04dd3bff0","last_reissued_at":"2026-05-18T00:34:11.207868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:11.207868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09594","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:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fniKdFkK18JR105lC4/rx3mJQ5U0f10YpjabvMc2Qh1VdAs0qfly1oJZHmEtYX0ME7COBajPVPFiSkJ5geMqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:37:17.576048Z"},"content_sha256":"ad72ac0a9465f0e18eb1e67e39e952f92780c824992a148f55d73a149af9962d","schema_version":"1.0","event_id":"sha256:ad72ac0a9465f0e18eb1e67e39e952f92780c824992a148f55d73a149af9962d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2WME2LWF5LLJR3UT2MVINBAPNA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremality of graph entropy based on degrees of uniform hypergraphs with few edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hu, Shenggui Zhang, Xiaogang Liu, Xueliang Li","submitted_at":"2017-09-27T15:52:27Z","abstract_excerpt":"Let $\\mathcal{H}$ be a hypergraph with $n$ vertices. Suppose that $d_1,d_2,\\ldots,d_n$ are degrees of the vertices of $\\mathcal{H}$. The $t$-th graph entropy based on degrees of $\\mathcal{H}$ is defined as $$ I_d^t(\\mathcal{H}) =-\\sum_{i=1}^{n}\\left(\\frac{d_i^{t}}{\\sum_{j=1}^{n}d_j^{t}}\\log\\frac{d_i^{t}}{\\sum_{j=1}^{n}d_j^{t}}\\right) =\\log\\left(\\sum_{i=1}^{n}d_i^{t}\\right)-\\sum_{i=1}^{n}\\left(\\frac{d_i^{t}}{\\sum_{j=1}^{n}d_j^{t}}\\log d_i^{t}\\right), $$ where $t$ is a real number and the logarithm is taken to the base two. In this paper we obtain upper and lower bounds of $I_d^t(\\mathcal{H})$ f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09594","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:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhMy1CVPLdGZnPSk7KkIsX0yxYZ1rpM4DVsdXHL8T4JPVz36QwjzKnbAuxeQG75PKsFU038BxkhELVbpwytoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:37:17.576400Z"},"content_sha256":"2ff9ea410f9d3b55101314066576e1c4a08589e35f19b23417ea11140688ee74","schema_version":"1.0","event_id":"sha256:2ff9ea410f9d3b55101314066576e1c4a08589e35f19b23417ea11140688ee74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WME2LWF5LLJR3UT2MVINBAPNA/bundle.json","state_url":"https://pith.science/pith/2WME2LWF5LLJR3UT2MVINBAPNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WME2LWF5LLJR3UT2MVINBAPNA/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-01T18:37:17Z","links":{"resolver":"https://pith.science/pith/2WME2LWF5LLJR3UT2MVINBAPNA","bundle":"https://pith.science/pith/2WME2LWF5LLJR3UT2MVINBAPNA/bundle.json","state":"https://pith.science/pith/2WME2LWF5LLJR3UT2MVINBAPNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WME2LWF5LLJR3UT2MVINBAPNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2WME2LWF5LLJR3UT2MVINBAPNA","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":"0a96b9f841305a225aa88216330a02a80eb1b71a0a7ca78254492800797a3596","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:52:27Z","title_canon_sha256":"50c92f54efedf4f4064b1b761031f4ee8322fb98b1854e91331033a20a5e74ce"},"schema_version":"1.0","source":{"id":"1709.09594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09594","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09594v1","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09594","created_at":"2026-05-18T00:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"2WME2LWF5LLJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WME2LWF5LLJR3UT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WME2LWF","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:2ff9ea410f9d3b55101314066576e1c4a08589e35f19b23417ea11140688ee74","target":"graph","created_at":"2026-05-18T00:34:11Z","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":"Let $\\mathcal{H}$ be a hypergraph with $n$ vertices. Suppose that $d_1,d_2,\\ldots,d_n$ are degrees of the vertices of $\\mathcal{H}$. The $t$-th graph entropy based on degrees of $\\mathcal{H}$ is defined as $$ I_d^t(\\mathcal{H}) =-\\sum_{i=1}^{n}\\left(\\frac{d_i^{t}}{\\sum_{j=1}^{n}d_j^{t}}\\log\\frac{d_i^{t}}{\\sum_{j=1}^{n}d_j^{t}}\\right) =\\log\\left(\\sum_{i=1}^{n}d_i^{t}\\right)-\\sum_{i=1}^{n}\\left(\\frac{d_i^{t}}{\\sum_{j=1}^{n}d_j^{t}}\\log d_i^{t}\\right), $$ where $t$ is a real number and the logarithm is taken to the base two. In this paper we obtain upper and lower bounds of $I_d^t(\\mathcal{H})$ f","authors_text":"Dan Hu, Shenggui Zhang, Xiaogang Liu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:52:27Z","title":"Extremality of graph entropy based on degrees of uniform hypergraphs with few edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09594","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:ad72ac0a9465f0e18eb1e67e39e952f92780c824992a148f55d73a149af9962d","target":"record","created_at":"2026-05-18T00:34:11Z","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":"0a96b9f841305a225aa88216330a02a80eb1b71a0a7ca78254492800797a3596","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:52:27Z","title_canon_sha256":"50c92f54efedf4f4064b1b761031f4ee8322fb98b1854e91331033a20a5e74ce"},"schema_version":"1.0","source":{"id":"1709.09594","kind":"arxiv","version":1}},"canonical_sha256":"d5984d2ec5ead698ee93d32a86840f683c52fdfc6ee98ad4be530ab04dd3bff0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5984d2ec5ead698ee93d32a86840f683c52fdfc6ee98ad4be530ab04dd3bff0","first_computed_at":"2026-05-18T00:34:11.207868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:11.207868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xYE7JtmmbvV/e6EqLEAxitjTnJ0EZUNYvfn+rq0hDA1psPS25FeTn2oogZL/De9b4fpb3ZlXBTHGD3iGiwHSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:11.208508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad72ac0a9465f0e18eb1e67e39e952f92780c824992a148f55d73a149af9962d","sha256:2ff9ea410f9d3b55101314066576e1c4a08589e35f19b23417ea11140688ee74"],"state_sha256":"317ef1dc0951aa529b977041f452c41798bb6c4bfd9fe0ffb58eb9f70943ab81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veb3IxidL/m+SkoDqaW7+fic44/iigTdRQRdX4gT4a6IT66DkbKpDXT5kHOPWSU/imamKh0PVCntDe/iZzf4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:37:17.578380Z","bundle_sha256":"c2a1c3f872f34a334485b13d81ebb7209f04491457197b668f26681e96a46334"}}