{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:QSADK6TSZAYKQZI7BPUJFDADJV","short_pith_number":"pith:QSADK6TS","canonical_record":{"source":{"id":"2206.09295","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-06-18T23:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"6f9c845eff35211aa9417d8f28d1e402cc3af6ecf855a8d8dc14a735e0b54209","abstract_canon_sha256":"91836841ac62bf61be700254c561f329336f8c2111f3ca6f122f8f954b099c18"},"schema_version":"1.0"},"canonical_sha256":"8480357a72c830a8651f0be8928c034d6653396daf137577b0880f3076845144","source":{"kind":"arxiv","id":"2206.09295","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.09295","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"2206.09295v2","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09295","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"QSADK6TSZAYK","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"pith_short_16","alias_value":"QSADK6TSZAYKQZI7","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"pith_short_8","alias_value":"QSADK6TS","created_at":"2026-07-05T05:37:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:QSADK6TSZAYKQZI7BPUJFDADJV","target":"record","payload":{"canonical_record":{"source":{"id":"2206.09295","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-06-18T23:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"6f9c845eff35211aa9417d8f28d1e402cc3af6ecf855a8d8dc14a735e0b54209","abstract_canon_sha256":"91836841ac62bf61be700254c561f329336f8c2111f3ca6f122f8f954b099c18"},"schema_version":"1.0"},"canonical_sha256":"8480357a72c830a8651f0be8928c034d6653396daf137577b0880f3076845144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:06.701606Z","signature_b64":"Lb/eybelxrwSyH6wIkZtgs7at55Ja+SMxC+xeIDwuItdy0/qb4A4L5JpcEEkKb3z14ofV71r+vho4VnMLkZ4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8480357a72c830a8651f0be8928c034d6653396daf137577b0880f3076845144","last_reissued_at":"2026-07-05T05:37:06.701069Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:06.701069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.09295","source_version":2,"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-05T05:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0MS96zPEQEFfxO0Ivkvce6GC10oBQdYnyg3eZIFs7uypvIYNEp+MGMmKGbc8AAuLK6mN5BYN7gL4NBzy/XrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:56:32.771440Z"},"content_sha256":"da8cd9ec956cd749c06edf57b2830c2440349bff2106f3a32e09fb24bfeda1d3","schema_version":"1.0","event_id":"sha256:da8cd9ec956cd749c06edf57b2830c2440349bff2106f3a32e09fb24bfeda1d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:QSADK6TSZAYKQZI7BPUJFDADJV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extensions on spectral extrema of $C_5/C_6$-free graphs with given size","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Wanting Sun, Wei Wei","submitted_at":"2022-06-18T23:11:45Z","abstract_excerpt":"Let $\\mathcal{F}$ denote a set of graphs. A graph $G$ is said to be $\\mathcal{F}$-free if it does not contain any element of $\\mathcal{F}$ as a subgraph. The Tur\\'an number is the maximum possible number of edges in an $\\mathcal{F}$-free graph with $n$ vertices. It is well known that classical Tur\\'an type extremal problem aims to study the Tur\\'an number of fixed graphs. In 2010, Nikiforov \\cite{Nik2} proposed analogously a spectral Tur\\'an type problem which asks to determine the maximum spectral radius of an $\\mathcal{F}$-free graph with $n$ vertices. It attracts much attention and many suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09295","kind":"arxiv","version":2},"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/2206.09295/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-05T05:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKTXMZF1+dWi0DkPsuzp0t8Rizl+kIBSpyMBSM2eJwuno4SL3i/d9vqAcBejE/VkuUPZPjBKAq3xvoHn0FfMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:56:32.771946Z"},"content_sha256":"a7cc9f3ef181289397c5123db73666b75db808c625449eff375b634d9c35b48a","schema_version":"1.0","event_id":"sha256:a7cc9f3ef181289397c5123db73666b75db808c625449eff375b634d9c35b48a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/bundle.json","state_url":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSADK6TSZAYKQZI7BPUJFDADJV/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-11T02:56:32Z","links":{"resolver":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV","bundle":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/bundle.json","state":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSADK6TSZAYKQZI7BPUJFDADJV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QSADK6TSZAYKQZI7BPUJFDADJV","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":"91836841ac62bf61be700254c561f329336f8c2111f3ca6f122f8f954b099c18","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-06-18T23:11:45Z","title_canon_sha256":"6f9c845eff35211aa9417d8f28d1e402cc3af6ecf855a8d8dc14a735e0b54209"},"schema_version":"1.0","source":{"id":"2206.09295","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.09295","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"2206.09295v2","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09295","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"QSADK6TSZAYK","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"pith_short_16","alias_value":"QSADK6TSZAYKQZI7","created_at":"2026-07-05T05:37:06Z"},{"alias_kind":"pith_short_8","alias_value":"QSADK6TS","created_at":"2026-07-05T05:37:06Z"}],"graph_snapshots":[{"event_id":"sha256:a7cc9f3ef181289397c5123db73666b75db808c625449eff375b634d9c35b48a","target":"graph","created_at":"2026-07-05T05:37:06Z","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/2206.09295/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{F}$ denote a set of graphs. A graph $G$ is said to be $\\mathcal{F}$-free if it does not contain any element of $\\mathcal{F}$ as a subgraph. The Tur\\'an number is the maximum possible number of edges in an $\\mathcal{F}$-free graph with $n$ vertices. It is well known that classical Tur\\'an type extremal problem aims to study the Tur\\'an number of fixed graphs. In 2010, Nikiforov \\cite{Nik2} proposed analogously a spectral Tur\\'an type problem which asks to determine the maximum spectral radius of an $\\mathcal{F}$-free graph with $n$ vertices. It attracts much attention and many suc","authors_text":"Shuchao Li, Wanting Sun, Wei Wei","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-06-18T23:11:45Z","title":"Extensions on spectral extrema of $C_5/C_6$-free graphs with given size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09295","kind":"arxiv","version":2},"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:da8cd9ec956cd749c06edf57b2830c2440349bff2106f3a32e09fb24bfeda1d3","target":"record","created_at":"2026-07-05T05:37:06Z","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":"91836841ac62bf61be700254c561f329336f8c2111f3ca6f122f8f954b099c18","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-06-18T23:11:45Z","title_canon_sha256":"6f9c845eff35211aa9417d8f28d1e402cc3af6ecf855a8d8dc14a735e0b54209"},"schema_version":"1.0","source":{"id":"2206.09295","kind":"arxiv","version":2}},"canonical_sha256":"8480357a72c830a8651f0be8928c034d6653396daf137577b0880f3076845144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8480357a72c830a8651f0be8928c034d6653396daf137577b0880f3076845144","first_computed_at":"2026-07-05T05:37:06.701069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:37:06.701069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lb/eybelxrwSyH6wIkZtgs7at55Ja+SMxC+xeIDwuItdy0/qb4A4L5JpcEEkKb3z14ofV71r+vho4VnMLkZ4Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:37:06.701606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.09295","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da8cd9ec956cd749c06edf57b2830c2440349bff2106f3a32e09fb24bfeda1d3","sha256:a7cc9f3ef181289397c5123db73666b75db808c625449eff375b634d9c35b48a"],"state_sha256":"f250ca279adfba09a734b8c5b1c24c61bd4c5fda8cbac69c3118b5205aa82830"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AGmHquOHRcHFW4lGsCuXm5nbuQhK9Uf02LxTREEJUjMPIMmIiJadS/6tioxzi19I4C6e/NklH6P0dM4PlSgQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:56:32.776627Z","bundle_sha256":"275ba1c22524ff8f9f6f61943df1e0d50d682c27cd62fbda7019ecf9255b8609"}}