{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AQ3XKOY353BBXFZVWLZPQGJKT3","short_pith_number":"pith:AQ3XKOY3","schema_version":"1.0","canonical_sha256":"0437753b1beec21b9735b2f2f8192a9ecbc702444c48701652abd76d6e903716","source":{"kind":"arxiv","id":"1708.01095","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.01095","created_at":"2026-05-18T00:19:41.997769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01095v2","created_at":"2026-05-18T00:19:41.997769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01095","created_at":"2026-05-18T00:19:41.997769+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQ3XKOY353BB","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQ3XKOY353BBXFZV","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQ3XKOY3","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3","json":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3.json","graph_json":"https://pith.science/api/pith-number/AQ3XKOY353BBXFZVWLZPQGJKT3/graph.json","events_json":"https://pith.science/api/pith-number/AQ3XKOY353BBXFZVWLZPQGJKT3/events.json","paper":"https://pith.science/paper/AQ3XKOY3"},"agent_actions":{"view_html":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3","download_json":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3.json","view_paper":"https://pith.science/paper/AQ3XKOY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01095&json=true","fetch_graph":"https://pith.science/api/pith-number/AQ3XKOY353BBXFZVWLZPQGJKT3/graph.json","fetch_events":"https://pith.science/api/pith-number/AQ3XKOY353BBXFZVWLZPQGJKT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/action/storage_attestation","attest_author":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/action/author_attestation","sign_citation":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/action/citation_signature","submit_replication":"https://pith.science/pith/AQ3XKOY353BBXFZVWLZPQGJKT3/action/replication_record"}},"created_at":"2026-05-18T00:19:41.997769+00:00","updated_at":"2026-05-18T00:19:41.997769+00:00"}