{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5FZGBCBJZRBQJZD3TXKB33K7HC","short_pith_number":"pith:5FZGBCBJ","canonical_record":{"source":{"id":"1809.01873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T08:23:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0e3a078b7839aa25b76bbb3762aca17f336fd5d58378ecab0dad18815925c443","abstract_canon_sha256":"1756c45e10f435261be324947f42440fb58e06b51e5ac9f236514930d17c476e"},"schema_version":"1.0"},"canonical_sha256":"e972608829cc4304e47b9dd41ded5f3880e92d6b9e41d3e6baaa193e0ce5f4b4","source":{"kind":"arxiv","id":"1809.01873","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01873","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01873v2","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01873","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"5FZGBCBJZRBQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5FZGBCBJZRBQJZD3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5FZGBCBJ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5FZGBCBJZRBQJZD3TXKB33K7HC","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T08:23:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0e3a078b7839aa25b76bbb3762aca17f336fd5d58378ecab0dad18815925c443","abstract_canon_sha256":"1756c45e10f435261be324947f42440fb58e06b51e5ac9f236514930d17c476e"},"schema_version":"1.0"},"canonical_sha256":"e972608829cc4304e47b9dd41ded5f3880e92d6b9e41d3e6baaa193e0ce5f4b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:28.995853Z","signature_b64":"lnXnpBvp+avGan5jdCrB922D/qIqvaMbJkj9s+2Yi3Ev0+Exhl2OSdTwRj8icMTtpWLzgqMBNLXCKCLGtVW4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e972608829cc4304e47b9dd41ded5f3880e92d6b9e41d3e6baaa193e0ce5f4b4","last_reissued_at":"2026-05-17T23:55:28.995418Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:28.995418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01873","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-17T23:55:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAHivz7FbGnPqdiwu4xtufcVjK0uLvjgdA70BX1NUzYwhOvBLhII+LvtTOsUYxDn0QRprKWLlwhIOg0Ff8+ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:40:08.380781Z"},"content_sha256":"94a659011f4daa775a12996d917d0f31cd36e7498a1f03a7d9ae4cd547435b0b","schema_version":"1.0","event_id":"sha256:94a659011f4daa775a12996d917d0f31cd36e7498a1f03a7d9ae4cd547435b0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5FZGBCBJZRBQJZD3TXKB33K7HC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minrank of Random Graphs over Arbitrary Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Adva Mond, Frank Mousset, Igor Balla, Lior Gishboliner, Noga Alon","submitted_at":"2018-09-06T08:23:05Z","abstract_excerpt":"The minrank of a graph $G$ on the set of vertices $[n]$ over a field $\\mathbb{F}$ is the minimum possible rank of a matrix $M\\in\\mathbb{F}^{n\\times n}$ with nonzero diagonal entries such that $M_{i,j}=0$ whenever $i$ and $j$ are distinct nonadjacent vertices of $G$. This notion, over the real field, arises in the study of the Lov\\'asz theta function of a graph. We obtain tight bounds for the typical minrank of the binomial random graph $G(n,p)$ over any finite or infinite field, showing that for every field $\\mathbb{F}=\\mathbb F(n)$ and every $p=p(n)$ satisfying $n^{-1} \\leq p \\leq 1-n^{-0.99}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01873","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-17T23:55:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I42sH5QgcEDsqcbxJjysHGbXKQzDqZUWxislaBPaJLvbyXugLIiUQs2rAFmAlTAxnbiGNbfKmMiTvCTeV33JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:40:08.381138Z"},"content_sha256":"2e4ebf228584cbaeb02eff62da3979e008b3764216ee39c7d6381f373f77ef41","schema_version":"1.0","event_id":"sha256:2e4ebf228584cbaeb02eff62da3979e008b3764216ee39c7d6381f373f77ef41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FZGBCBJZRBQJZD3TXKB33K7HC/bundle.json","state_url":"https://pith.science/pith/5FZGBCBJZRBQJZD3TXKB33K7HC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FZGBCBJZRBQJZD3TXKB33K7HC/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-01T14:40:08Z","links":{"resolver":"https://pith.science/pith/5FZGBCBJZRBQJZD3TXKB33K7HC","bundle":"https://pith.science/pith/5FZGBCBJZRBQJZD3TXKB33K7HC/bundle.json","state":"https://pith.science/pith/5FZGBCBJZRBQJZD3TXKB33K7HC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FZGBCBJZRBQJZD3TXKB33K7HC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5FZGBCBJZRBQJZD3TXKB33K7HC","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":"1756c45e10f435261be324947f42440fb58e06b51e5ac9f236514930d17c476e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T08:23:05Z","title_canon_sha256":"0e3a078b7839aa25b76bbb3762aca17f336fd5d58378ecab0dad18815925c443"},"schema_version":"1.0","source":{"id":"1809.01873","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01873","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01873v2","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01873","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"5FZGBCBJZRBQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5FZGBCBJZRBQJZD3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5FZGBCBJ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:2e4ebf228584cbaeb02eff62da3979e008b3764216ee39c7d6381f373f77ef41","target":"graph","created_at":"2026-05-17T23:55:28Z","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":"The minrank of a graph $G$ on the set of vertices $[n]$ over a field $\\mathbb{F}$ is the minimum possible rank of a matrix $M\\in\\mathbb{F}^{n\\times n}$ with nonzero diagonal entries such that $M_{i,j}=0$ whenever $i$ and $j$ are distinct nonadjacent vertices of $G$. This notion, over the real field, arises in the study of the Lov\\'asz theta function of a graph. We obtain tight bounds for the typical minrank of the binomial random graph $G(n,p)$ over any finite or infinite field, showing that for every field $\\mathbb{F}=\\mathbb F(n)$ and every $p=p(n)$ satisfying $n^{-1} \\leq p \\leq 1-n^{-0.99}","authors_text":"Adva Mond, Frank Mousset, Igor Balla, Lior Gishboliner, Noga Alon","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T08:23:05Z","title":"The Minrank of Random Graphs over Arbitrary Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01873","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:94a659011f4daa775a12996d917d0f31cd36e7498a1f03a7d9ae4cd547435b0b","target":"record","created_at":"2026-05-17T23:55:28Z","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":"1756c45e10f435261be324947f42440fb58e06b51e5ac9f236514930d17c476e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T08:23:05Z","title_canon_sha256":"0e3a078b7839aa25b76bbb3762aca17f336fd5d58378ecab0dad18815925c443"},"schema_version":"1.0","source":{"id":"1809.01873","kind":"arxiv","version":2}},"canonical_sha256":"e972608829cc4304e47b9dd41ded5f3880e92d6b9e41d3e6baaa193e0ce5f4b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e972608829cc4304e47b9dd41ded5f3880e92d6b9e41d3e6baaa193e0ce5f4b4","first_computed_at":"2026-05-17T23:55:28.995418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:28.995418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lnXnpBvp+avGan5jdCrB922D/qIqvaMbJkj9s+2Yi3Ev0+Exhl2OSdTwRj8icMTtpWLzgqMBNLXCKCLGtVW4Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:28.995853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01873","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94a659011f4daa775a12996d917d0f31cd36e7498a1f03a7d9ae4cd547435b0b","sha256:2e4ebf228584cbaeb02eff62da3979e008b3764216ee39c7d6381f373f77ef41"],"state_sha256":"4d757903c30c2d02070ec727b7948d77033d11a86498045a6ef4c1e2b878ed1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yBbnxJCXnqU8l6qBEbWUhIypU+ebirtODFszwwcZumfRzE3gVkHFNTNwq4GBvbBuK/gg604oL+eM2ZmGamNAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:40:08.383310Z","bundle_sha256":"2a022827359447f3d5d66bff8c7b17f917dab541e12d6d0d937046a4e8504f2d"}}