{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MKL5LISFO4HSYI6UPTMY6VVIW4","short_pith_number":"pith:MKL5LISF","canonical_record":{"source":{"id":"1607.08291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T01:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"e6f8e1c0aedd727f2c25099074fafdad571411c2d512fe2f9e441887daccd530","abstract_canon_sha256":"a6c8e88974c0ab17b036b924ffdad97652cc09078a26975f1aea589ddae89409"},"schema_version":"1.0"},"canonical_sha256":"6297d5a245770f2c23d47cd98f56a8b70ec770c51ef91d7d32553baaa7f02adc","source":{"kind":"arxiv","id":"1607.08291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08291","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08291v1","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08291","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"MKL5LISFO4HS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKL5LISFO4HSYI6U","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKL5LISF","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MKL5LISFO4HSYI6UPTMY6VVIW4","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T01:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"e6f8e1c0aedd727f2c25099074fafdad571411c2d512fe2f9e441887daccd530","abstract_canon_sha256":"a6c8e88974c0ab17b036b924ffdad97652cc09078a26975f1aea589ddae89409"},"schema_version":"1.0"},"canonical_sha256":"6297d5a245770f2c23d47cd98f56a8b70ec770c51ef91d7d32553baaa7f02adc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:19.465728Z","signature_b64":"ktlQ/mCxI7oplmtf3mtxv7pVpXKoFvstNMq/KjLvjPudgB+gr2yc3I3/O0+dmbwHZZ65V1GgVKgnEnK5Ey5TCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6297d5a245770f2c23d47cd98f56a8b70ec770c51ef91d7d32553baaa7f02adc","last_reissued_at":"2026-05-18T01:10:19.465125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:19.465125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08291","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-18T01:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cq8WvgtDWsVslssmveqm2z9zK2W16gaHGDQTELkpDEuB5VuiqulIJsYW0+2v+46XcDWAjMUQY4boMI5Rqw/BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:25:53.623224Z"},"content_sha256":"3d77d4f138096757e81df2fc337186bb1be4fd719888246ebfa5fea38bb98c48","schema_version":"1.0","event_id":"sha256:3d77d4f138096757e81df2fc337186bb1be4fd719888246ebfa5fea38bb98c48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MKL5LISFO4HSYI6UPTMY6VVIW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The first few unicyclic and bicyclic hypergraphs with larger spectral radii","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chen Ouyang, Liqun Qi, Xiying Yuan","submitted_at":"2016-07-28T01:29:18Z","abstract_excerpt":"A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called $r$-cyclic if $n=m(k-1)-r+1$. For $r=1$ or $2$, the hypergraph is simply called unicyclic or bicyclic. In this paper we investigate hypergraphs that attain larger spectral radii among all simple connected $k$-uniform unicyclic and bicyclic hypergraphs. Specifically, by using some edge operations, the formula on power hypergraph eigenvalues, the weighted incidence matrix and a result on linear unicyclic hypergraphs, we determined the first five hypergraphs with larger spectral radius among all unicyclic hypergraphs and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08291","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-18T01:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Y1Jbv+eQQC7oanTlpxaAYNGyxR3okb/SvyFkUz5+Xo9OzayES0QJamNIm78lSZGgr0l1rPX3B1Xp9/ohxBxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:25:53.623624Z"},"content_sha256":"9e5211b502e561b5bca28cd16a43f9c3f6305310fd5a6c219e88f1390e2810cc","schema_version":"1.0","event_id":"sha256:9e5211b502e561b5bca28cd16a43f9c3f6305310fd5a6c219e88f1390e2810cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKL5LISFO4HSYI6UPTMY6VVIW4/bundle.json","state_url":"https://pith.science/pith/MKL5LISFO4HSYI6UPTMY6VVIW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKL5LISFO4HSYI6UPTMY6VVIW4/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-03T03:25:53Z","links":{"resolver":"https://pith.science/pith/MKL5LISFO4HSYI6UPTMY6VVIW4","bundle":"https://pith.science/pith/MKL5LISFO4HSYI6UPTMY6VVIW4/bundle.json","state":"https://pith.science/pith/MKL5LISFO4HSYI6UPTMY6VVIW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKL5LISFO4HSYI6UPTMY6VVIW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MKL5LISFO4HSYI6UPTMY6VVIW4","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":"a6c8e88974c0ab17b036b924ffdad97652cc09078a26975f1aea589ddae89409","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T01:29:18Z","title_canon_sha256":"e6f8e1c0aedd727f2c25099074fafdad571411c2d512fe2f9e441887daccd530"},"schema_version":"1.0","source":{"id":"1607.08291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08291","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08291v1","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08291","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"MKL5LISFO4HS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MKL5LISFO4HSYI6U","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MKL5LISF","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:9e5211b502e561b5bca28cd16a43f9c3f6305310fd5a6c219e88f1390e2810cc","target":"graph","created_at":"2026-05-18T01:10:19Z","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":"A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called $r$-cyclic if $n=m(k-1)-r+1$. For $r=1$ or $2$, the hypergraph is simply called unicyclic or bicyclic. In this paper we investigate hypergraphs that attain larger spectral radii among all simple connected $k$-uniform unicyclic and bicyclic hypergraphs. Specifically, by using some edge operations, the formula on power hypergraph eigenvalues, the weighted incidence matrix and a result on linear unicyclic hypergraphs, we determined the first five hypergraphs with larger spectral radius among all unicyclic hypergraphs and","authors_text":"Chen Ouyang, Liqun Qi, Xiying Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T01:29:18Z","title":"The first few unicyclic and bicyclic hypergraphs with larger spectral radii"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08291","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:3d77d4f138096757e81df2fc337186bb1be4fd719888246ebfa5fea38bb98c48","target":"record","created_at":"2026-05-18T01:10:19Z","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":"a6c8e88974c0ab17b036b924ffdad97652cc09078a26975f1aea589ddae89409","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-28T01:29:18Z","title_canon_sha256":"e6f8e1c0aedd727f2c25099074fafdad571411c2d512fe2f9e441887daccd530"},"schema_version":"1.0","source":{"id":"1607.08291","kind":"arxiv","version":1}},"canonical_sha256":"6297d5a245770f2c23d47cd98f56a8b70ec770c51ef91d7d32553baaa7f02adc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6297d5a245770f2c23d47cd98f56a8b70ec770c51ef91d7d32553baaa7f02adc","first_computed_at":"2026-05-18T01:10:19.465125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:19.465125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ktlQ/mCxI7oplmtf3mtxv7pVpXKoFvstNMq/KjLvjPudgB+gr2yc3I3/O0+dmbwHZZ65V1GgVKgnEnK5Ey5TCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:19.465728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d77d4f138096757e81df2fc337186bb1be4fd719888246ebfa5fea38bb98c48","sha256:9e5211b502e561b5bca28cd16a43f9c3f6305310fd5a6c219e88f1390e2810cc"],"state_sha256":"84c4e5c44683dab29deeeb41b37b5611cf194239c957c0836cffefc2cf1c46a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCgZ6x2gdiiPlOeQNCiv0Djw88pgEe9zQmU2gMkeV5PIfvgrsTWp8YK8dwQgj6xMnAsUwTDs4oRVmM0d36oyAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:25:53.625700Z","bundle_sha256":"806a1f303ee9689d47e9b91e0fd32554a0c147f1bffa981c7837a72c2152170e"}}