{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WEGANRETTMBXADMLZ7T55JKRV7","short_pith_number":"pith:WEGANRET","canonical_record":{"source":{"id":"2309.16925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-29T01:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"be011e4328c098d3e040a32aad01e7c5f7a07460ed4912165c8fc77c699eaf49","abstract_canon_sha256":"1cc57aaea296be53cb10c30faaaa4bd104c56a6484c868921140e1e049723508"},"schema_version":"1.0"},"canonical_sha256":"b10c06c4939b03700d8bcfe7dea551afed4be68edcd6e4484df18277fa6d4b14","source":{"kind":"arxiv","id":"2309.16925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.16925","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"arxiv_version","alias_value":"2309.16925v1","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.16925","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"pith_short_12","alias_value":"WEGANRETTMBX","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"pith_short_16","alias_value":"WEGANRETTMBXADML","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"pith_short_8","alias_value":"WEGANRET","created_at":"2026-07-05T06:55:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WEGANRETTMBXADMLZ7T55JKRV7","target":"record","payload":{"canonical_record":{"source":{"id":"2309.16925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-29T01:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"be011e4328c098d3e040a32aad01e7c5f7a07460ed4912165c8fc77c699eaf49","abstract_canon_sha256":"1cc57aaea296be53cb10c30faaaa4bd104c56a6484c868921140e1e049723508"},"schema_version":"1.0"},"canonical_sha256":"b10c06c4939b03700d8bcfe7dea551afed4be68edcd6e4484df18277fa6d4b14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:29.821581Z","signature_b64":"2mI2+zfKyvj9v8RHAN+1adVffmyGlut7+6WM3ueS3CU8D0JpveJkpnrkNQ1lroD6wSi88FRokuvphDB9Zx9bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b10c06c4939b03700d8bcfe7dea551afed4be68edcd6e4484df18277fa6d4b14","last_reissued_at":"2026-07-05T06:55:29.821152Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:29.821152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.16925","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-05T06:55:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xA3XQVb9FoGN7Uhgwm87gNzxM8jKvwVok/REUl8m4aJ54ytQ5rJIOm3IYg4yRDhkIyYnyFOO3YpCvypE7Z+eCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:41:03.573418Z"},"content_sha256":"1a3ac97698603e7ed68d9cc0acd12898d909cb811ebc9d4db5eb0cef6edadd90","schema_version":"1.0","event_id":"sha256:1a3ac97698603e7ed68d9cc0acd12898d909cb811ebc9d4db5eb0cef6edadd90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WEGANRETTMBXADMLZ7T55JKRV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lexicographical ordering of hypergraphs via spectral moment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Changjiang Bu, Hong Zhou","submitted_at":"2023-09-29T01:52:41Z","abstract_excerpt":"The lexicographical ordering of hypergraphs via spectral moments is called the $S$-order of hypergraphs.In this paper, the $S$-order of hypergraphs is investigated.We characterize the first and last hypergraphs in an $S$-order of all uniform hypertrees and all linear unicyclic uniformhypergraphs with given girth, respectively. And we give the last hypergraph in an $S$-order of all linear unicyclic uniform hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.16925","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/2309.16925/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-05T06:55:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xu6Paz3vXOyZoG70Jfpqcg7/vxwBkzyXlJ3TioQzL8i/omTLpeFpwc0EYnV5WBtsfD/b21uf4cOLPtVAQatvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:41:03.573926Z"},"content_sha256":"235dc6bb4e7a2ebd61a2f0fe4ff7ceb7fbc85d9e01210096d02514fc04f77662","schema_version":"1.0","event_id":"sha256:235dc6bb4e7a2ebd61a2f0fe4ff7ceb7fbc85d9e01210096d02514fc04f77662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEGANRETTMBXADMLZ7T55JKRV7/bundle.json","state_url":"https://pith.science/pith/WEGANRETTMBXADMLZ7T55JKRV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEGANRETTMBXADMLZ7T55JKRV7/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-08T18:41:03Z","links":{"resolver":"https://pith.science/pith/WEGANRETTMBXADMLZ7T55JKRV7","bundle":"https://pith.science/pith/WEGANRETTMBXADMLZ7T55JKRV7/bundle.json","state":"https://pith.science/pith/WEGANRETTMBXADMLZ7T55JKRV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEGANRETTMBXADMLZ7T55JKRV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WEGANRETTMBXADMLZ7T55JKRV7","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":"1cc57aaea296be53cb10c30faaaa4bd104c56a6484c868921140e1e049723508","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-29T01:52:41Z","title_canon_sha256":"be011e4328c098d3e040a32aad01e7c5f7a07460ed4912165c8fc77c699eaf49"},"schema_version":"1.0","source":{"id":"2309.16925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.16925","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"arxiv_version","alias_value":"2309.16925v1","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.16925","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"pith_short_12","alias_value":"WEGANRETTMBX","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"pith_short_16","alias_value":"WEGANRETTMBXADML","created_at":"2026-07-05T06:55:29Z"},{"alias_kind":"pith_short_8","alias_value":"WEGANRET","created_at":"2026-07-05T06:55:29Z"}],"graph_snapshots":[{"event_id":"sha256:235dc6bb4e7a2ebd61a2f0fe4ff7ceb7fbc85d9e01210096d02514fc04f77662","target":"graph","created_at":"2026-07-05T06:55:29Z","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/2309.16925/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The lexicographical ordering of hypergraphs via spectral moments is called the $S$-order of hypergraphs.In this paper, the $S$-order of hypergraphs is investigated.We characterize the first and last hypergraphs in an $S$-order of all uniform hypertrees and all linear unicyclic uniformhypergraphs with given girth, respectively. And we give the last hypergraph in an $S$-order of all linear unicyclic uniform hypergraphs.","authors_text":"Changjiang Bu, Hong Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-29T01:52:41Z","title":"Lexicographical ordering of hypergraphs via spectral moment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.16925","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:1a3ac97698603e7ed68d9cc0acd12898d909cb811ebc9d4db5eb0cef6edadd90","target":"record","created_at":"2026-07-05T06:55:29Z","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":"1cc57aaea296be53cb10c30faaaa4bd104c56a6484c868921140e1e049723508","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-09-29T01:52:41Z","title_canon_sha256":"be011e4328c098d3e040a32aad01e7c5f7a07460ed4912165c8fc77c699eaf49"},"schema_version":"1.0","source":{"id":"2309.16925","kind":"arxiv","version":1}},"canonical_sha256":"b10c06c4939b03700d8bcfe7dea551afed4be68edcd6e4484df18277fa6d4b14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b10c06c4939b03700d8bcfe7dea551afed4be68edcd6e4484df18277fa6d4b14","first_computed_at":"2026-07-05T06:55:29.821152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:55:29.821152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2mI2+zfKyvj9v8RHAN+1adVffmyGlut7+6WM3ueS3CU8D0JpveJkpnrkNQ1lroD6wSi88FRokuvphDB9Zx9bCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:55:29.821581Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.16925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a3ac97698603e7ed68d9cc0acd12898d909cb811ebc9d4db5eb0cef6edadd90","sha256:235dc6bb4e7a2ebd61a2f0fe4ff7ceb7fbc85d9e01210096d02514fc04f77662"],"state_sha256":"1e7eddfce4aeac9ba529bf2a0fbbb52e459f0e12970c4733c72749bbbd696ee6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JG5aD2RxnEy3A2FqSVZmjMUm5uELPvVTR/3JHQBlpc6oRxqxNVsnlqyT0OI3BOhlzuUdX20pvusYBML6IyMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T18:41:03.579379Z","bundle_sha256":"7c21f2e7794b6c56c8ff07fc8279f7ee530e12cb25d6c85ee4fb443fd13eca52"}}