{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:U3I2J2R6PBQLES34HEOPJKE77A","short_pith_number":"pith:U3I2J2R6","canonical_record":{"source":{"id":"2606.08401","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T01:31:53Z","cross_cats_sorted":[],"title_canon_sha256":"0da6a8913be4bcbca924c741b3ad6508505babff55c3f8370358267132e63306","abstract_canon_sha256":"13da1601b501cb822eac21cac7b3261cd32e69e05cc571f3e70a4e9e414423bb"},"schema_version":"1.0"},"canonical_sha256":"a6d1a4ea3e7860b24b7c391cf4a89ff80fe94720dab32c6a94e373308ec2c940","source":{"kind":"arxiv","id":"2606.08401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08401","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08401v1","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08401","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"U3I2J2R6PBQL","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"U3I2J2R6PBQLES34","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"U3I2J2R6","created_at":"2026-06-09T01:05:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:U3I2J2R6PBQLES34HEOPJKE77A","target":"record","payload":{"canonical_record":{"source":{"id":"2606.08401","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T01:31:53Z","cross_cats_sorted":[],"title_canon_sha256":"0da6a8913be4bcbca924c741b3ad6508505babff55c3f8370358267132e63306","abstract_canon_sha256":"13da1601b501cb822eac21cac7b3261cd32e69e05cc571f3e70a4e9e414423bb"},"schema_version":"1.0"},"canonical_sha256":"a6d1a4ea3e7860b24b7c391cf4a89ff80fe94720dab32c6a94e373308ec2c940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:35.685680Z","signature_b64":"WWrUCNTRWg18kg4WCDDgxID8+mrCb9rcGOTAutSEmvPEIBZWI5ZaVgLaX7COyxMeV4sHE7Sf/mkWYokrJqNIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6d1a4ea3e7860b24b7c391cf4a89ff80fe94720dab32c6a94e373308ec2c940","last_reissued_at":"2026-06-09T01:05:35.685250Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:35.685250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.08401","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-06-09T01:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5JMWQogp6u6bp4WZYf+u1ygjBCqMBD5VYFtnuob379VSvWrh/3vVerU54d3dDd17ykJNNFCzoRcTF4xCLbKRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:46:49.093947Z"},"content_sha256":"04bf5ec8869cdc83518ed9f6d33c570ec8855309e2e8f3e84563bba70b752230","schema_version":"1.0","event_id":"sha256:04bf5ec8869cdc83518ed9f6d33c570ec8855309e2e8f3e84563bba70b752230"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:U3I2J2R6PBQLES34HEOPJKE77A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A cubic refinement of Jackson's Chv\\'atal--Erd\\H{o}s condition for Hamilton cycles in digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiangdong Ai, Yongtang Shi","submitted_at":"2026-06-07T01:31:53Z","abstract_excerpt":"For a digraph $D$, let $\\aTwo(D)$ be the largest size of a vertex set no two of whose vertices lie in a common directed $2$-cycle. Let $f_2(a)$ be the least integer $K$ such that every $K$-connected digraph $D$ with $\\aTwo(D)\\leq a$ has a Hamilton cycle. In 1987, Jackson proved that $f_2(a)\\leq 2^a(a+2)!$ and asked for better bounds, noting that a linear bound might be possible. K\\\"uhn and Osthus later observed that even a polynomial bound would be interesting.\n  In this short note, we prove the polynomial bound $f_2(a)\\leq 2a^3+2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08401","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/2606.08401/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-06-09T01:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQyDQRZCdrgoAKCGuy+yNW/3mSRVft9IgQb6PCeD44OdnovHFxgj27747kTft0xkjggbVZZNo9aZntNQuqnZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:46:49.094343Z"},"content_sha256":"cbec139ebf6c44dfec701a9ad5dfda42fe3bbe964ad24be46be6f259601a7eba","schema_version":"1.0","event_id":"sha256:cbec139ebf6c44dfec701a9ad5dfda42fe3bbe964ad24be46be6f259601a7eba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3I2J2R6PBQLES34HEOPJKE77A/bundle.json","state_url":"https://pith.science/pith/U3I2J2R6PBQLES34HEOPJKE77A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3I2J2R6PBQLES34HEOPJKE77A/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-12T09:46:49Z","links":{"resolver":"https://pith.science/pith/U3I2J2R6PBQLES34HEOPJKE77A","bundle":"https://pith.science/pith/U3I2J2R6PBQLES34HEOPJKE77A/bundle.json","state":"https://pith.science/pith/U3I2J2R6PBQLES34HEOPJKE77A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3I2J2R6PBQLES34HEOPJKE77A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U3I2J2R6PBQLES34HEOPJKE77A","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":"13da1601b501cb822eac21cac7b3261cd32e69e05cc571f3e70a4e9e414423bb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T01:31:53Z","title_canon_sha256":"0da6a8913be4bcbca924c741b3ad6508505babff55c3f8370358267132e63306"},"schema_version":"1.0","source":{"id":"2606.08401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08401","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08401v1","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08401","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"U3I2J2R6PBQL","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"U3I2J2R6PBQLES34","created_at":"2026-06-09T01:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"U3I2J2R6","created_at":"2026-06-09T01:05:35Z"}],"graph_snapshots":[{"event_id":"sha256:cbec139ebf6c44dfec701a9ad5dfda42fe3bbe964ad24be46be6f259601a7eba","target":"graph","created_at":"2026-06-09T01:05:35Z","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/2606.08401/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a digraph $D$, let $\\aTwo(D)$ be the largest size of a vertex set no two of whose vertices lie in a common directed $2$-cycle. Let $f_2(a)$ be the least integer $K$ such that every $K$-connected digraph $D$ with $\\aTwo(D)\\leq a$ has a Hamilton cycle. In 1987, Jackson proved that $f_2(a)\\leq 2^a(a+2)!$ and asked for better bounds, noting that a linear bound might be possible. K\\\"uhn and Osthus later observed that even a polynomial bound would be interesting.\n  In this short note, we prove the polynomial bound $f_2(a)\\leq 2a^3+2$.","authors_text":"Jiangdong Ai, Yongtang Shi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T01:31:53Z","title":"A cubic refinement of Jackson's Chv\\'atal--Erd\\H{o}s condition for Hamilton cycles in digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08401","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:04bf5ec8869cdc83518ed9f6d33c570ec8855309e2e8f3e84563bba70b752230","target":"record","created_at":"2026-06-09T01:05:35Z","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":"13da1601b501cb822eac21cac7b3261cd32e69e05cc571f3e70a4e9e414423bb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-07T01:31:53Z","title_canon_sha256":"0da6a8913be4bcbca924c741b3ad6508505babff55c3f8370358267132e63306"},"schema_version":"1.0","source":{"id":"2606.08401","kind":"arxiv","version":1}},"canonical_sha256":"a6d1a4ea3e7860b24b7c391cf4a89ff80fe94720dab32c6a94e373308ec2c940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6d1a4ea3e7860b24b7c391cf4a89ff80fe94720dab32c6a94e373308ec2c940","first_computed_at":"2026-06-09T01:05:35.685250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:35.685250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWrUCNTRWg18kg4WCDDgxID8+mrCb9rcGOTAutSEmvPEIBZWI5ZaVgLaX7COyxMeV4sHE7Sf/mkWYokrJqNIDw==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:35.685680Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.08401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04bf5ec8869cdc83518ed9f6d33c570ec8855309e2e8f3e84563bba70b752230","sha256:cbec139ebf6c44dfec701a9ad5dfda42fe3bbe964ad24be46be6f259601a7eba"],"state_sha256":"7e4ac8cf787b49136bb7768646d0befd6eeebcda3cf30654cb4f131c26201b3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddXPEzYl93jNlE9CSm0JP6TxY3LS397jPIhnDN+Xhd596w/XsTXoFua6tYBdRp+SbD++36LNRgBnr2ysEYytBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:46:49.096409Z","bundle_sha256":"b05096e1bfc4a9e08db2a9be2a824484d747c3504f71fcbb0ec45c0335f8ebdf"}}