{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AQ3XKOY353BBXFZVWLZPQGJKT3","short_pith_number":"pith:AQ3XKOY3","canonical_record":{"source":{"id":"1708.01095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T11:04:22Z","cross_cats_sorted":[],"title_canon_sha256":"1fffef5c4095ff31e668b2a63e29b4e7b908c8d471255d0dd2dc20a94781d47e","abstract_canon_sha256":"d812c3367048b330a8f5ddb1646cdb1618790144ca7f20d43dfa9c907b5577c0"},"schema_version":"1.0"},"canonical_sha256":"0437753b1beec21b9735b2f2f8192a9ecbc702444c48701652abd76d6e903716","source":{"kind":"arxiv","id":"1708.01095","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01095","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01095v2","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01095","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"AQ3XKOY353BB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AQ3XKOY353BBXFZV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AQ3XKOY3","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AQ3XKOY353BBXFZVWLZPQGJKT3","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T11:04:22Z","cross_cats_sorted":[],"title_canon_sha256":"1fffef5c4095ff31e668b2a63e29b4e7b908c8d471255d0dd2dc20a94781d47e","abstract_canon_sha256":"d812c3367048b330a8f5ddb1646cdb1618790144ca7f20d43dfa9c907b5577c0"},"schema_version":"1.0"},"canonical_sha256":"0437753b1beec21b9735b2f2f8192a9ecbc702444c48701652abd76d6e903716","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:41.998350Z","signature_b64":"RK/aD80pPiV2bVSp5UjCXEgKubUyyZDuU5OdZ32E2+yv6PW+0gh+4HFD2xJ85RPiELNqZ2olrFtPqFO0J6TDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0437753b1beec21b9735b2f2f8192a9ecbc702444c48701652abd76d6e903716","last_reissued_at":"2026-05-18T00:19:41.997661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:41.997661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01095","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-18T00:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bd3iG3YGTgfuW++ceehnYGL6cs2Xg8bDzWNksIcHL1lZqSQOZv3KtjONoG/0+LqrIAiTbwJOMrGaWiSbHscNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:01:08.409245Z"},"content_sha256":"98510d01d8191908f2e3f42dfaecf0f03f490cb1ab4dad2d558cf0aa3a6219f9","schema_version":"1.0","event_id":"sha256:98510d01d8191908f2e3f42dfaecf0f03f490cb1ab4dad2d558cf0aa3a6219f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AQ3XKOY353BBXFZVWLZPQGJKT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On regular induced subgraphs of generalized polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Gordon F. Royle, John Bamberg","submitted_at":"2017-08-03T11:04:22Z","abstract_excerpt":"The cage problem asks for the smallest number $c(k,g)$ of vertices in a $k$-regular graph of girth $g$ and graphs meeting this bound are known as cages. While cages are known to exist for all integers $k \\ge 2$ and $g \\ge 3$, the exact value of $c(k, g)$ is known only for some small values of $k, g$ and three infinite families where $g \\in \\{6, 8, 12\\}$ and $k - 1$ is a prime power. These infinite families come from the incidence graphs of generalized polygons. Some of the best known upper bounds on $c(k,g)$ for $g \\in \\{6, 8, 12\\}$ have been obtained by constructing small regular induced subg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01095","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-18T00:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iik7T6e1R6J/E3vl0zXVKrqi68m9We3eLeGPhNAY+ETDu7tyid+gnwr/gnWCiIKS8r77U3kwssXcREmofLNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:01:08.409770Z"},"content_sha256":"179ce9c8816d253e015e48150f9b12f14ae74564b88e8897fef9ee35b8d0261f","schema_version":"1.0","event_id":"sha256:179ce9c8816d253e015e48150f9b12f14ae74564b88e8897fef9ee35b8d0261f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/bundle.json","state_url":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/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-22T13:01:08Z","links":{"resolver":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3","bundle":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/bundle.json","state":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AQ3XKOY353BBXFZVWLZPQGJKT3","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":"d812c3367048b330a8f5ddb1646cdb1618790144ca7f20d43dfa9c907b5577c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T11:04:22Z","title_canon_sha256":"1fffef5c4095ff31e668b2a63e29b4e7b908c8d471255d0dd2dc20a94781d47e"},"schema_version":"1.0","source":{"id":"1708.01095","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01095","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01095v2","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01095","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"AQ3XKOY353BB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AQ3XKOY353BBXFZV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AQ3XKOY3","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:179ce9c8816d253e015e48150f9b12f14ae74564b88e8897fef9ee35b8d0261f","target":"graph","created_at":"2026-05-18T00:19:41Z","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":"The cage problem asks for the smallest number $c(k,g)$ of vertices in a $k$-regular graph of girth $g$ and graphs meeting this bound are known as cages. While cages are known to exist for all integers $k \\ge 2$ and $g \\ge 3$, the exact value of $c(k, g)$ is known only for some small values of $k, g$ and three infinite families where $g \\in \\{6, 8, 12\\}$ and $k - 1$ is a prime power. These infinite families come from the incidence graphs of generalized polygons. Some of the best known upper bounds on $c(k,g)$ for $g \\in \\{6, 8, 12\\}$ have been obtained by constructing small regular induced subg","authors_text":"Anurag Bishnoi, Gordon F. Royle, John Bamberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T11:04:22Z","title":"On regular induced subgraphs of generalized polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01095","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:98510d01d8191908f2e3f42dfaecf0f03f490cb1ab4dad2d558cf0aa3a6219f9","target":"record","created_at":"2026-05-18T00:19:41Z","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":"d812c3367048b330a8f5ddb1646cdb1618790144ca7f20d43dfa9c907b5577c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T11:04:22Z","title_canon_sha256":"1fffef5c4095ff31e668b2a63e29b4e7b908c8d471255d0dd2dc20a94781d47e"},"schema_version":"1.0","source":{"id":"1708.01095","kind":"arxiv","version":2}},"canonical_sha256":"0437753b1beec21b9735b2f2f8192a9ecbc702444c48701652abd76d6e903716","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0437753b1beec21b9735b2f2f8192a9ecbc702444c48701652abd76d6e903716","first_computed_at":"2026-05-18T00:19:41.997661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:41.997661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RK/aD80pPiV2bVSp5UjCXEgKubUyyZDuU5OdZ32E2+yv6PW+0gh+4HFD2xJ85RPiELNqZ2olrFtPqFO0J6TDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:41.998350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01095","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98510d01d8191908f2e3f42dfaecf0f03f490cb1ab4dad2d558cf0aa3a6219f9","sha256:179ce9c8816d253e015e48150f9b12f14ae74564b88e8897fef9ee35b8d0261f"],"state_sha256":"1a8a452b5db9a66f8024ba4dd804004dd1f71c372e2a3c441de0f41af273b255"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2rAeGsaIZ3h50+oMTB2PtI0xWaWtNExFp2vVeK7NOlS0v6oqBAXM6COq7iV8pC1l0qx+8N3MJbuKOCnaBo5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T13:01:08.412538Z","bundle_sha256":"c344a8af8b76b9a70265a60c49718ff00441d15a1e7cb420b196dd6f01510e28"}}