{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IB24AXCUUYXHKZ64UVZRHGZ57K","short_pith_number":"pith:IB24AXCU","canonical_record":{"source":{"id":"2003.12384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T02:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"1890c43fa2f00e25c86f6537de17cbf3e21343d4100881036e0cd9d65758e363","abstract_canon_sha256":"a929695c5cd78cf61a846db97833ea646253b54762f736726fbbd13066202442"},"schema_version":"1.0"},"canonical_sha256":"4075c05c54a62e7567dca573139b3dfaa3c3e1e388572f38e33d874c910b90aa","source":{"kind":"arxiv","id":"2003.12384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.12384","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"2003.12384v1","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.12384","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"IB24AXCUUYXH","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_16","alias_value":"IB24AXCUUYXHKZ64","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_8","alias_value":"IB24AXCU","created_at":"2026-07-05T00:50:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IB24AXCUUYXHKZ64UVZRHGZ57K","target":"record","payload":{"canonical_record":{"source":{"id":"2003.12384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T02:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"1890c43fa2f00e25c86f6537de17cbf3e21343d4100881036e0cd9d65758e363","abstract_canon_sha256":"a929695c5cd78cf61a846db97833ea646253b54762f736726fbbd13066202442"},"schema_version":"1.0"},"canonical_sha256":"4075c05c54a62e7567dca573139b3dfaa3c3e1e388572f38e33d874c910b90aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:57.876098Z","signature_b64":"H172M+fAYl0LNZpSVDSfytJ9z97tW5YPwn4EBDD8sK7eFFdZaIG8kFtLYP41i6Q42Ha6pz3NtMKqN635qM8ZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4075c05c54a62e7567dca573139b3dfaa3c3e1e388572f38e33d874c910b90aa","last_reissued_at":"2026-07-05T00:50:57.875579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:57.875579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.12384","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-07-05T00:50:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//kPQIY7xNvSeiCP9N6wg1IBDXlyBIOl9HHkj5GvA0Px74U0DHeFsPomaNc1tF8JRWpnkyb55u+NV9lfHFUNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:49:52.310765Z"},"content_sha256":"144366c5fb67dfd89784e1ace4ff051829287a2a72fc1f80be534b988bd04d51","schema_version":"1.0","event_id":"sha256:144366c5fb67dfd89784e1ace4ff051829287a2a72fc1f80be534b988bd04d51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IB24AXCUUYXHKZ64UVZRHGZ57K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremality of graph entropy based on Laplacian degrees of k-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pengli Lu, Yulong Xue","submitted_at":"2020-03-25T02:48:08Z","abstract_excerpt":"The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple graphs are extended to k-uniform hypergraphs. Using an edge-moving operation, the maximum and minimum graph entropy based on Laplacian degrees are determined in k-uniform hypertrees, unicyclic k-uniform hypergraphs, bicyclic k-uniform hypergraphs and k-uniform chemical hypertrees, respectively, and the corresponding extremal graphs are determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.12384","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/2003.12384/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-07-05T00:50:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCSvTiG3vRSS+aNSsF5NT+OtzW+Ehjfn3NSVhiGIzzz152KpiitTFE8q7mc0Kvg/R1LEXJIDH+UBrXzFS324Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:49:52.311261Z"},"content_sha256":"a31c8d0cd3515a967662db0df2856bd057f1de03551fa6e2ec3b2d984d978a64","schema_version":"1.0","event_id":"sha256:a31c8d0cd3515a967662db0df2856bd057f1de03551fa6e2ec3b2d984d978a64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IB24AXCUUYXHKZ64UVZRHGZ57K/bundle.json","state_url":"https://pith.science/pith/IB24AXCUUYXHKZ64UVZRHGZ57K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IB24AXCUUYXHKZ64UVZRHGZ57K/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-08-21T04:49:52Z","links":{"resolver":"https://pith.science/pith/IB24AXCUUYXHKZ64UVZRHGZ57K","bundle":"https://pith.science/pith/IB24AXCUUYXHKZ64UVZRHGZ57K/bundle.json","state":"https://pith.science/pith/IB24AXCUUYXHKZ64UVZRHGZ57K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IB24AXCUUYXHKZ64UVZRHGZ57K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IB24AXCUUYXHKZ64UVZRHGZ57K","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":"a929695c5cd78cf61a846db97833ea646253b54762f736726fbbd13066202442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T02:48:08Z","title_canon_sha256":"1890c43fa2f00e25c86f6537de17cbf3e21343d4100881036e0cd9d65758e363"},"schema_version":"1.0","source":{"id":"2003.12384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.12384","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"2003.12384v1","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.12384","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"IB24AXCUUYXH","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_16","alias_value":"IB24AXCUUYXHKZ64","created_at":"2026-07-05T00:50:57Z"},{"alias_kind":"pith_short_8","alias_value":"IB24AXCU","created_at":"2026-07-05T00:50:57Z"}],"graph_snapshots":[{"event_id":"sha256:a31c8d0cd3515a967662db0df2856bd057f1de03551fa6e2ec3b2d984d978a64","target":"graph","created_at":"2026-07-05T00:50:57Z","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/2003.12384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple graphs are extended to k-uniform hypergraphs. Using an edge-moving operation, the maximum and minimum graph entropy based on Laplacian degrees are determined in k-uniform hypertrees, unicyclic k-uniform hypergraphs, bicyclic k-uniform hypergraphs and k-uniform chemical hypertrees, respectively, and the corresponding extremal graphs are determined.","authors_text":"Pengli Lu, Yulong Xue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T02:48:08Z","title":"Extremality of graph entropy based on Laplacian degrees of k-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.12384","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:144366c5fb67dfd89784e1ace4ff051829287a2a72fc1f80be534b988bd04d51","target":"record","created_at":"2026-07-05T00:50:57Z","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":"a929695c5cd78cf61a846db97833ea646253b54762f736726fbbd13066202442","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-25T02:48:08Z","title_canon_sha256":"1890c43fa2f00e25c86f6537de17cbf3e21343d4100881036e0cd9d65758e363"},"schema_version":"1.0","source":{"id":"2003.12384","kind":"arxiv","version":1}},"canonical_sha256":"4075c05c54a62e7567dca573139b3dfaa3c3e1e388572f38e33d874c910b90aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4075c05c54a62e7567dca573139b3dfaa3c3e1e388572f38e33d874c910b90aa","first_computed_at":"2026-07-05T00:50:57.875579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:50:57.875579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H172M+fAYl0LNZpSVDSfytJ9z97tW5YPwn4EBDD8sK7eFFdZaIG8kFtLYP41i6Q42Ha6pz3NtMKqN635qM8ZDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:50:57.876098Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.12384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:144366c5fb67dfd89784e1ace4ff051829287a2a72fc1f80be534b988bd04d51","sha256:a31c8d0cd3515a967662db0df2856bd057f1de03551fa6e2ec3b2d984d978a64"],"state_sha256":"8188f9094fbfa13856136adef9a82fe6cc7a37312160c39c46cd2ad7d7bf5ec6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OuEr7yEV+WsJ+OaFWwVNetrGoLedyIdv2x3xEsb8q0whYoAyZ512z+cvy0rX4OjvTI6sS46EGFiq4E50jYFHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T04:49:52.315183Z","bundle_sha256":"2c6d967298af224c6683c5eb7324b997bec0de0553f5eff6df0fd28ad73c84c1"}}