{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FZODSOZRYXJBNJOQNM2DV4YODJ","short_pith_number":"pith:FZODSOZR","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"},"canonical_sha256":"2e5c393b31c5d216a5d06b343af30e1a65cd02b58402e6898ba7a73152ec3f60","source":{"kind":"arxiv","id":"1010.5651","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5651","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5651v2","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5651","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"FZODSOZRYXJB","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FZODSOZRYXJBNJOQ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FZODSOZR","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FZODSOZRYXJBNJOQNM2DV4YODJ","target":"record","payload":{"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"},"canonical_sha256":"2e5c393b31c5d216a5d06b343af30e1a65cd02b58402e6898ba7a73152ec3f60","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"},"source_kind":"arxiv","source_id":"1010.5651","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-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLh6l0x+gyAe8EqbzCr7/bXi0KlYTw4OnvrPEFT8IAbR14lrt/1uoQT7whIxFtbCeIyF+fYUNuSF/0jrl9Z1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:35:28.604334Z"},"content_sha256":"b8875e11576f189a3335087fcb8d94438978c81f74a8218a76f0ef157a6373c3","schema_version":"1.0","event_id":"sha256:b8875e11576f189a3335087fcb8d94438978c81f74a8218a76f0ef157a6373c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FZODSOZRYXJBNJOQNM2DV4YODJ","target":"graph","payload":{"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"},"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-18T02:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxNvBJLgpEuliVmupWDeYc4QzNtMvWNT/dn32+vopxySSKfUAVV8o0cd1WRqcQxfmaEIX69NCUj/sqdEXXYFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:35:28.604705Z"},"content_sha256":"ca3f838167a96406d998e7957474414ff28e6925fc84d3137abcabaca4254980","schema_version":"1.0","event_id":"sha256:ca3f838167a96406d998e7957474414ff28e6925fc84d3137abcabaca4254980"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/bundle.json","state_url":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/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-06-01T07:35:28Z","links":{"resolver":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ","bundle":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/bundle.json","state":"https://pith.science/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZODSOZRYXJBNJOQNM2DV4YODJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FZODSOZRYXJBNJOQNM2DV4YODJ","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":"75f759a4c743b6403945797c9183b5510650cb9c51ca13307a5b7ed20271f24c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:31:09Z","title_canon_sha256":"ff61246ee6433932256c40d472d0ac985f392797c3fdac4d09f31fbdde64bbac"},"schema_version":"1.0","source":{"id":"1010.5651","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5651","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5651v2","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5651","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"FZODSOZRYXJB","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FZODSOZRYXJBNJOQ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FZODSOZR","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:ca3f838167a96406d998e7957474414ff28e6925fc84d3137abcabaca4254980","target":"graph","created_at":"2026-05-18T02:52:42Z","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":"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","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","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:31:09Z","title":"On bipartite graphs of defect at most 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5651","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:b8875e11576f189a3335087fcb8d94438978c81f74a8218a76f0ef157a6373c3","target":"record","created_at":"2026-05-18T02:52:42Z","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":"75f759a4c743b6403945797c9183b5510650cb9c51ca13307a5b7ed20271f24c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T11:31:09Z","title_canon_sha256":"ff61246ee6433932256c40d472d0ac985f392797c3fdac4d09f31fbdde64bbac"},"schema_version":"1.0","source":{"id":"1010.5651","kind":"arxiv","version":2}},"canonical_sha256":"2e5c393b31c5d216a5d06b343af30e1a65cd02b58402e6898ba7a73152ec3f60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e5c393b31c5d216a5d06b343af30e1a65cd02b58402e6898ba7a73152ec3f60","first_computed_at":"2026-05-18T02:52:42.497090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.497090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lOUiQ9gm69bZSWlByZo4XRp+enmKv4huBpgaMVmK65SIN6NFz+cFQ/c4420OP9db7GI1XBnF1iKbn2sqp/i9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.497549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5651","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8875e11576f189a3335087fcb8d94438978c81f74a8218a76f0ef157a6373c3","sha256:ca3f838167a96406d998e7957474414ff28e6925fc84d3137abcabaca4254980"],"state_sha256":"9985874a930da5906e232fd5cfa3bbb6c8fbe4340951663414a58074c5654a74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2paxxqYV8XpGIMezq6ykZutui75H1xqpt0Je+T5JrmWTUtxiwxyoinGc3DxsV02JOBUx+uKPi0quSKp39cwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:35:28.606701Z","bundle_sha256":"ad672684088dbcaeedd8cfdf2847310b8d50078e9e3c9fed4c90e8624a4bc605"}}