{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FTLG7HGHKG7AYWKMGCYCZU6EPL","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":"d09674eae42d628ec1d4b9c04751a7e16f68dd75340ffe46e88894300c81ac68","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-16T10:49:36Z","title_canon_sha256":"3bee0c37a28d7e764f2b36a8ac87ba8ec7c13a695ea4e4e2f92c9ad5d70e957e"},"schema_version":"1.0","source":{"id":"2401.08271","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.08271","created_at":"2026-07-05T08:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"2401.08271v2","created_at":"2026-07-05T08:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08271","created_at":"2026-07-05T08:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"FTLG7HGHKG7A","created_at":"2026-07-05T08:36:21Z"},{"alias_kind":"pith_short_16","alias_value":"FTLG7HGHKG7AYWKM","created_at":"2026-07-05T08:36:21Z"},{"alias_kind":"pith_short_8","alias_value":"FTLG7HGH","created_at":"2026-07-05T08:36:21Z"}],"graph_snapshots":[{"event_id":"sha256:febfa9abc0acf6897d57332ca3eb223f2c331641410063ab9eca62a83810b054","target":"graph","created_at":"2026-07-05T08:36: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/2401.08271/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Edge-girth-regular graphs (abbreviated as $egr$ graphs) are a class of highly regular graphs. More specifically, for integers $v$, $k$, $g$ and $\\lambda$ an $egr(v,k,g,\\lambda)$ graph is a $k$-regular graph with girth $g$ on $v$ vertices such that every edge is contained in exactly $\\lambda$ cycles of length $g$. The central problem in this paper is determining $n(k,g,\\lambda)$, which is defined as the smallest integer $v$ such that an $egr(v,k,g,\\lambda)$ graph exists (or $\\infty$ if no such graph exists) as well as determining the corresponding extremal graphs. We propose a linear time algor","authors_text":"Jan Goedgebeur, Jorik Jooken","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-16T10:49:36Z","title":"Exhaustive generation of edge-girth-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08271","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:803f66b875d185813ec89ebd4359f6d014f4aeb937bf98d74f260447622b74b6","target":"record","created_at":"2026-07-05T08:36: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":"d09674eae42d628ec1d4b9c04751a7e16f68dd75340ffe46e88894300c81ac68","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-16T10:49:36Z","title_canon_sha256":"3bee0c37a28d7e764f2b36a8ac87ba8ec7c13a695ea4e4e2f92c9ad5d70e957e"},"schema_version":"1.0","source":{"id":"2401.08271","kind":"arxiv","version":2}},"canonical_sha256":"2cd66f9cc751be0c594c30b02cd3c47ac1f290b4b394ad0477d27a6e30acfcaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cd66f9cc751be0c594c30b02cd3c47ac1f290b4b394ad0477d27a6e30acfcaa","first_computed_at":"2026-07-05T08:36:21.683283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:36:21.683283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lMgYclx5ctWUvqwdXshzwqtSVKfiTJdCA+K74lIcsSJ6vohr0hY1DFfHuh7FeNAlnzLbKu/cYQz0QYHNYdz3CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:36:21.683816Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.08271","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:803f66b875d185813ec89ebd4359f6d014f4aeb937bf98d74f260447622b74b6","sha256:febfa9abc0acf6897d57332ca3eb223f2c331641410063ab9eca62a83810b054"],"state_sha256":"c849d50b934c68d2999659d1d12e37ce612b505061022936cfac0e1fa7d10a6d"}