{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DHNISXQ2HH2FHZNDGHZRQL7BMB","short_pith_number":"pith:DHNISXQ2","canonical_record":{"source":{"id":"1602.03904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T21:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"c1404f6c37299647fc0412ec80e0982b63c6f2d904b240f27da881363957b697","abstract_canon_sha256":"7f84f303a686c1a4af87696e03599a01b4fb5cf874c77100e4cf6326645981be"},"schema_version":"1.0"},"canonical_sha256":"19da895e1a39f453e5a331f3182fe16055c55c35d43600b2441417d9dc996174","source":{"kind":"arxiv","id":"1602.03904","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03904","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03904v2","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03904","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"DHNISXQ2HH2F","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DHNISXQ2HH2FHZND","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DHNISXQ2","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DHNISXQ2HH2FHZNDGHZRQL7BMB","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T21:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"c1404f6c37299647fc0412ec80e0982b63c6f2d904b240f27da881363957b697","abstract_canon_sha256":"7f84f303a686c1a4af87696e03599a01b4fb5cf874c77100e4cf6326645981be"},"schema_version":"1.0"},"canonical_sha256":"19da895e1a39f453e5a331f3182fe16055c55c35d43600b2441417d9dc996174","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:10.898735Z","signature_b64":"RjRdjuWLfOvR6y3EeC8AS4/3n4xaRomB7S9X7bfEVEustSDjF74D/a/MkBzbANRHBXiGl2+d+4CgGJzKe3/MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19da895e1a39f453e5a331f3182fe16055c55c35d43600b2441417d9dc996174","last_reissued_at":"2026-05-18T01:19:10.898123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:10.898123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03904","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-18T01:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0PSZZV3VlMPuQguJ+jtIJJ8fIM7LXsf8IBbnAaXcZifbBaL3hzj6idn/zfG8IiooGwJXUQjGXK27JlzN9tJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:55:47.358502Z"},"content_sha256":"ce6f95d759e050bcf8a22096b99db6625d3536259692d7daf3be5f7e53c424f0","schema_version":"1.0","event_id":"sha256:ce6f95d759e050bcf8a22096b99db6625d3536259692d7daf3be5f7e53c424f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DHNISXQ2HH2FHZNDGHZRQL7BMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the structure of graphs with given odd girth and large minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mathias Schacht, Silvia Messuti","submitted_at":"2016-02-11T21:27:16Z","abstract_excerpt":"We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andr\\'asfai, Erd\\H os, and S\\'os implies that every $n$-vertex graph with odd girth $2k+1$ and minimum degree bigger than $\\frac{2}{2k+1}n$ must be bipartite. We consider graphs with a weaker condition on the minimum degree. Generalizing results of H\\\"aggkvist and of H\\\"aggkvist and Jin for the cases $k=2$ and $3$, we show that every $n$-vertex graph with odd girth $2k+1$ and minimum degree bigger than $\\frac{3}{4k}n$ is homomorphic to the cycle of length $2k+1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03904","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-18T01:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyAhX4EPeI+/1Ytybvg8acu3IJzvLRG0u27j1jvsQrBjqXQKK8RJ/BOUt1g7U4FxfT5qM8IX839/K8WJVNTnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:55:47.359240Z"},"content_sha256":"42bf338100456691660a7dc09d2ed780863fbef73daec17ef8c1f55b4d6ee2f0","schema_version":"1.0","event_id":"sha256:42bf338100456691660a7dc09d2ed780863fbef73daec17ef8c1f55b4d6ee2f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/bundle.json","state_url":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/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-27T09:55:47Z","links":{"resolver":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB","bundle":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/bundle.json","state":"https://pith.science/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DHNISXQ2HH2FHZNDGHZRQL7BMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DHNISXQ2HH2FHZNDGHZRQL7BMB","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":"7f84f303a686c1a4af87696e03599a01b4fb5cf874c77100e4cf6326645981be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T21:27:16Z","title_canon_sha256":"c1404f6c37299647fc0412ec80e0982b63c6f2d904b240f27da881363957b697"},"schema_version":"1.0","source":{"id":"1602.03904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03904","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03904v2","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03904","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"DHNISXQ2HH2F","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DHNISXQ2HH2FHZND","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DHNISXQ2","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:42bf338100456691660a7dc09d2ed780863fbef73daec17ef8c1f55b4d6ee2f0","target":"graph","created_at":"2026-05-18T01:19:10Z","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 minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andr\\'asfai, Erd\\H os, and S\\'os implies that every $n$-vertex graph with odd girth $2k+1$ and minimum degree bigger than $\\frac{2}{2k+1}n$ must be bipartite. We consider graphs with a weaker condition on the minimum degree. Generalizing results of H\\\"aggkvist and of H\\\"aggkvist and Jin for the cases $k=2$ and $3$, we show that every $n$-vertex graph with odd girth $2k+1$ and minimum degree bigger than $\\frac{3}{4k}n$ is homomorphic to the cycle of length $2k+1$.","authors_text":"Mathias Schacht, Silvia Messuti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T21:27:16Z","title":"On the structure of graphs with given odd girth and large minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03904","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:ce6f95d759e050bcf8a22096b99db6625d3536259692d7daf3be5f7e53c424f0","target":"record","created_at":"2026-05-18T01:19:10Z","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":"7f84f303a686c1a4af87696e03599a01b4fb5cf874c77100e4cf6326645981be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T21:27:16Z","title_canon_sha256":"c1404f6c37299647fc0412ec80e0982b63c6f2d904b240f27da881363957b697"},"schema_version":"1.0","source":{"id":"1602.03904","kind":"arxiv","version":2}},"canonical_sha256":"19da895e1a39f453e5a331f3182fe16055c55c35d43600b2441417d9dc996174","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19da895e1a39f453e5a331f3182fe16055c55c35d43600b2441417d9dc996174","first_computed_at":"2026-05-18T01:19:10.898123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:10.898123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RjRdjuWLfOvR6y3EeC8AS4/3n4xaRomB7S9X7bfEVEustSDjF74D/a/MkBzbANRHBXiGl2+d+4CgGJzKe3/MAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:10.898735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce6f95d759e050bcf8a22096b99db6625d3536259692d7daf3be5f7e53c424f0","sha256:42bf338100456691660a7dc09d2ed780863fbef73daec17ef8c1f55b4d6ee2f0"],"state_sha256":"78758be6610939141c388d75cfc7e93d519b05bcac328b16183967ca3a17e610"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iO50lpv/18gCWdQ+xmp0tq93lmV3tF+jH3dj5QzHYIKiFyArZ4ZSXIqTd9yg4s9aMZ25SPqk+lY69/mDlRyhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:55:47.362877Z","bundle_sha256":"91d589d5022d02d0c793850b45ba8a66e94b5312c8ed1c973bd11d059c647aa7"}}