{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OOWCJ3W7J4MYORT6UKCE6ME76T","short_pith_number":"pith:OOWCJ3W7","canonical_record":{"source":{"id":"1505.06181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-22T19:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"735d9a7d947d9801054fb6030ed133ddd5da749585de58b863c38a0a5c1d2a56","abstract_canon_sha256":"1dd3e7c82214e8868b97292dbd2fc4d800bb14adf6194f6aaba450840882bcb8"},"schema_version":"1.0"},"canonical_sha256":"73ac24eedf4f1987467ea2844f309ff4edbe4bd93d517fe659aca23a0c86bdca","source":{"kind":"arxiv","id":"1505.06181","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06181","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06181v2","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06181","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"OOWCJ3W7J4MY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOWCJ3W7J4MYORT6","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOWCJ3W7","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OOWCJ3W7J4MYORT6UKCE6ME76T","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-22T19:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"735d9a7d947d9801054fb6030ed133ddd5da749585de58b863c38a0a5c1d2a56","abstract_canon_sha256":"1dd3e7c82214e8868b97292dbd2fc4d800bb14adf6194f6aaba450840882bcb8"},"schema_version":"1.0"},"canonical_sha256":"73ac24eedf4f1987467ea2844f309ff4edbe4bd93d517fe659aca23a0c86bdca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:17.608055Z","signature_b64":"4JFYi/o/R4aftfiTCyfM/OLLazEaAk0nXm+SfHqibEx/K740G4RVkjL6n93t9A9GmselHVq68so7SEH3ImKbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73ac24eedf4f1987467ea2844f309ff4edbe4bd93d517fe659aca23a0c86bdca","last_reissued_at":"2026-05-18T00:40:17.607404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:17.607404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06181","source_version":2,"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:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2k0dg0PrFI/wep9VERSuw6cM8AaHG4xix6WOjzPgxMoI/3WxsibLZlxrITv74cMJSUFN9BQFSmbOK6yWWwSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:47:38.647387Z"},"content_sha256":"1be05e76f5e87e45843efe7cbf5957d37808abd35df8c2f5377eb847eaadc7c8","schema_version":"1.0","event_id":"sha256:1be05e76f5e87e45843efe7cbf5957d37808abd35df8c2f5377eb847eaadc7c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OOWCJ3W7J4MYORT6UKCE6ME76T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dirac's Condition for Spanning Halin Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guantao Chen, Songling Shan","submitted_at":"2015-05-22T19:08:36Z","abstract_excerpt":"Let $G$ be an $n$-vertex graph with $n\\ge 3$. A classic result of Dirac from 1952 asserts that $G$ is hamiltonian if $\\delta(G)\\ge n/2$. Dirac's theorem is one of the most influential results in the study of hamiltonicity and by now there are many related known results\\,(see, e.g., J. A. Bondy, Basic Graph Theory: Paths and Circuits, Chapter 1 in: {\\it Handbook of Combinatorics Vol.1}). A {\\it Halin graph} is a planar graph consisting of two edge-disjoint subgraphs: a spanning tree of at least 4 vertices and with no vertex of degree 2, and a cycle induced on the set of the leaves of the spanni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06181","kind":"arxiv","version":2},"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:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+KfUTvZRMBpmMxxRtAnpvFFofARRBuL44AZYlPRUI07khfZ+6K/qfX202DonDtRjYuZb88BaVbJfeTN+78kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:47:38.647979Z"},"content_sha256":"9b6522d7396ab6b70d2a6a03ab2629ef418f7c62633c5d00b179473eb3c3805f","schema_version":"1.0","event_id":"sha256:9b6522d7396ab6b70d2a6a03ab2629ef418f7c62633c5d00b179473eb3c3805f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/bundle.json","state_url":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/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-05-24T17:47:38Z","links":{"resolver":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T","bundle":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/bundle.json","state":"https://pith.science/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOWCJ3W7J4MYORT6UKCE6ME76T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OOWCJ3W7J4MYORT6UKCE6ME76T","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":"1dd3e7c82214e8868b97292dbd2fc4d800bb14adf6194f6aaba450840882bcb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-22T19:08:36Z","title_canon_sha256":"735d9a7d947d9801054fb6030ed133ddd5da749585de58b863c38a0a5c1d2a56"},"schema_version":"1.0","source":{"id":"1505.06181","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06181","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06181v2","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06181","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"OOWCJ3W7J4MY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOWCJ3W7J4MYORT6","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOWCJ3W7","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:9b6522d7396ab6b70d2a6a03ab2629ef418f7c62633c5d00b179473eb3c3805f","target":"graph","created_at":"2026-05-18T00:40:17Z","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":"Let $G$ be an $n$-vertex graph with $n\\ge 3$. A classic result of Dirac from 1952 asserts that $G$ is hamiltonian if $\\delta(G)\\ge n/2$. Dirac's theorem is one of the most influential results in the study of hamiltonicity and by now there are many related known results\\,(see, e.g., J. A. Bondy, Basic Graph Theory: Paths and Circuits, Chapter 1 in: {\\it Handbook of Combinatorics Vol.1}). A {\\it Halin graph} is a planar graph consisting of two edge-disjoint subgraphs: a spanning tree of at least 4 vertices and with no vertex of degree 2, and a cycle induced on the set of the leaves of the spanni","authors_text":"Guantao Chen, Songling Shan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-22T19:08:36Z","title":"Dirac's Condition for Spanning Halin Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06181","kind":"arxiv","version":2},"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:1be05e76f5e87e45843efe7cbf5957d37808abd35df8c2f5377eb847eaadc7c8","target":"record","created_at":"2026-05-18T00:40:17Z","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":"1dd3e7c82214e8868b97292dbd2fc4d800bb14adf6194f6aaba450840882bcb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-22T19:08:36Z","title_canon_sha256":"735d9a7d947d9801054fb6030ed133ddd5da749585de58b863c38a0a5c1d2a56"},"schema_version":"1.0","source":{"id":"1505.06181","kind":"arxiv","version":2}},"canonical_sha256":"73ac24eedf4f1987467ea2844f309ff4edbe4bd93d517fe659aca23a0c86bdca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73ac24eedf4f1987467ea2844f309ff4edbe4bd93d517fe659aca23a0c86bdca","first_computed_at":"2026-05-18T00:40:17.607404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:17.607404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4JFYi/o/R4aftfiTCyfM/OLLazEaAk0nXm+SfHqibEx/K740G4RVkjL6n93t9A9GmselHVq68so7SEH3ImKbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:17.608055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06181","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1be05e76f5e87e45843efe7cbf5957d37808abd35df8c2f5377eb847eaadc7c8","sha256:9b6522d7396ab6b70d2a6a03ab2629ef418f7c62633c5d00b179473eb3c3805f"],"state_sha256":"0183b4fba99f90cca7bb8ed45794426243d4a8e49b625286c2f6a1050a175885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqJl6re1R9o+9XYdamwqgZrHJbWQgtntFlykvFjMQaj2SUmbI5XSUumTYuWroEs+ysXVX7cNAOQ8JXyNlExwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:47:38.652809Z","bundle_sha256":"84937623b919c347a1d0aea0106b787797bf955433619c94b1b066dab8464bef"}}