{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LWACRMBGCHDUP72H4QQNX2KTZI","short_pith_number":"pith:LWACRMBG","canonical_record":{"source":{"id":"1203.3588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T23:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"4cef8ef5a6b2aa9edc9472a805aa3feb4c14489ed71d8e4eca7de844e3a59433","abstract_canon_sha256":"fed562a7b3b05fa3dce61fa7e7d03fdeec720c3e9abd99c1a636315a6bd2ad80"},"schema_version":"1.0"},"canonical_sha256":"5d8028b02611c747ff47e420dbe953ca294415f4c125c0ba0f9b1c17d7225141","source":{"kind":"arxiv","id":"1203.3588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3588","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3588v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3588","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"LWACRMBGCHDU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LWACRMBGCHDUP72H","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LWACRMBG","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LWACRMBGCHDUP72H4QQNX2KTZI","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T23:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"4cef8ef5a6b2aa9edc9472a805aa3feb4c14489ed71d8e4eca7de844e3a59433","abstract_canon_sha256":"fed562a7b3b05fa3dce61fa7e7d03fdeec720c3e9abd99c1a636315a6bd2ad80"},"schema_version":"1.0"},"canonical_sha256":"5d8028b02611c747ff47e420dbe953ca294415f4c125c0ba0f9b1c17d7225141","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:42.398500Z","signature_b64":"z/GHcCGD1FxmlBQ1D4hI/3uDy3UiDdSv88bypglKQw223znqrhin8Dz0j7bSqOWrkOk4ae+QIzi0zAtM425YCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d8028b02611c747ff47e420dbe953ca294415f4c125c0ba0f9b1c17d7225141","last_reissued_at":"2026-05-18T02:52:42.398050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:42.398050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3588","source_version":1,"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":"PpyQ+beW9Wep9JE49uL+rZ97L5ioqACPH7U/2/1d8YL1j/xIAkVwTDuAQtSJKa9+z6TZIf07qAIVwsNrOm5HBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:00:42.718726Z"},"content_sha256":"f07086f53bd17143686495cb2e762b7469b8ee5f804ff6e3164311a6d5a5276f","schema_version":"1.0","event_id":"sha256:f07086f53bd17143686495cb2e762b7469b8ee5f804ff6e3164311a6d5a5276f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LWACRMBGCHDUP72H4QQNX2KTZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On large bipartite graphs of diameter 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillermo Pineda-Villavicencio, Mirka Miller, Ramiro Feria-Puron","submitted_at":"2012-03-15T23:10:30Z","abstract_excerpt":"We consider the bipartite version of the {\\it degree/diameter problem}, namely, given natural numbers $d\\ge2$ and $D\\ge2$, find the maximum number $\\N^b(d,D)$ of vertices in a bipartite graph of maximum degree $d$ and diameter $D$. In this context, the bipartite Moore bound $\\M^b(d,D)$ represents a general upper bound for $\\N^b(d,D)$. Bipartite graphs of order $\\M^b(d,D)$ are very rare, and determining $\\N^b(d,D)$ still remains an open problem for most $(d,D)$ pairs.\n  This paper is a follow-up to our earlier paper \\cite{FPV12}, where a study on bipartite $(d,D,-4)$-graphs (that is, bipartite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3588","kind":"arxiv","version":1},"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":"KrK30+oIBKsfq0r5c1SB73BQAolAiccxojhnI9WxsyWZ8GDLnnn+6L3WJzqdTE3sMTR/GcoUQdbSli+MaM+XBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:00:42.719052Z"},"content_sha256":"caca1845dbc283e34bc6ef4d53729a2042d81d8d0faa807b06a77cd28cd61b1c","schema_version":"1.0","event_id":"sha256:caca1845dbc283e34bc6ef4d53729a2042d81d8d0faa807b06a77cd28cd61b1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWACRMBGCHDUP72H4QQNX2KTZI/bundle.json","state_url":"https://pith.science/pith/LWACRMBGCHDUP72H4QQNX2KTZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWACRMBGCHDUP72H4QQNX2KTZI/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-22T03:00:42Z","links":{"resolver":"https://pith.science/pith/LWACRMBGCHDUP72H4QQNX2KTZI","bundle":"https://pith.science/pith/LWACRMBGCHDUP72H4QQNX2KTZI/bundle.json","state":"https://pith.science/pith/LWACRMBGCHDUP72H4QQNX2KTZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWACRMBGCHDUP72H4QQNX2KTZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LWACRMBGCHDUP72H4QQNX2KTZI","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":"fed562a7b3b05fa3dce61fa7e7d03fdeec720c3e9abd99c1a636315a6bd2ad80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T23:10:30Z","title_canon_sha256":"4cef8ef5a6b2aa9edc9472a805aa3feb4c14489ed71d8e4eca7de844e3a59433"},"schema_version":"1.0","source":{"id":"1203.3588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3588","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3588v1","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3588","created_at":"2026-05-18T02:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"LWACRMBGCHDU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LWACRMBGCHDUP72H","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LWACRMBG","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:caca1845dbc283e34bc6ef4d53729a2042d81d8d0faa807b06a77cd28cd61b1c","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 {\\it degree/diameter problem}, namely, given natural numbers $d\\ge2$ and $D\\ge2$, find the maximum number $\\N^b(d,D)$ of vertices in a bipartite graph of maximum degree $d$ and diameter $D$. In this context, the bipartite Moore bound $\\M^b(d,D)$ represents a general upper bound for $\\N^b(d,D)$. Bipartite graphs of order $\\M^b(d,D)$ are very rare, and determining $\\N^b(d,D)$ still remains an open problem for most $(d,D)$ pairs.\n  This paper is a follow-up to our earlier paper \\cite{FPV12}, where a study on bipartite $(d,D,-4)$-graphs (that is, bipartite ","authors_text":"Guillermo Pineda-Villavicencio, Mirka Miller, Ramiro Feria-Puron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T23:10:30Z","title":"On large bipartite graphs of diameter 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3588","kind":"arxiv","version":1},"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:f07086f53bd17143686495cb2e762b7469b8ee5f804ff6e3164311a6d5a5276f","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":"fed562a7b3b05fa3dce61fa7e7d03fdeec720c3e9abd99c1a636315a6bd2ad80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T23:10:30Z","title_canon_sha256":"4cef8ef5a6b2aa9edc9472a805aa3feb4c14489ed71d8e4eca7de844e3a59433"},"schema_version":"1.0","source":{"id":"1203.3588","kind":"arxiv","version":1}},"canonical_sha256":"5d8028b02611c747ff47e420dbe953ca294415f4c125c0ba0f9b1c17d7225141","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d8028b02611c747ff47e420dbe953ca294415f4c125c0ba0f9b1c17d7225141","first_computed_at":"2026-05-18T02:52:42.398050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:42.398050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z/GHcCGD1FxmlBQ1D4hI/3uDy3UiDdSv88bypglKQw223znqrhin8Dz0j7bSqOWrkOk4ae+QIzi0zAtM425YCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:42.398500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f07086f53bd17143686495cb2e762b7469b8ee5f804ff6e3164311a6d5a5276f","sha256:caca1845dbc283e34bc6ef4d53729a2042d81d8d0faa807b06a77cd28cd61b1c"],"state_sha256":"36a77bfc2d220c91d4a91330baa671eec83dcedfb9463cd7339cd861c0f71824"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhOyAiYzu+5RaN6gmDympBUUf7nIP5KgNHUyT+DYYm2Yto2K/AA0EHYmLX8a5+ff17KG9ptd7lj6Kif07S9tAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T03:00:42.720846Z","bundle_sha256":"06b3c3296bda9170f2e29228f5b1255477268c69ec8bf3b1470c72b164cd65ef"}}