{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PJC3Q7NM3O226MQKVPYWR2YFW7","short_pith_number":"pith:PJC3Q7NM","canonical_record":{"source":{"id":"1504.04195","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T11:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"117d33e9fb517e7613fc0bf0ab41c27996e3562508a16e9861afbbb126bd8af9","abstract_canon_sha256":"172f3958004ea6e0179054fd081c1a9f06df4209207ffa76382c2346d0b928f1"},"schema_version":"1.0"},"canonical_sha256":"7a45b87dacdbb5af320aabf168eb05b7c9b7f03adcacda0dd568d0d72693776c","source":{"kind":"arxiv","id":"1504.04195","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04195","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04195v3","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04195","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"PJC3Q7NM3O22","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJC3Q7NM3O226MQK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJC3Q7NM","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PJC3Q7NM3O226MQKVPYWR2YFW7","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04195","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T11:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"117d33e9fb517e7613fc0bf0ab41c27996e3562508a16e9861afbbb126bd8af9","abstract_canon_sha256":"172f3958004ea6e0179054fd081c1a9f06df4209207ffa76382c2346d0b928f1"},"schema_version":"1.0"},"canonical_sha256":"7a45b87dacdbb5af320aabf168eb05b7c9b7f03adcacda0dd568d0d72693776c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.328701Z","signature_b64":"U3EOIrSH9A5GHrwIdjtE9g0bY+l5DN5WDm20hZ91kWqyKt0E7XuCJbP3f0Jk/gxT6AIwSqrKG3ip12kGTzSDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a45b87dacdbb5af320aabf168eb05b7c9b7f03adcacda0dd568d0d72693776c","last_reissued_at":"2026-05-18T00:10:48.328151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.328151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04195","source_version":3,"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-05-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRH24cfxy76AZ4E4V2Jg1I8w+Z0TVafn7eONy6sImgMigmFPKLHW5hTLAitWY0AswO1vRC73frUvy3R1worYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:47:21.557388Z"},"content_sha256":"70044a7dbe247ed518a64c8583c1b9b62370fd940c99853af35c65074e683f07","schema_version":"1.0","event_id":"sha256:70044a7dbe247ed518a64c8583c1b9b62370fd940c99853af35c65074e683f07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PJC3Q7NM3O226MQKVPYWR2YFW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal problems on the Hamiltonicity of claw-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Bo Ning, Xing Peng","submitted_at":"2015-04-16T11:58:17Z","abstract_excerpt":"In 1962, Erd\\H{o}s proved that if a graph $G$ with $n$ vertices satisfies $$ e(G)>\\max\\left\\{\\binom{n-k}{2}+k^2,\\binom{\\lceil(n+1)/2\\rceil}{2}+\\left\\lfloor \\frac{n-1}{2}\\right\\rfloor^2\\right\\}, $$ where the minimum degree $\\delta(G)\\geq k$ and $1\\leq k\\leq(n-1)/2$, then it is Hamiltonian. For $n \\geq 2k+1$, let $E^k_n=K_{k}\\vee (kK_1+K_{n-2k})$, where \"$\\vee$\" is the \"join\" operation. One can observe $e(E^k_n)=\\binom{n-k}{2}+k^2$ and $E^k_n$ is not Hamiltonian. As $E^k_n$ contains induced claws for $k\\geq 2$, a natural question is to characterize all 2-connected claw-free non-Hamiltonian graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04195","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Quzu4iVLcATlghkoxyoPqUzSvo9Z6cTufc8n8KyjLu+oOiSAcYx5rBok85Nmxerda0ZM5eQE8bAR5CP00Y3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:47:21.557961Z"},"content_sha256":"481cd5aea3b4b99118b8e383b890e25f7bae0a198287cdb6455080e30703547b","schema_version":"1.0","event_id":"sha256:481cd5aea3b4b99118b8e383b890e25f7bae0a198287cdb6455080e30703547b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJC3Q7NM3O226MQKVPYWR2YFW7/bundle.json","state_url":"https://pith.science/pith/PJC3Q7NM3O226MQKVPYWR2YFW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJC3Q7NM3O226MQKVPYWR2YFW7/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-06-04T22:47:21Z","links":{"resolver":"https://pith.science/pith/PJC3Q7NM3O226MQKVPYWR2YFW7","bundle":"https://pith.science/pith/PJC3Q7NM3O226MQKVPYWR2YFW7/bundle.json","state":"https://pith.science/pith/PJC3Q7NM3O226MQKVPYWR2YFW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJC3Q7NM3O226MQKVPYWR2YFW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PJC3Q7NM3O226MQKVPYWR2YFW7","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":"172f3958004ea6e0179054fd081c1a9f06df4209207ffa76382c2346d0b928f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T11:58:17Z","title_canon_sha256":"117d33e9fb517e7613fc0bf0ab41c27996e3562508a16e9861afbbb126bd8af9"},"schema_version":"1.0","source":{"id":"1504.04195","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04195","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04195v3","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04195","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"PJC3Q7NM3O22","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJC3Q7NM3O226MQK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJC3Q7NM","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:481cd5aea3b4b99118b8e383b890e25f7bae0a198287cdb6455080e30703547b","target":"graph","created_at":"2026-05-18T00:10:48Z","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"},"paper":{"abstract_excerpt":"In 1962, Erd\\H{o}s proved that if a graph $G$ with $n$ vertices satisfies $$ e(G)>\\max\\left\\{\\binom{n-k}{2}+k^2,\\binom{\\lceil(n+1)/2\\rceil}{2}+\\left\\lfloor \\frac{n-1}{2}\\right\\rfloor^2\\right\\}, $$ where the minimum degree $\\delta(G)\\geq k$ and $1\\leq k\\leq(n-1)/2$, then it is Hamiltonian. For $n \\geq 2k+1$, let $E^k_n=K_{k}\\vee (kK_1+K_{n-2k})$, where \"$\\vee$\" is the \"join\" operation. One can observe $e(E^k_n)=\\binom{n-k}{2}+k^2$ and $E^k_n$ is not Hamiltonian. As $E^k_n$ contains induced claws for $k\\geq 2$, a natural question is to characterize all 2-connected claw-free non-Hamiltonian graph","authors_text":"Binlong Li, Bo Ning, Xing Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T11:58:17Z","title":"Extremal problems on the Hamiltonicity of claw-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04195","kind":"arxiv","version":3},"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:70044a7dbe247ed518a64c8583c1b9b62370fd940c99853af35c65074e683f07","target":"record","created_at":"2026-05-18T00:10:48Z","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":"172f3958004ea6e0179054fd081c1a9f06df4209207ffa76382c2346d0b928f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T11:58:17Z","title_canon_sha256":"117d33e9fb517e7613fc0bf0ab41c27996e3562508a16e9861afbbb126bd8af9"},"schema_version":"1.0","source":{"id":"1504.04195","kind":"arxiv","version":3}},"canonical_sha256":"7a45b87dacdbb5af320aabf168eb05b7c9b7f03adcacda0dd568d0d72693776c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a45b87dacdbb5af320aabf168eb05b7c9b7f03adcacda0dd568d0d72693776c","first_computed_at":"2026-05-18T00:10:48.328151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:48.328151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3EOIrSH9A5GHrwIdjtE9g0bY+l5DN5WDm20hZ91kWqyKt0E7XuCJbP3f0Jk/gxT6AIwSqrKG3ip12kGTzSDCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:48.328701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04195","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70044a7dbe247ed518a64c8583c1b9b62370fd940c99853af35c65074e683f07","sha256:481cd5aea3b4b99118b8e383b890e25f7bae0a198287cdb6455080e30703547b"],"state_sha256":"fd37ac4a8d3cbbff3103352688ec37dff7196ebe3ab4c025204b2acb81be7c87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yayD0krDy3sHgEGLO4NmNfhesQtq78kIsJzNRdeMaHcAzZG/R4IQMWBqAYQCOpJq750zhaXGRHXBaq51ekVEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:47:21.561094Z","bundle_sha256":"f13f2808ba28fcca21eccd0f7a87adf63518fb488ecb60739cf29c4b083a962e"}}