{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FZODSOZRYXJBNJOQNM2DV4YODJ","short_pith_number":"pith:FZODSOZR","schema_version":"1.0","canonical_sha256":"2e5c393b31c5d216a5d06b343af30e1a65cd02b58402e6898ba7a73152ec3f60","source":{"kind":"arxiv","id":"1010.5651","version":2},"attestation_state":"computed","paper":{"title":"On bipartite graphs of defect at most 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"(2) Centre for Informatics, Applied Optimization, Australia, Australia), Computer Science, Guillermo Pineda-Villavicencio (2) ((1) School of Electrical Engineering, Ramiro Feria-Pur\\'on (1), The University of Newcastle, University of Ballarat","submitted_at":"2010-10-27T11:31:09Z","abstract_excerpt":"We consider the bipartite version of the degree/diameter problem, namely, given natural numbers {\\Delta} \\geq 2 and D \\geq 2, find the maximum number Nb({\\Delta},D) of vertices in a bipartite graph of maximum degree {\\Delta} and diameter D. In this context, the Moore bipartite bound Mb({\\Delta},D) represents an upper bound for Nb({\\Delta},D). Bipartite graphs of maximum degree {\\Delta}, diameter D and order Mb({\\Delta},D), called Moore bipartite graphs, have turned out to be very rare. Therefore, it is very interesting to investigate bipartite graphs of maximum degree {\\Delta} \\geq 2, diameter"},"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":"1010.5651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:31:09Z","cross_cats_sorted":[],"title_canon_sha256":"ff61246ee6433932256c40d472d0ac985f392797c3fdac4d09f31fbdde64bbac","abstract_canon_sha256":"75f759a4c743b6403945797c9183b5510650cb9c51ca13307a5b7ed20271f24c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.497549Z","signature_b64":"lOUiQ9gm69bZSWlByZo4XRp+enmKv4huBpgaMVmK65SIN6NFz+cFQ/c4420OP9db7GI1XBnF1iKbn2sqp/i9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e5c393b31c5d216a5d06b343af30e1a65cd02b58402e6898ba7a73152ec3f60","last_reissued_at":"2026-05-18T02:52:42.497090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.497090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On bipartite graphs of defect at most 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"(2) Centre for Informatics, Applied Optimization, Australia, Australia), Computer Science, Guillermo Pineda-Villavicencio (2) ((1) School of Electrical Engineering, Ramiro Feria-Pur\\'on (1), The University of Newcastle, University of Ballarat","submitted_at":"2010-10-27T11:31:09Z","abstract_excerpt":"We consider the bipartite version of the degree/diameter problem, namely, given natural numbers {\\Delta} \\geq 2 and D \\geq 2, find the maximum number Nb({\\Delta},D) of vertices in a bipartite graph of maximum degree {\\Delta} and diameter D. In this context, the Moore bipartite bound Mb({\\Delta},D) represents an upper bound for Nb({\\Delta},D). Bipartite graphs of maximum degree {\\Delta}, diameter D and order Mb({\\Delta},D), called Moore bipartite graphs, have turned out to be very rare. Therefore, it is very interesting to investigate bipartite graphs of maximum degree {\\Delta} \\geq 2, diameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5651","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":"1010.5651","created_at":"2026-05-18T02:52:42.497156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5651v2","created_at":"2026-05-18T02:52:42.497156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5651","created_at":"2026-05-18T02:52:42.497156+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZODSOZRYXJB","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZODSOZRYXJBNJOQ","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZODSOZR","created_at":"2026-05-18T12:26:07.630475+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/FZODSOZRYXJBNJOQNM2DV4YODJ","json":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ.json","graph_json":"https://pith.science/api/pith-number/FZODSOZRYXJBNJOQNM2DV4YODJ/graph.json","events_json":"https://pith.science/api/pith-number/FZODSOZRYXJBNJOQNM2DV4YODJ/events.json","paper":"https://pith.science/paper/FZODSOZR"},"agent_actions":{"view_html":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ","download_json":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ.json","view_paper":"https://pith.science/paper/FZODSOZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5651&json=true","fetch_graph":"https://pith.science/api/pith-number/FZODSOZRYXJBNJOQNM2DV4YODJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FZODSOZRYXJBNJOQNM2DV4YODJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/action/storage_attestation","attest_author":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/action/author_attestation","sign_citation":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/action/citation_signature","submit_replication":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/action/replication_record"}},"created_at":"2026-05-18T02:52:42.497156+00:00","updated_at":"2026-05-18T02:52:42.497156+00:00"}