{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KTGFYRSUMNIM3FUI2UU6SSFMQG","short_pith_number":"pith:KTGFYRSU","canonical_record":{"source":{"id":"2607.00770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"6444db65e5bca0041aebeac74f307079513a537b32612b12e19af69ea41b451a","abstract_canon_sha256":"04ba43bc33a06bb454a9b9b437d35e17b0e22834351196b7de618f347f941725"},"schema_version":"1.0"},"canonical_sha256":"54cc5c46546350cd9688d529e948ac818def69c2213ed2044a266cebb66680e9","source":{"kind":"arxiv","id":"2607.00770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00770","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00770v1","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00770","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"KTGFYRSUMNIM","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"KTGFYRSUMNIM3FUI","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"KTGFYRSU","created_at":"2026-07-02T01:17:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KTGFYRSUMNIM3FUI2UU6SSFMQG","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"6444db65e5bca0041aebeac74f307079513a537b32612b12e19af69ea41b451a","abstract_canon_sha256":"04ba43bc33a06bb454a9b9b437d35e17b0e22834351196b7de618f347f941725"},"schema_version":"1.0"},"canonical_sha256":"54cc5c46546350cd9688d529e948ac818def69c2213ed2044a266cebb66680e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:54.954998Z","signature_b64":"LBW5oStiMLsExUk5bc1tOeyssZUjALfhWz5n3dAUDT4w5RzZIjsTQfqq04YJL/U1OvAZtNG4NpUjNWW74e1IDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54cc5c46546350cd9688d529e948ac818def69c2213ed2044a266cebb66680e9","last_reissued_at":"2026-07-02T01:17:54.954437Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:54.954437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00770","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-02T01:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8juDqdtzjgX8QJfAp/F11PjKxwq2Z9hkXa9NpM7I2HOR1Y8nTshsb9O7UP2lHMCjfoeXk+NgCE8Yyh9+XH3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T09:08:30.798528Z"},"content_sha256":"90ff807feb5e77274d7c8079bb3ae1abcd0e75faae6a45c2a1a50f4436bebfa3","schema_version":"1.0","event_id":"sha256:90ff807feb5e77274d7c8079bb3ae1abcd0e75faae6a45c2a1a50f4436bebfa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KTGFYRSUMNIM3FUI2UU6SSFMQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Further Results on the maximun number of stars in graphs with forbidden properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia-Bao Yang, Leilei Zhang, Yuxuan Liu","submitted_at":"2026-07-01T10:53:33Z","abstract_excerpt":"A graph $G$ is called $k$-edge hamiltonian if every linear forest (i.e., a disjoint union of paths) with at most $k$ edges is contained in a Hamilton cycle of $G$. Motivated by earlier results of Erd\\H{o}s, F\\\"{o}redi, Kostochka and Luo determined the maximum number of $t$-stars in nonhamiltonian graphs. Recently, Berikkyzy, Hogenson, Kirsch and McDonald extended this line of research by determining the maximum number of $t$-stars in graphs that are not $k$-edge hamiltonian (as well as related notions such as traceability, hamiltonian-connectedness, and $k$-hamiltonicity). For sufficiently lar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00770","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/2607.00770/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-02T01:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTCUGB8C7g8x/dw1QZI4QUySkpPljpaCAF1LZmaaDlGyptWDDA8b3iXt4FRmjbqFQsHD8EbfCO3I1tXs2n0cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T09:08:30.798902Z"},"content_sha256":"806865d0f708dc95455e2d2a125bc2f59184146a668ad6f5f0df009bcddad77a","schema_version":"1.0","event_id":"sha256:806865d0f708dc95455e2d2a125bc2f59184146a668ad6f5f0df009bcddad77a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTGFYRSUMNIM3FUI2UU6SSFMQG/bundle.json","state_url":"https://pith.science/pith/KTGFYRSUMNIM3FUI2UU6SSFMQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTGFYRSUMNIM3FUI2UU6SSFMQG/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-07-04T09:08:30Z","links":{"resolver":"https://pith.science/pith/KTGFYRSUMNIM3FUI2UU6SSFMQG","bundle":"https://pith.science/pith/KTGFYRSUMNIM3FUI2UU6SSFMQG/bundle.json","state":"https://pith.science/pith/KTGFYRSUMNIM3FUI2UU6SSFMQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTGFYRSUMNIM3FUI2UU6SSFMQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KTGFYRSUMNIM3FUI2UU6SSFMQG","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":"04ba43bc33a06bb454a9b9b437d35e17b0e22834351196b7de618f347f941725","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:53:33Z","title_canon_sha256":"6444db65e5bca0041aebeac74f307079513a537b32612b12e19af69ea41b451a"},"schema_version":"1.0","source":{"id":"2607.00770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00770","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00770v1","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00770","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"KTGFYRSUMNIM","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"KTGFYRSUMNIM3FUI","created_at":"2026-07-02T01:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"KTGFYRSU","created_at":"2026-07-02T01:17:54Z"}],"graph_snapshots":[{"event_id":"sha256:806865d0f708dc95455e2d2a125bc2f59184146a668ad6f5f0df009bcddad77a","target":"graph","created_at":"2026-07-02T01:17:54Z","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/2607.00770/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is called $k$-edge hamiltonian if every linear forest (i.e., a disjoint union of paths) with at most $k$ edges is contained in a Hamilton cycle of $G$. Motivated by earlier results of Erd\\H{o}s, F\\\"{o}redi, Kostochka and Luo determined the maximum number of $t$-stars in nonhamiltonian graphs. Recently, Berikkyzy, Hogenson, Kirsch and McDonald extended this line of research by determining the maximum number of $t$-stars in graphs that are not $k$-edge hamiltonian (as well as related notions such as traceability, hamiltonian-connectedness, and $k$-hamiltonicity). For sufficiently lar","authors_text":"Jia-Bao Yang, Leilei Zhang, Yuxuan Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:53:33Z","title":"Further Results on the maximun number of stars in graphs with forbidden properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00770","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:90ff807feb5e77274d7c8079bb3ae1abcd0e75faae6a45c2a1a50f4436bebfa3","target":"record","created_at":"2026-07-02T01:17:54Z","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":"04ba43bc33a06bb454a9b9b437d35e17b0e22834351196b7de618f347f941725","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T10:53:33Z","title_canon_sha256":"6444db65e5bca0041aebeac74f307079513a537b32612b12e19af69ea41b451a"},"schema_version":"1.0","source":{"id":"2607.00770","kind":"arxiv","version":1}},"canonical_sha256":"54cc5c46546350cd9688d529e948ac818def69c2213ed2044a266cebb66680e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54cc5c46546350cd9688d529e948ac818def69c2213ed2044a266cebb66680e9","first_computed_at":"2026-07-02T01:17:54.954437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:54.954437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LBW5oStiMLsExUk5bc1tOeyssZUjALfhWz5n3dAUDT4w5RzZIjsTQfqq04YJL/U1OvAZtNG4NpUjNWW74e1IDQ==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:54.954998Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90ff807feb5e77274d7c8079bb3ae1abcd0e75faae6a45c2a1a50f4436bebfa3","sha256:806865d0f708dc95455e2d2a125bc2f59184146a668ad6f5f0df009bcddad77a"],"state_sha256":"10a58d7c71e5d97f6918e6adf270aca1c6c7ca16c530addc98a59e3b22295f95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWW7DXYqRVRw/lBJSa9eYfCIlYmadfXel/OqEhkzfgg7Nc0CPkkvJchRlFQ0wg/MFVMwMiCGFXAqv+t67iyAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T09:08:30.800851Z","bundle_sha256":"86ae894611b6a1f996a51e2a3f8732eb204a22e7d2493e6519ffdffe809228a5"}}