{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Z7OYNDQCC6E6XAA2QWZ5MCQ5QD","short_pith_number":"pith:Z7OYNDQC","canonical_record":{"source":{"id":"2411.17351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T11:53:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1599d1cbafb8781ebb17226baf9979d806cded47242f4fcef58be2ddcb1a2439","abstract_canon_sha256":"1cbfb78a63e0d4ccdf7b9ac27d2b4edffaa6f34ec0f32b44671037ac8e9427c5"},"schema_version":"1.0"},"canonical_sha256":"cfdd868e021789eb801a85b3d60a1d80d8d994dbf9dbf9a78f9f600c9b0a3c85","source":{"kind":"arxiv","id":"2411.17351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17351","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17351v1","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17351","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_12","alias_value":"Z7OYNDQCC6E6","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z7OYNDQCC6E6XAA2","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z7OYNDQC","created_at":"2026-07-05T09:40:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Z7OYNDQCC6E6XAA2QWZ5MCQ5QD","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T11:53:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1599d1cbafb8781ebb17226baf9979d806cded47242f4fcef58be2ddcb1a2439","abstract_canon_sha256":"1cbfb78a63e0d4ccdf7b9ac27d2b4edffaa6f34ec0f32b44671037ac8e9427c5"},"schema_version":"1.0"},"canonical_sha256":"cfdd868e021789eb801a85b3d60a1d80d8d994dbf9dbf9a78f9f600c9b0a3c85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:30.913242Z","signature_b64":"3HiPxWaHGRzy3KdCKtTcjHyK4d80krNhX7prsN1VTkfCSFJ/0JzdBLhcqsSapkbgTp4YYSZkmO0rl4YinO4qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfdd868e021789eb801a85b3d60a1d80d8d994dbf9dbf9a78f9f600c9b0a3c85","last_reissued_at":"2026-07-05T09:40:30.912778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:30.912778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17351","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-05T09:40:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAiUUkhG6b7L6CuzK9ks5EPvPG9yegkn47BCTqW7K5G222lOGMIxpPR5fGrFycCka+k8Iiyg6dsPu4mwFQZzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:18:26.256535Z"},"content_sha256":"073fd6f534377d6dad25d76a9428ab95ccee582b70b9f0e5d04354dbb56ea06f","schema_version":"1.0","event_id":"sha256:073fd6f534377d6dad25d76a9428ab95ccee582b70b9f0e5d04354dbb56ea06f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Z7OYNDQCC6E6XAA2QWZ5MCQ5QD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational methods for finding bi-regular cages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede","submitted_at":"2024-11-26T11:53:11Z","abstract_excerpt":"An $(\\{r,m\\};g)$-graph is a (simple, undirected) graph of girth $g\\geq3$ with vertices of degrees $r$ and $m$ where $2 \\leq r < m$ . Given $r,m,g$, we seek the $(\\{r,m\\};g)$-graphs of minimum order, called $(\\{r,m\\};g)$-cages or bi-regular cages, whose order is denoted by $n(\\{r,m\\};g)$. In this paper, we use computational methods for finding $(\\{r,m\\};g)$-graphs of small order. Firstly, we present an exhaustive generation algorithm, which leads to $\\unicode{x2013}$ previously unknown $\\unicode{x2013}$ exhaustive lists of $(\\{r,m\\};g)$-cages for 24 different triples $(r,m,g)$. This also leads "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17351","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/2411.17351/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-05T09:40:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTHR65yJf9qiYIrL8uKCwDesQui05axPwXhyqdBQqq3ueaC29pd1wfjPt8Db07e2WuLPmVvJKZ6zC7K6aofaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:18:26.257003Z"},"content_sha256":"a8b6fc5916880b437226877c5ffc2aa91498990345b79ad4e4f8f7bddbfb83d2","schema_version":"1.0","event_id":"sha256:a8b6fc5916880b437226877c5ffc2aa91498990345b79ad4e4f8f7bddbfb83d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7OYNDQCC6E6XAA2QWZ5MCQ5QD/bundle.json","state_url":"https://pith.science/pith/Z7OYNDQCC6E6XAA2QWZ5MCQ5QD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7OYNDQCC6E6XAA2QWZ5MCQ5QD/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-12T23:18:26Z","links":{"resolver":"https://pith.science/pith/Z7OYNDQCC6E6XAA2QWZ5MCQ5QD","bundle":"https://pith.science/pith/Z7OYNDQCC6E6XAA2QWZ5MCQ5QD/bundle.json","state":"https://pith.science/pith/Z7OYNDQCC6E6XAA2QWZ5MCQ5QD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7OYNDQCC6E6XAA2QWZ5MCQ5QD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Z7OYNDQCC6E6XAA2QWZ5MCQ5QD","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":"1cbfb78a63e0d4ccdf7b9ac27d2b4edffaa6f34ec0f32b44671037ac8e9427c5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T11:53:11Z","title_canon_sha256":"1599d1cbafb8781ebb17226baf9979d806cded47242f4fcef58be2ddcb1a2439"},"schema_version":"1.0","source":{"id":"2411.17351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17351","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17351v1","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17351","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_12","alias_value":"Z7OYNDQCC6E6","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z7OYNDQCC6E6XAA2","created_at":"2026-07-05T09:40:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z7OYNDQC","created_at":"2026-07-05T09:40:30Z"}],"graph_snapshots":[{"event_id":"sha256:a8b6fc5916880b437226877c5ffc2aa91498990345b79ad4e4f8f7bddbfb83d2","target":"graph","created_at":"2026-07-05T09:40:30Z","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/2411.17351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $(\\{r,m\\};g)$-graph is a (simple, undirected) graph of girth $g\\geq3$ with vertices of degrees $r$ and $m$ where $2 \\leq r < m$ . Given $r,m,g$, we seek the $(\\{r,m\\};g)$-graphs of minimum order, called $(\\{r,m\\};g)$-cages or bi-regular cages, whose order is denoted by $n(\\{r,m\\};g)$. In this paper, we use computational methods for finding $(\\{r,m\\};g)$-graphs of small order. Firstly, we present an exhaustive generation algorithm, which leads to $\\unicode{x2013}$ previously unknown $\\unicode{x2013}$ exhaustive lists of $(\\{r,m\\};g)$-cages for 24 different triples $(r,m,g)$. This also leads ","authors_text":"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":"2024-11-26T11:53:11Z","title":"Computational methods for finding bi-regular cages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17351","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:073fd6f534377d6dad25d76a9428ab95ccee582b70b9f0e5d04354dbb56ea06f","target":"record","created_at":"2026-07-05T09:40:30Z","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":"1cbfb78a63e0d4ccdf7b9ac27d2b4edffaa6f34ec0f32b44671037ac8e9427c5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T11:53:11Z","title_canon_sha256":"1599d1cbafb8781ebb17226baf9979d806cded47242f4fcef58be2ddcb1a2439"},"schema_version":"1.0","source":{"id":"2411.17351","kind":"arxiv","version":1}},"canonical_sha256":"cfdd868e021789eb801a85b3d60a1d80d8d994dbf9dbf9a78f9f600c9b0a3c85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfdd868e021789eb801a85b3d60a1d80d8d994dbf9dbf9a78f9f600c9b0a3c85","first_computed_at":"2026-07-05T09:40:30.912778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:30.912778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3HiPxWaHGRzy3KdCKtTcjHyK4d80krNhX7prsN1VTkfCSFJ/0JzdBLhcqsSapkbgTp4YYSZkmO0rl4YinO4qCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:30.913242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:073fd6f534377d6dad25d76a9428ab95ccee582b70b9f0e5d04354dbb56ea06f","sha256:a8b6fc5916880b437226877c5ffc2aa91498990345b79ad4e4f8f7bddbfb83d2"],"state_sha256":"d3870a2dff868c426d71f2894bab1e2e3ea383c2dc59e3bb640ad22d20c7e158"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxINFXLaxs+nLx5BbG7UoROO8URZBU9CSOktb/kronccKPdGO1/smDe6PuVZIDnlWiHo/AsHIIlFJJpQV+EwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:18:26.276816Z","bundle_sha256":"85ec8035e17f5e1da8166228c1d0f9627c6679222f00607861f62f6ea544f36a"}}