{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZQVE47AXFFOM664Y2JXVDSCNLJ","short_pith_number":"pith:ZQVE47AX","canonical_record":{"source":{"id":"2411.19110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T12:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"3f7691f1e05d4d5e65a4e4263765af57fb56d5eaea43d5dd9a91b3d2e22116d1","abstract_canon_sha256":"9d93ef48766611985d2e16484128aa130ca83a23c25bc83ba7d1904785884957"},"schema_version":"1.0"},"canonical_sha256":"cc2a4e7c17295ccf7b98d26f51c84d5a717a4e258a6896ff5d15cb57841f20d3","source":{"kind":"arxiv","id":"2411.19110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19110","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19110v1","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19110","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZQVE47AXFFOM","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"pith_short_16","alias_value":"ZQVE47AXFFOM664Y","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"pith_short_8","alias_value":"ZQVE47AX","created_at":"2026-07-05T09:41:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZQVE47AXFFOM664Y2JXVDSCNLJ","target":"record","payload":{"canonical_record":{"source":{"id":"2411.19110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T12:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"3f7691f1e05d4d5e65a4e4263765af57fb56d5eaea43d5dd9a91b3d2e22116d1","abstract_canon_sha256":"9d93ef48766611985d2e16484128aa130ca83a23c25bc83ba7d1904785884957"},"schema_version":"1.0"},"canonical_sha256":"cc2a4e7c17295ccf7b98d26f51c84d5a717a4e258a6896ff5d15cb57841f20d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:57.292249Z","signature_b64":"Hk+t/Xdlx0GiG/udn8Mi5y3GtqYpsUdkwoLodnTZOiU20PPqvCIOqBREKCsNrocaWYIYZ5+ly9N61kzjzU5kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc2a4e7c17295ccf7b98d26f51c84d5a717a4e258a6896ff5d15cb57841f20d3","last_reissued_at":"2026-07-05T09:41:57.291827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:57.291827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.19110","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:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+zeiChD2anD0F5jdZoNABQSFQ6WlfftUBZYlBtCYx+LOnOyBIDH3J5YTdy5KsMFYYDIvTttnn9P7F8GDvxKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T06:14:18.562682Z"},"content_sha256":"ba130d56290ac274ae6fed54e61ae58d7c87c1655a51956a1b95ae9130598299","schema_version":"1.0","event_id":"sha256:ba130d56290ac274ae6fed54e61ae58d7c87c1655a51956a1b95ae9130598299"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZQVE47AXFFOM664Y2JXVDSCNLJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extension on spectral extrema of gem-free graph with given size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ligong Wang, Yuxiang Liu","submitted_at":"2024-11-28T12:57:37Z","abstract_excerpt":"A graph $G$ is $F$-free if $G$ does not contain $F$ as a subgraph. Let $\\mathcal{G}(m, F)$ denote the family of $F$-free graphs with $m$ edges and without isolated vertices. Let $S_{n,k}$ denote the graph obtained by joining every vertex of $K_{k}$ to $n-k$ isolated vertices and $S_{n,k}^{t}$ denote the graph obtained from $S_{n-t,k}$ by attaching $t$ pendant vertices to the maximal degree vertex of $S_{n-t,k}$, respectively. Denote by $H_{n}$ the fan graph obtain from $n-1$-vertex path plus a vertex adjacent to each vertex of the path. Particularly, the graph $H_{5}$ is also known as the gem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19110","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.19110/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:41:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNLpwlkrWQIZwKKmyS7fovK8QooA4Z4Eumu0/JXH1uHsXnmeeU4PZJnQ29fbEbgHi3j5F6D2nES8PeL59IdbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T06:14:18.563200Z"},"content_sha256":"c28160a5359ec59b2477b2e7b18a59de0d312242d32eddd1e64eef84532cd3fd","schema_version":"1.0","event_id":"sha256:c28160a5359ec59b2477b2e7b18a59de0d312242d32eddd1e64eef84532cd3fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQVE47AXFFOM664Y2JXVDSCNLJ/bundle.json","state_url":"https://pith.science/pith/ZQVE47AXFFOM664Y2JXVDSCNLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQVE47AXFFOM664Y2JXVDSCNLJ/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-15T06:14:18Z","links":{"resolver":"https://pith.science/pith/ZQVE47AXFFOM664Y2JXVDSCNLJ","bundle":"https://pith.science/pith/ZQVE47AXFFOM664Y2JXVDSCNLJ/bundle.json","state":"https://pith.science/pith/ZQVE47AXFFOM664Y2JXVDSCNLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQVE47AXFFOM664Y2JXVDSCNLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZQVE47AXFFOM664Y2JXVDSCNLJ","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":"9d93ef48766611985d2e16484128aa130ca83a23c25bc83ba7d1904785884957","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T12:57:37Z","title_canon_sha256":"3f7691f1e05d4d5e65a4e4263765af57fb56d5eaea43d5dd9a91b3d2e22116d1"},"schema_version":"1.0","source":{"id":"2411.19110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19110","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19110v1","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19110","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZQVE47AXFFOM","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"pith_short_16","alias_value":"ZQVE47AXFFOM664Y","created_at":"2026-07-05T09:41:57Z"},{"alias_kind":"pith_short_8","alias_value":"ZQVE47AX","created_at":"2026-07-05T09:41:57Z"}],"graph_snapshots":[{"event_id":"sha256:c28160a5359ec59b2477b2e7b18a59de0d312242d32eddd1e64eef84532cd3fd","target":"graph","created_at":"2026-07-05T09:41:57Z","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/2411.19110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is $F$-free if $G$ does not contain $F$ as a subgraph. Let $\\mathcal{G}(m, F)$ denote the family of $F$-free graphs with $m$ edges and without isolated vertices. Let $S_{n,k}$ denote the graph obtained by joining every vertex of $K_{k}$ to $n-k$ isolated vertices and $S_{n,k}^{t}$ denote the graph obtained from $S_{n-t,k}$ by attaching $t$ pendant vertices to the maximal degree vertex of $S_{n-t,k}$, respectively. Denote by $H_{n}$ the fan graph obtain from $n-1$-vertex path plus a vertex adjacent to each vertex of the path. Particularly, the graph $H_{5}$ is also known as the gem.","authors_text":"Ligong Wang, Yuxiang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T12:57:37Z","title":"Extension on spectral extrema of gem-free graph with given size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19110","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:ba130d56290ac274ae6fed54e61ae58d7c87c1655a51956a1b95ae9130598299","target":"record","created_at":"2026-07-05T09:41:57Z","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":"9d93ef48766611985d2e16484128aa130ca83a23c25bc83ba7d1904785884957","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T12:57:37Z","title_canon_sha256":"3f7691f1e05d4d5e65a4e4263765af57fb56d5eaea43d5dd9a91b3d2e22116d1"},"schema_version":"1.0","source":{"id":"2411.19110","kind":"arxiv","version":1}},"canonical_sha256":"cc2a4e7c17295ccf7b98d26f51c84d5a717a4e258a6896ff5d15cb57841f20d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc2a4e7c17295ccf7b98d26f51c84d5a717a4e258a6896ff5d15cb57841f20d3","first_computed_at":"2026-07-05T09:41:57.291827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:57.291827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hk+t/Xdlx0GiG/udn8Mi5y3GtqYpsUdkwoLodnTZOiU20PPqvCIOqBREKCsNrocaWYIYZ5+ly9N61kzjzU5kBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:57.292249Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.19110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba130d56290ac274ae6fed54e61ae58d7c87c1655a51956a1b95ae9130598299","sha256:c28160a5359ec59b2477b2e7b18a59de0d312242d32eddd1e64eef84532cd3fd"],"state_sha256":"31948e98fa5841810bfed74dbd9b97fa2f2b66098a3b0c4c6b8ab6ae4c7fbc27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAWi70RhGQXE/FC69Ex0ufA7XTY1YRmUtaMUSqVSRNXPqwxuUKzWaFK3A3lLa5sWgbC0SyqA3gHdOlPFuQqaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T06:14:18.566890Z","bundle_sha256":"30dc6f00ac95292eb2518f5fa458d5d912e313685d623fec327a9c33b93c2f52"}}