{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KTYW6YC3EKV6BVDFQEZJM5TJ24","short_pith_number":"pith:KTYW6YC3","schema_version":"1.0","canonical_sha256":"54f16f605b22abe0d4658132967669d715e8448a4caf36a5fa8add3ef56a355c","source":{"kind":"arxiv","id":"2411.08345","version":1},"attestation_state":"computed","paper":{"title":"Brualdi-Hoffman-Tur\\'{a}n problem of the gem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chen, Xiying Yuan","submitted_at":"2024-11-13T05:26:54Z","abstract_excerpt":"A graph is said to be $F$-free if it does not contain $F$ as a subgraph. Brualdi-Hoffman-Tur\\'{a}n problem seeks to determine the maximum spectral radius of an $F$-free graph with given size. The gem consists of a path on $4$ vertices, along with an additional vertex that is adjacent to every vertex of the path. Concerning Brualdi-Hoffman-Tur\\'{a}n problem of the gem, when the size is odd, Zhang and Wang [Discrete Math. 347 (2024) 114171] and Yu, Li and Peng [arXiv:2404. 03423] solved it. In this paper, we completely solve the Brualdi-Hoffman-Tur\\'{a}n problem type problem of the gem."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.08345","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-13T05:26:54Z","cross_cats_sorted":[],"title_canon_sha256":"367e17cfe44bd26897bf3032bcb211d2bc38c928ef5999f1df262ee0354a8773","abstract_canon_sha256":"360740dac8cec659aa1a3b53472185d123bbb2edf08db96fa4b39fe3189ecd18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:45.696908Z","signature_b64":"SEIx6CJl6/MBXt2r3OWFZKhccgn/BSlkgEz49dg+/xGHp0nvPN0NEOUIpl8siHhZhFpehCPvvQOAMboA63HNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54f16f605b22abe0d4658132967669d715e8448a4caf36a5fa8add3ef56a355c","last_reissued_at":"2026-07-05T09:34:45.696421Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:45.696421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Brualdi-Hoffman-Tur\\'{a}n problem of the gem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chen, Xiying Yuan","submitted_at":"2024-11-13T05:26:54Z","abstract_excerpt":"A graph is said to be $F$-free if it does not contain $F$ as a subgraph. Brualdi-Hoffman-Tur\\'{a}n problem seeks to determine the maximum spectral radius of an $F$-free graph with given size. The gem consists of a path on $4$ vertices, along with an additional vertex that is adjacent to every vertex of the path. Concerning Brualdi-Hoffman-Tur\\'{a}n problem of the gem, when the size is odd, Zhang and Wang [Discrete Math. 347 (2024) 114171] and Yu, Li and Peng [arXiv:2404. 03423] solved it. In this paper, we completely solve the Brualdi-Hoffman-Tur\\'{a}n problem type problem of the gem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08345","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/2411.08345/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.08345","created_at":"2026-07-05T09:34:45.696482+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08345v1","created_at":"2026-07-05T09:34:45.696482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08345","created_at":"2026-07-05T09:34:45.696482+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTYW6YC3EKV6","created_at":"2026-07-05T09:34:45.696482+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTYW6YC3EKV6BVDF","created_at":"2026-07-05T09:34:45.696482+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTYW6YC3","created_at":"2026-07-05T09:34:45.696482+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24","json":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24.json","graph_json":"https://pith.science/api/pith-number/KTYW6YC3EKV6BVDFQEZJM5TJ24/graph.json","events_json":"https://pith.science/api/pith-number/KTYW6YC3EKV6BVDFQEZJM5TJ24/events.json","paper":"https://pith.science/paper/KTYW6YC3"},"agent_actions":{"view_html":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24","download_json":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24.json","view_paper":"https://pith.science/paper/KTYW6YC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08345&json=true","fetch_graph":"https://pith.science/api/pith-number/KTYW6YC3EKV6BVDFQEZJM5TJ24/graph.json","fetch_events":"https://pith.science/api/pith-number/KTYW6YC3EKV6BVDFQEZJM5TJ24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24/action/storage_attestation","attest_author":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24/action/author_attestation","sign_citation":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24/action/citation_signature","submit_replication":"https://pith.science/pith/KTYW6YC3EKV6BVDFQEZJM5TJ24/action/replication_record"}},"created_at":"2026-07-05T09:34:45.696482+00:00","updated_at":"2026-07-05T09:34:45.696482+00:00"}