{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LY7QHBJBVCYVGWRDZJJ64CVR5X","short_pith_number":"pith:LY7QHBJB","canonical_record":{"source":{"id":"1408.5289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-22T13:13:10Z","cross_cats_sorted":[],"title_canon_sha256":"ee8597ae921f6212c59c54d7d99c592cc0391090daa363b7fad183fe0babc9e8","abstract_canon_sha256":"ff456d86a06e2d76e2948f2c783be901c76107e720f92ccb97dfaf59fa8b17e3"},"schema_version":"1.0"},"canonical_sha256":"5e3f038521a8b1535a23ca53ee0ab1edd3ceb86fa891d83eb8aaf362ce83e477","source":{"kind":"arxiv","id":"1408.5289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5289","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5289v1","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5289","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"LY7QHBJBVCYV","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LY7QHBJBVCYVGWRD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LY7QHBJB","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LY7QHBJBVCYVGWRDZJJ64CVR5X","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-22T13:13:10Z","cross_cats_sorted":[],"title_canon_sha256":"ee8597ae921f6212c59c54d7d99c592cc0391090daa363b7fad183fe0babc9e8","abstract_canon_sha256":"ff456d86a06e2d76e2948f2c783be901c76107e720f92ccb97dfaf59fa8b17e3"},"schema_version":"1.0"},"canonical_sha256":"5e3f038521a8b1535a23ca53ee0ab1edd3ceb86fa891d83eb8aaf362ce83e477","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.449465Z","signature_b64":"gfbHJHRkGlNVArR3W8WlQwn1RfvWTxYJQkAvP4KUo5dcCLYrQJEKk20ieaAbAmIOeqeY52zv0CkqzFMsUbZSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e3f038521a8b1535a23ca53ee0ab1edd3ceb86fa891d83eb8aaf362ce83e477","last_reissued_at":"2026-05-18T02:44:33.448867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.448867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5289","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-18T02:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BbX1QJRO8B9QlrESHKRFuVu8Jkk1kJ29i9VZq3jBI6u2FtKp9b4YP8fXBVPyBZnlcit2wfKgvSabG2qlTmBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:03:05.598822Z"},"content_sha256":"fa82a93fbf20c8a9ee6276bac2313dadc023f34e68ef967c00902e7fdf2a2e23","schema_version":"1.0","event_id":"sha256:fa82a93fbf20c8a9ee6276bac2313dadc023f34e68ef967c00902e7fdf2a2e23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LY7QHBJBVCYVGWRDZJJ64CVR5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs without proper subgraphs of minimum degree 3 and short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Lothar Narins, Tibor Szab\\'o","submitted_at":"2014-08-22T13:13:10Z","abstract_excerpt":"We study graphs on $n$ vertices which have $2n-2$ edges and no proper induced subgraphs of minimum degree $3$. Erd\\H{o}s, Faudree, Gy\\'arf\\'as, and Schelp conjectured that such graphs always have cycles of lengths $3,4,5,\\dots, C(n)$ for some function $C(n)$ tending to infinity. We disprove this conjecture, resolve a related problem about leaf-to-leaf path lengths in trees, and characterize graphs with $n$ vertices and $2n-2$ edges, containing no proper subgraph of minimum degree $3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5289","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-18T02:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcH0x/X7LdcuA65FL1SSxQhDFNucgWOybZgPjPsCS6vZ0W8zOFX1F3qgUwfpn13o85qQw6UgJo6KUobJG+LwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:03:05.599217Z"},"content_sha256":"1cbab40bdbec1e267bcd2fda509d1b1cec0b6306bffef112ea9d2599af496f43","schema_version":"1.0","event_id":"sha256:1cbab40bdbec1e267bcd2fda509d1b1cec0b6306bffef112ea9d2599af496f43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LY7QHBJBVCYVGWRDZJJ64CVR5X/bundle.json","state_url":"https://pith.science/pith/LY7QHBJBVCYVGWRDZJJ64CVR5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LY7QHBJBVCYVGWRDZJJ64CVR5X/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-20T21:03:05Z","links":{"resolver":"https://pith.science/pith/LY7QHBJBVCYVGWRDZJJ64CVR5X","bundle":"https://pith.science/pith/LY7QHBJBVCYVGWRDZJJ64CVR5X/bundle.json","state":"https://pith.science/pith/LY7QHBJBVCYVGWRDZJJ64CVR5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LY7QHBJBVCYVGWRDZJJ64CVR5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LY7QHBJBVCYVGWRDZJJ64CVR5X","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":"ff456d86a06e2d76e2948f2c783be901c76107e720f92ccb97dfaf59fa8b17e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-22T13:13:10Z","title_canon_sha256":"ee8597ae921f6212c59c54d7d99c592cc0391090daa363b7fad183fe0babc9e8"},"schema_version":"1.0","source":{"id":"1408.5289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5289","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5289v1","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5289","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"LY7QHBJBVCYV","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LY7QHBJBVCYVGWRD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LY7QHBJB","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:1cbab40bdbec1e267bcd2fda509d1b1cec0b6306bffef112ea9d2599af496f43","target":"graph","created_at":"2026-05-18T02:44:33Z","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":"We study graphs on $n$ vertices which have $2n-2$ edges and no proper induced subgraphs of minimum degree $3$. Erd\\H{o}s, Faudree, Gy\\'arf\\'as, and Schelp conjectured that such graphs always have cycles of lengths $3,4,5,\\dots, C(n)$ for some function $C(n)$ tending to infinity. We disprove this conjecture, resolve a related problem about leaf-to-leaf path lengths in trees, and characterize graphs with $n$ vertices and $2n-2$ edges, containing no proper subgraph of minimum degree $3$.","authors_text":"Alexey Pokrovskiy, Lothar Narins, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-22T13:13:10Z","title":"Graphs without proper subgraphs of minimum degree 3 and short cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5289","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:fa82a93fbf20c8a9ee6276bac2313dadc023f34e68ef967c00902e7fdf2a2e23","target":"record","created_at":"2026-05-18T02:44:33Z","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":"ff456d86a06e2d76e2948f2c783be901c76107e720f92ccb97dfaf59fa8b17e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-22T13:13:10Z","title_canon_sha256":"ee8597ae921f6212c59c54d7d99c592cc0391090daa363b7fad183fe0babc9e8"},"schema_version":"1.0","source":{"id":"1408.5289","kind":"arxiv","version":1}},"canonical_sha256":"5e3f038521a8b1535a23ca53ee0ab1edd3ceb86fa891d83eb8aaf362ce83e477","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e3f038521a8b1535a23ca53ee0ab1edd3ceb86fa891d83eb8aaf362ce83e477","first_computed_at":"2026-05-18T02:44:33.448867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:33.448867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gfbHJHRkGlNVArR3W8WlQwn1RfvWTxYJQkAvP4KUo5dcCLYrQJEKk20ieaAbAmIOeqeY52zv0CkqzFMsUbZSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:33.449465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa82a93fbf20c8a9ee6276bac2313dadc023f34e68ef967c00902e7fdf2a2e23","sha256:1cbab40bdbec1e267bcd2fda509d1b1cec0b6306bffef112ea9d2599af496f43"],"state_sha256":"7b6a2e428f686f5010ed29d457e335d93097ad45727acd9d550a0f0ae7d83e24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cviFnqyHTE+Aqi5lTsFOnCg1ZG1BVJldQB8fPUyfDZonviC5xCZNnkMeWGe2I8kuzgd4GlR24ZYGRs8+rQWHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T21:03:05.601424Z","bundle_sha256":"608da19d97ab92026b2450fb1eb2f2f65c14ffab8177bdd2dccd2357be8991ed"}}