{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ITY24MRFAMYFJ7F2L3D6PSSSKR","short_pith_number":"pith:ITY24MRF","canonical_record":{"source":{"id":"2409.14138","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-21T13:30:34Z","cross_cats_sorted":[],"title_canon_sha256":"1316b5ca03114b81a7edbebcb317664e49de85a20162693802c4d52175fb6951","abstract_canon_sha256":"85debd10df40ed1897dd28df800657ed8dc5a41d510761c1c682b9ee3e890a5b"},"schema_version":"1.0"},"canonical_sha256":"44f1ae3225033054fcba5ec7e7ca525456f3532ee2e4318b1ccf1c3b4811aff6","source":{"kind":"arxiv","id":"2409.14138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.14138","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2409.14138v1","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14138","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"ITY24MRFAMYF","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"pith_short_16","alias_value":"ITY24MRFAMYFJ7F2","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"pith_short_8","alias_value":"ITY24MRF","created_at":"2026-07-05T09:10:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ITY24MRFAMYFJ7F2L3D6PSSSKR","target":"record","payload":{"canonical_record":{"source":{"id":"2409.14138","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-21T13:30:34Z","cross_cats_sorted":[],"title_canon_sha256":"1316b5ca03114b81a7edbebcb317664e49de85a20162693802c4d52175fb6951","abstract_canon_sha256":"85debd10df40ed1897dd28df800657ed8dc5a41d510761c1c682b9ee3e890a5b"},"schema_version":"1.0"},"canonical_sha256":"44f1ae3225033054fcba5ec7e7ca525456f3532ee2e4318b1ccf1c3b4811aff6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:12.234583Z","signature_b64":"zwL4RsGBgJYR4uASmNWVBma+vu9OgAH0pt/+4Crk4xqtGpVpj5hByNrWMJKO8LpI1gIG/de+78eAFSYsm37ZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f1ae3225033054fcba5ec7e7ca525456f3532ee2e4318b1ccf1c3b4811aff6","last_reissued_at":"2026-07-05T09:10:12.234119Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:12.234119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.14138","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-05T09:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZVRvzDESvZv/XeM6rpgkoXT/fN2h71CM6P1yhAXpUVUvkPJKRMTPTFahri8fSg7pvbEIQZScqQnj7o1xQjgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:44:07.127550Z"},"content_sha256":"33e0dc5947feb7124caa175f0fccce2bf5a461d189830ae7338fe8f7df9f4383","schema_version":"1.0","event_id":"sha256:33e0dc5947feb7124caa175f0fccce2bf5a461d189830ae7338fe8f7df9f4383"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ITY24MRFAMYFJ7F2L3D6PSSSKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Brualdi-Hoffman-Tur\\'{a}n problem for friendship graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chen, Xiying Yuan","submitted_at":"2024-09-21T13:30:34Z","abstract_excerpt":"A graph is said to be $H$-free if it does not contain $H$ as a subgraph. Brualdi-Hoffman-Tur\\'{a}n type problem is to determine the maximum spectral radius of an $H$-free graph $G$ with give size $m$. The $F_k$ is the graph consisting of $k$ triangles that intersect in exactly one common vertex, which is known as the friendship graph. In this paper, we resolve a conjecture (the Brualdi-Hoffman-Tur\\'{a}n-type problem for $F_k$) of Li, Lu and Peng [Discrete Math. 346 (2023) 113680] by using the $k$-core technique presented in Li, Zhai and Shu [European J. Combin, 120 (2024) 103966]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14138","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/2409.14138/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-05T09:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hRt4dhEjpadt+cl8LWFpA3R0TTfCGqixBBEFWmcw1g5+0AZ/nJ2m164vAAR5gQHRbyDURq6RgN/L1k0CtFhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:44:07.128284Z"},"content_sha256":"14d6c7841f7affcd590ec0fe1d74fc66c34349b1906e7c7e9e5ace0544cafc1a","schema_version":"1.0","event_id":"sha256:14d6c7841f7affcd590ec0fe1d74fc66c34349b1906e7c7e9e5ace0544cafc1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITY24MRFAMYFJ7F2L3D6PSSSKR/bundle.json","state_url":"https://pith.science/pith/ITY24MRFAMYFJ7F2L3D6PSSSKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITY24MRFAMYFJ7F2L3D6PSSSKR/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-05T06:44:07Z","links":{"resolver":"https://pith.science/pith/ITY24MRFAMYFJ7F2L3D6PSSSKR","bundle":"https://pith.science/pith/ITY24MRFAMYFJ7F2L3D6PSSSKR/bundle.json","state":"https://pith.science/pith/ITY24MRFAMYFJ7F2L3D6PSSSKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITY24MRFAMYFJ7F2L3D6PSSSKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ITY24MRFAMYFJ7F2L3D6PSSSKR","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":"85debd10df40ed1897dd28df800657ed8dc5a41d510761c1c682b9ee3e890a5b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-21T13:30:34Z","title_canon_sha256":"1316b5ca03114b81a7edbebcb317664e49de85a20162693802c4d52175fb6951"},"schema_version":"1.0","source":{"id":"2409.14138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.14138","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2409.14138v1","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14138","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"ITY24MRFAMYF","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"pith_short_16","alias_value":"ITY24MRFAMYFJ7F2","created_at":"2026-07-05T09:10:12Z"},{"alias_kind":"pith_short_8","alias_value":"ITY24MRF","created_at":"2026-07-05T09:10:12Z"}],"graph_snapshots":[{"event_id":"sha256:14d6c7841f7affcd590ec0fe1d74fc66c34349b1906e7c7e9e5ace0544cafc1a","target":"graph","created_at":"2026-07-05T09:10:12Z","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/2409.14138/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is said to be $H$-free if it does not contain $H$ as a subgraph. Brualdi-Hoffman-Tur\\'{a}n type problem is to determine the maximum spectral radius of an $H$-free graph $G$ with give size $m$. The $F_k$ is the graph consisting of $k$ triangles that intersect in exactly one common vertex, which is known as the friendship graph. In this paper, we resolve a conjecture (the Brualdi-Hoffman-Tur\\'{a}n-type problem for $F_k$) of Li, Lu and Peng [Discrete Math. 346 (2023) 113680] by using the $k$-core technique presented in Li, Zhai and Shu [European J. Combin, 120 (2024) 103966].","authors_text":"Fan Chen, Xiying Yuan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-21T13:30:34Z","title":"A Brualdi-Hoffman-Tur\\'{a}n problem for friendship graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14138","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:33e0dc5947feb7124caa175f0fccce2bf5a461d189830ae7338fe8f7df9f4383","target":"record","created_at":"2026-07-05T09:10:12Z","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":"85debd10df40ed1897dd28df800657ed8dc5a41d510761c1c682b9ee3e890a5b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-21T13:30:34Z","title_canon_sha256":"1316b5ca03114b81a7edbebcb317664e49de85a20162693802c4d52175fb6951"},"schema_version":"1.0","source":{"id":"2409.14138","kind":"arxiv","version":1}},"canonical_sha256":"44f1ae3225033054fcba5ec7e7ca525456f3532ee2e4318b1ccf1c3b4811aff6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f1ae3225033054fcba5ec7e7ca525456f3532ee2e4318b1ccf1c3b4811aff6","first_computed_at":"2026-07-05T09:10:12.234119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:10:12.234119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwL4RsGBgJYR4uASmNWVBma+vu9OgAH0pt/+4Crk4xqtGpVpj5hByNrWMJKO8LpI1gIG/de+78eAFSYsm37ZDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:10:12.234583Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.14138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33e0dc5947feb7124caa175f0fccce2bf5a461d189830ae7338fe8f7df9f4383","sha256:14d6c7841f7affcd590ec0fe1d74fc66c34349b1906e7c7e9e5ace0544cafc1a"],"state_sha256":"dd6fa21f6bd5c4fd0f9102beca9e1e7565006831161be7dfac8d332d8062295d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+C3YLMjgt5h84scpYSUTEi46CVgPCgSbhbD+Gy14eQ9eBy3hBNKt36Hutk1nkvITrPm+U6S2vtJVPLwupTSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T06:44:07.133358Z","bundle_sha256":"c24b90b1a1d496a3c2eefdd949159dcc9ac0f53483a1a9817901add69b8f81ea"}}