{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FDJB4B2PV4JR6U5R2GPAPWXOB2","short_pith_number":"pith:FDJB4B2P","canonical_record":{"source":{"id":"1609.08730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-28T02:07:12Z","cross_cats_sorted":[],"title_canon_sha256":"631237d62843db8fc50d51501ad74a7194ac9948e61120b822a18e5b7788597a","abstract_canon_sha256":"65ccf55b2df188870672b96c1cf8fc584d6e9a6c08dff49f3f26ec50b048f9f2"},"schema_version":"1.0"},"canonical_sha256":"28d21e074faf131f53b1d19e07daee0e91e73723aaffd09f32920840c83bf010","source":{"kind":"arxiv","id":"1609.08730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08730","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08730v1","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08730","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"FDJB4B2PV4JR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FDJB4B2PV4JR6U5R","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FDJB4B2P","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FDJB4B2PV4JR6U5R2GPAPWXOB2","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-28T02:07:12Z","cross_cats_sorted":[],"title_canon_sha256":"631237d62843db8fc50d51501ad74a7194ac9948e61120b822a18e5b7788597a","abstract_canon_sha256":"65ccf55b2df188870672b96c1cf8fc584d6e9a6c08dff49f3f26ec50b048f9f2"},"schema_version":"1.0"},"canonical_sha256":"28d21e074faf131f53b1d19e07daee0e91e73723aaffd09f32920840c83bf010","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:42.081879Z","signature_b64":"AkqABoxjQZ6n/z2HDW7RmCNCoA57fzrZzE6GZWBMFEKQDhQ7WHHogkYQIIZAr6x2JKLp+ROpRUiPswPppbCCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d21e074faf131f53b1d19e07daee0e91e73723aaffd09f32920840c83bf010","last_reissued_at":"2026-05-18T01:03:42.081276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:42.081276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08730","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-05-18T01:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dzcnoPq0ytSN7mLRou9Qp9yDshB9jeEcRA953M+HtokVXBwfm+MBrLEKlRWTHWUJ1kZvkyJFV/j8qTbvQy/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:44:34.457101Z"},"content_sha256":"d44f54c2ebcea94ad2af024a2ab41932a6f75d72096ce7cdf3ab875936e63d39","schema_version":"1.0","event_id":"sha256:d44f54c2ebcea94ad2af024a2ab41932a6f75d72096ce7cdf3ab875936e63d39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FDJB4B2PV4JR6U5R2GPAPWXOB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning trails with maximum degree at most 4 in $2K_2$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akira Saito, Guantao Chen, M. N. Ellingham, Songling Shan","submitted_at":"2016-09-28T02:07:12Z","abstract_excerpt":"A graph is called $2K_2$-free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every $\\frac{3}{2}$-tough $2K_2$-free graph with at least three vertices has a spanning trail with maximum degree at most $4$. In this paper, we confirm this conjecture. We also provide examples for all $t < \\frac{5}{4}$ of $t$-tough graphs that do not have a spanning trail with maximum degree at most $4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08730","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":""},"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-18T01:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6V8ztzxJ46tq2/4jfjrTIzkyg98ZcauymBBCDe3zBs9hgR1DawIqKmv/mRQwtagCllwud2rDX6ZgeTda7ipNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:44:34.457812Z"},"content_sha256":"22d469d1a08a6b86ea9d2069ff8376e498c0da951a91a95fc4ad62d131cfc041","schema_version":"1.0","event_id":"sha256:22d469d1a08a6b86ea9d2069ff8376e498c0da951a91a95fc4ad62d131cfc041"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDJB4B2PV4JR6U5R2GPAPWXOB2/bundle.json","state_url":"https://pith.science/pith/FDJB4B2PV4JR6U5R2GPAPWXOB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDJB4B2PV4JR6U5R2GPAPWXOB2/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:44:34Z","links":{"resolver":"https://pith.science/pith/FDJB4B2PV4JR6U5R2GPAPWXOB2","bundle":"https://pith.science/pith/FDJB4B2PV4JR6U5R2GPAPWXOB2/bundle.json","state":"https://pith.science/pith/FDJB4B2PV4JR6U5R2GPAPWXOB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDJB4B2PV4JR6U5R2GPAPWXOB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FDJB4B2PV4JR6U5R2GPAPWXOB2","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":"65ccf55b2df188870672b96c1cf8fc584d6e9a6c08dff49f3f26ec50b048f9f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-28T02:07:12Z","title_canon_sha256":"631237d62843db8fc50d51501ad74a7194ac9948e61120b822a18e5b7788597a"},"schema_version":"1.0","source":{"id":"1609.08730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08730","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08730v1","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08730","created_at":"2026-05-18T01:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"FDJB4B2PV4JR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FDJB4B2PV4JR6U5R","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FDJB4B2P","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:22d469d1a08a6b86ea9d2069ff8376e498c0da951a91a95fc4ad62d131cfc041","target":"graph","created_at":"2026-05-18T01:03:42Z","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":"A graph is called $2K_2$-free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every $\\frac{3}{2}$-tough $2K_2$-free graph with at least three vertices has a spanning trail with maximum degree at most $4$. In this paper, we confirm this conjecture. We also provide examples for all $t < \\frac{5}{4}$ of $t$-tough graphs that do not have a spanning trail with maximum degree at most $4$.","authors_text":"Akira Saito, Guantao Chen, M. N. Ellingham, Songling Shan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-28T02:07:12Z","title":"Spanning trails with maximum degree at most 4 in $2K_2$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08730","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:d44f54c2ebcea94ad2af024a2ab41932a6f75d72096ce7cdf3ab875936e63d39","target":"record","created_at":"2026-05-18T01:03:42Z","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":"65ccf55b2df188870672b96c1cf8fc584d6e9a6c08dff49f3f26ec50b048f9f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-28T02:07:12Z","title_canon_sha256":"631237d62843db8fc50d51501ad74a7194ac9948e61120b822a18e5b7788597a"},"schema_version":"1.0","source":{"id":"1609.08730","kind":"arxiv","version":1}},"canonical_sha256":"28d21e074faf131f53b1d19e07daee0e91e73723aaffd09f32920840c83bf010","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28d21e074faf131f53b1d19e07daee0e91e73723aaffd09f32920840c83bf010","first_computed_at":"2026-05-18T01:03:42.081276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:42.081276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AkqABoxjQZ6n/z2HDW7RmCNCoA57fzrZzE6GZWBMFEKQDhQ7WHHogkYQIIZAr6x2JKLp+ROpRUiPswPppbCCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:42.081879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d44f54c2ebcea94ad2af024a2ab41932a6f75d72096ce7cdf3ab875936e63d39","sha256:22d469d1a08a6b86ea9d2069ff8376e498c0da951a91a95fc4ad62d131cfc041"],"state_sha256":"a940e5c032018f01b1e4e3cdb0d6ea2d2a3afbaab99c12ec9f087a768392ccde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOzTcJw5EsEElEmYxDqZZ5eq8gPteOx3SW9aO1sMUG+pSqGEo7Al8tVOBBsA2k2NE7GITXDXPIm5rCdCHgg/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:44:34.461844Z","bundle_sha256":"950c7e47d450022206dfb1d4ab94cbdd2a2a9a68ef9594bd83b9a7b1c45f5b3f"}}