{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RDTB45WRUL62PF7KXLGY734T64","short_pith_number":"pith:RDTB45WR","canonical_record":{"source":{"id":"2508.05562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T16:47:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"10f2e728c6a30c974cf5d3da0b818b1d793905825bbce568824e019447af4c03","abstract_canon_sha256":"f61f97304beaeb78d44a213c1afa44b6a7d0b03c275fd8bf7555c3193fb2b2c0"},"schema_version":"1.0"},"canonical_sha256":"88e61e76d1a2fda797eabacd8fef93f72e36548eef2d6b34fae1e716a044b164","source":{"kind":"arxiv","id":"2508.05562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05562","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05562v1","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05562","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"pith_short_12","alias_value":"RDTB45WRUL62","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"pith_short_16","alias_value":"RDTB45WRUL62PF7K","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"pith_short_8","alias_value":"RDTB45WR","created_at":"2026-07-05T11:50:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RDTB45WRUL62PF7KXLGY734T64","target":"record","payload":{"canonical_record":{"source":{"id":"2508.05562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T16:47:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"10f2e728c6a30c974cf5d3da0b818b1d793905825bbce568824e019447af4c03","abstract_canon_sha256":"f61f97304beaeb78d44a213c1afa44b6a7d0b03c275fd8bf7555c3193fb2b2c0"},"schema_version":"1.0"},"canonical_sha256":"88e61e76d1a2fda797eabacd8fef93f72e36548eef2d6b34fae1e716a044b164","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:21.534224Z","signature_b64":"v8eYSftT9POtHWnM+Mmw0UcKPqx38cOaetRMedTw/Sl1bo6izL3hP2IM0NsC1wgmLNEN9TP4x7j4qBufFbYbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e61e76d1a2fda797eabacd8fef93f72e36548eef2d6b34fae1e716a044b164","last_reissued_at":"2026-07-05T11:50:21.533744Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:21.533744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.05562","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-07-05T11:50:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lm2L6iPUjNcLDb94APZU0C1S4NggEhQLkAXxr7pbWc1uG1A0CEHBgSbjdvZdVlNYoGE7bOTHuV7bY7CnrWZ0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:00:03.224583Z"},"content_sha256":"f57d19b0a6f504bde322985dd730fc8758ad424422e7a82f5d562c46db4c3e6f","schema_version":"1.0","event_id":"sha256:f57d19b0a6f504bde322985dd730fc8758ad424422e7a82f5d562c46db4c3e6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RDTB45WRUL62PF7KXLGY734T64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved lower bounds on the maximum size of graphs with girth 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gwena\\\"el Joret, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede","submitted_at":"2025-08-07T16:47:50Z","abstract_excerpt":"We present a new algorithm for improving lower bounds on $ex(n;\\{C_3,C_4\\})$, the maximum size (number of edges) of an $n$-vertex graph of girth at least 5. The core of our algorithm is a variant of a hill-climbing heuristic introduced by Exoo, McKay, Myrvold and Nadon (2011) to find small cages. Our algorithm considers a range of values of $n$ in multiple passes. In each pass, the hill-climbing heuristic for a specific value of $n$ is initialized with a few graphs obtained by modifying near-extremal graphs previously found for neighboring values of $n$, allowing to `propagate' good patterns t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05562","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/2508.05562/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-07-05T11:50:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JEC+QratCeNuRcUNh3ty8e2DbCvwzoar8638VOQcNpMcQGZJV2zs5CWfPFngS0dUidh5UDDPNxxhY6KVXLDEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T22:00:03.225221Z"},"content_sha256":"cc5cef7f6eb59d39de54853d3c4a5846858b96f1f353d54bc214c9d706d03e7c","schema_version":"1.0","event_id":"sha256:cc5cef7f6eb59d39de54853d3c4a5846858b96f1f353d54bc214c9d706d03e7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDTB45WRUL62PF7KXLGY734T64/bundle.json","state_url":"https://pith.science/pith/RDTB45WRUL62PF7KXLGY734T64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDTB45WRUL62PF7KXLGY734T64/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-08-19T22:00:03Z","links":{"resolver":"https://pith.science/pith/RDTB45WRUL62PF7KXLGY734T64","bundle":"https://pith.science/pith/RDTB45WRUL62PF7KXLGY734T64/bundle.json","state":"https://pith.science/pith/RDTB45WRUL62PF7KXLGY734T64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDTB45WRUL62PF7KXLGY734T64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RDTB45WRUL62PF7KXLGY734T64","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":"f61f97304beaeb78d44a213c1afa44b6a7d0b03c275fd8bf7555c3193fb2b2c0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T16:47:50Z","title_canon_sha256":"10f2e728c6a30c974cf5d3da0b818b1d793905825bbce568824e019447af4c03"},"schema_version":"1.0","source":{"id":"2508.05562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05562","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05562v1","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05562","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"pith_short_12","alias_value":"RDTB45WRUL62","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"pith_short_16","alias_value":"RDTB45WRUL62PF7K","created_at":"2026-07-05T11:50:21Z"},{"alias_kind":"pith_short_8","alias_value":"RDTB45WR","created_at":"2026-07-05T11:50:21Z"}],"graph_snapshots":[{"event_id":"sha256:cc5cef7f6eb59d39de54853d3c4a5846858b96f1f353d54bc214c9d706d03e7c","target":"graph","created_at":"2026-07-05T11:50:21Z","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/2508.05562/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new algorithm for improving lower bounds on $ex(n;\\{C_3,C_4\\})$, the maximum size (number of edges) of an $n$-vertex graph of girth at least 5. The core of our algorithm is a variant of a hill-climbing heuristic introduced by Exoo, McKay, Myrvold and Nadon (2011) to find small cages. Our algorithm considers a range of values of $n$ in multiple passes. In each pass, the hill-climbing heuristic for a specific value of $n$ is initialized with a few graphs obtained by modifying near-extremal graphs previously found for neighboring values of $n$, allowing to `propagate' good patterns t","authors_text":"Gwena\\\"el Joret, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T16:47:50Z","title":"Improved lower bounds on the maximum size of graphs with girth 5"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05562","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:f57d19b0a6f504bde322985dd730fc8758ad424422e7a82f5d562c46db4c3e6f","target":"record","created_at":"2026-07-05T11:50:21Z","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":"f61f97304beaeb78d44a213c1afa44b6a7d0b03c275fd8bf7555c3193fb2b2c0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-07T16:47:50Z","title_canon_sha256":"10f2e728c6a30c974cf5d3da0b818b1d793905825bbce568824e019447af4c03"},"schema_version":"1.0","source":{"id":"2508.05562","kind":"arxiv","version":1}},"canonical_sha256":"88e61e76d1a2fda797eabacd8fef93f72e36548eef2d6b34fae1e716a044b164","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e61e76d1a2fda797eabacd8fef93f72e36548eef2d6b34fae1e716a044b164","first_computed_at":"2026-07-05T11:50:21.533744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:50:21.533744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v8eYSftT9POtHWnM+Mmw0UcKPqx38cOaetRMedTw/Sl1bo6izL3hP2IM0NsC1wgmLNEN9TP4x7j4qBufFbYbDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:50:21.534224Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.05562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f57d19b0a6f504bde322985dd730fc8758ad424422e7a82f5d562c46db4c3e6f","sha256:cc5cef7f6eb59d39de54853d3c4a5846858b96f1f353d54bc214c9d706d03e7c"],"state_sha256":"82d665bfae8329bc3e23212563c47bb6adee088c9d51a200e7af6137e00f5189"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Hwjy0Z9hHl2QR8OPZh3wpclxUlljdYAwztXKCPOpkdm0NMcDW4Zs8pePlqHfLhSxQnZtl1hiE8hFracPvfEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T22:00:03.229600Z","bundle_sha256":"012762ab40b22eaf952de6a7fd7ae7515eb81742d68c2226f5c5ca8c0e28877a"}}