{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6PPXBIO54RTSXDL2X7AWO6WSXY","short_pith_number":"pith:6PPXBIO5","schema_version":"1.0","canonical_sha256":"f3df70a1dde4672b8d7abfc1677ad2be3703d7746f3afc953fa6a612f517dd40","source":{"kind":"arxiv","id":"1507.08926","version":2},"attestation_state":"computed","paper":{"title":"Large butterfly Cayley graphs and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Bevan","submitted_at":"2015-07-31T16:05:00Z","abstract_excerpt":"We present families of large undirected and directed Cayley graphs whose construction is related to butterfly networks. One approach yields, for every large $k$ and for values of $d$ taken from a large interval, the largest known Cayley graphs and digraphs of diameter $k$ and degree $d$. Another method yields, for sufficiently large $k$ and infinitely many values of $d$, Cayley graphs and digraphs of diameter $k$ and degree $d$ whose order is exponentially larger in $k$ than any previously constructed. In the directed case, these are within a linear factor in $k$ of the Moore bound."},"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":"1507.08926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-31T16:05:00Z","cross_cats_sorted":[],"title_canon_sha256":"75884e9bc2a5193161d15b6d6de10ad19fa2e1023df5540b32a2ea03730fc645","abstract_canon_sha256":"d991a8fe20f584b37efb477e16171055ea5990a8b7b0e8f86fedc98c5d364779"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:05.844155Z","signature_b64":"+z2oVauWziDyF1VPmEHu9q5eJko8jG+WS5qQmK5H7kGjDpOhmCmkzXfL5j7t8UsK+QWRUj/pDp5gyggpziqdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3df70a1dde4672b8d7abfc1677ad2be3703d7746f3afc953fa6a612f517dd40","last_reissued_at":"2026-05-18T00:15:05.843525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:05.843525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large butterfly Cayley graphs and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Bevan","submitted_at":"2015-07-31T16:05:00Z","abstract_excerpt":"We present families of large undirected and directed Cayley graphs whose construction is related to butterfly networks. One approach yields, for every large $k$ and for values of $d$ taken from a large interval, the largest known Cayley graphs and digraphs of diameter $k$ and degree $d$. Another method yields, for sufficiently large $k$ and infinitely many values of $d$, Cayley graphs and digraphs of diameter $k$ and degree $d$ whose order is exponentially larger in $k$ than any previously constructed. In the directed case, these are within a linear factor in $k$ of the Moore bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08926","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":"1507.08926","created_at":"2026-05-18T00:15:05.843631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08926v2","created_at":"2026-05-18T00:15:05.843631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08926","created_at":"2026-05-18T00:15:05.843631+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PPXBIO54RTS","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PPXBIO54RTSXDL2","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PPXBIO5","created_at":"2026-05-18T12:29:07.941421+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/6PPXBIO54RTSXDL2X7AWO6WSXY","json":"https://pith.science/pith/6PPXBIO54RTSXDL2X7AWO6WSXY.json","graph_json":"https://pith.science/api/pith-number/6PPXBIO54RTSXDL2X7AWO6WSXY/graph.json","events_json":"https://pith.science/api/pith-number/6PPXBIO54RTSXDL2X7AWO6WSXY/events.json","paper":"https://pith.science/paper/6PPXBIO5"},"agent_actions":{"view_html":"https://pith.science/pith/6PPXBIO54RTSXDL2X7AWO6WSXY","download_json":"https://pith.science/pith/6PPXBIO54RTSXDL2X7AWO6WSXY.json","view_paper":"https://pith.science/paper/6PPXBIO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08926&json=true","fetch_graph":"https://pith.science/api/pith-number/6PPXBIO54RTSXDL2X7AWO6WSXY/graph.json","fetch_events":"https://pith.science/api/pith-number/6PPXBIO54RTSXDL2X7AWO6WSXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PPXBIO54RTSXDL2X7AWO6WSXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PPXBIO54RTSXDL2X7AWO6WSXY/action/storage_attestation","attest_author":"https://pith.science/pith/6PPXBIO54RTSXDL2X7AWO6WSXY/action/author_attestation","sign_citation":"https://pith.science/pith/6PPXBIO54RTSXDL2X7AWO6WSXY/action/citation_signature","submit_replication":"https://pith.science/pith/6PPXBIO54RTSXDL2X7AWO6WSXY/action/replication_record"}},"created_at":"2026-05-18T00:15:05.843631+00:00","updated_at":"2026-05-18T00:15:05.843631+00:00"}