{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5TQK5JI6MC3BWGJMTOD7B4ROIE","short_pith_number":"pith:5TQK5JI6","canonical_record":{"source":{"id":"1607.04842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-17T09:25:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d315fe21a49edffcc9e3eb547bb80552acac381806bbe17d5d98e0b48cee7b5f","abstract_canon_sha256":"d1aed3395abe8c704ae9e5ccbd938380a874c0f0adc6a7d4d3cb1d834e10db46"},"schema_version":"1.0"},"canonical_sha256":"ece0aea51e60b61b192c9b87f0f22e41114a5919dc10a914f3e606905f38a3c3","source":{"kind":"arxiv","id":"1607.04842","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04842","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04842v2","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04842","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"5TQK5JI6MC3B","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5TQK5JI6MC3BWGJM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5TQK5JI6","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5TQK5JI6MC3BWGJMTOD7B4ROIE","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-17T09:25:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d315fe21a49edffcc9e3eb547bb80552acac381806bbe17d5d98e0b48cee7b5f","abstract_canon_sha256":"d1aed3395abe8c704ae9e5ccbd938380a874c0f0adc6a7d4d3cb1d834e10db46"},"schema_version":"1.0"},"canonical_sha256":"ece0aea51e60b61b192c9b87f0f22e41114a5919dc10a914f3e606905f38a3c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:37.864445Z","signature_b64":"yp2oB6OlM+RFKcYSjWmvWMC8d4pNqy/xQxr7Omswh2NgvGEHni/SRJjH+81r/lovEitt63jQYidvpc9bWH0BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece0aea51e60b61b192c9b87f0f22e41114a5919dc10a914f3e606905f38a3c3","last_reissued_at":"2026-05-18T00:50:37.863742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:37.863742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04842","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-18T00:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZGTBUZrn98z37fP7u0M7Won8L40MGlkv6LhbWfPgbATEZeYFzhseDgaVPjd4ZiGl1sNJvq1rugiJ6C/BAnrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:03:18.786254Z"},"content_sha256":"f75b4649b5e3550f9986121620726d6c57bff22dfe8b36a46d57a06469c55914","schema_version":"1.0","event_id":"sha256:f75b4649b5e3550f9986121620726d6c57bff22dfe8b36a46d57a06469c55914"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5TQK5JI6MC3BWGJMTOD7B4ROIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minrank of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Alexander Golovnev, Oded Regev, Omri Weinstein","submitted_at":"2016-07-17T09:25:49Z","abstract_excerpt":"The minrank of a graph $G$ is the minimum rank of a matrix $M$ that can be obtained from the adjacency matrix of $G$ by switching some ones to zeros (i.e., deleting edges) and then setting all diagonal entries to one. This quantity is closely related to the fundamental information-theoretic problems of (linear) index coding (Bar-Yossef et al., FOCS'06), network coding and distributed storage, and to Valiant's approach for proving superlinear circuit lower bounds (Valiant, Boolean Function Complexity '92).\n  We prove tight bounds on the minrank of random Erd\\H{o}s-R\\'enyi graphs $G(n,p)$ for al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04842","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-18T00:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9GX3z2Ej1z3XZiRqI4yOBV2qj4ABUttG/d/lgrkcA8Z6eJOGPVqDQ9yg/WexmQVUrnToQfkxXOaAFMlq99URCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:03:18.786620Z"},"content_sha256":"18529a3790e2ff0377c131ead2a7268b22b4459664da046c9f38f7797679c71f","schema_version":"1.0","event_id":"sha256:18529a3790e2ff0377c131ead2a7268b22b4459664da046c9f38f7797679c71f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TQK5JI6MC3BWGJMTOD7B4ROIE/bundle.json","state_url":"https://pith.science/pith/5TQK5JI6MC3BWGJMTOD7B4ROIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TQK5JI6MC3BWGJMTOD7B4ROIE/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-05T15:03:18Z","links":{"resolver":"https://pith.science/pith/5TQK5JI6MC3BWGJMTOD7B4ROIE","bundle":"https://pith.science/pith/5TQK5JI6MC3BWGJMTOD7B4ROIE/bundle.json","state":"https://pith.science/pith/5TQK5JI6MC3BWGJMTOD7B4ROIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TQK5JI6MC3BWGJMTOD7B4ROIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5TQK5JI6MC3BWGJMTOD7B4ROIE","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":"d1aed3395abe8c704ae9e5ccbd938380a874c0f0adc6a7d4d3cb1d834e10db46","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-17T09:25:49Z","title_canon_sha256":"d315fe21a49edffcc9e3eb547bb80552acac381806bbe17d5d98e0b48cee7b5f"},"schema_version":"1.0","source":{"id":"1607.04842","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04842","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04842v2","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04842","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"5TQK5JI6MC3B","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5TQK5JI6MC3BWGJM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5TQK5JI6","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:18529a3790e2ff0377c131ead2a7268b22b4459664da046c9f38f7797679c71f","target":"graph","created_at":"2026-05-18T00:50:37Z","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$ is the minimum rank of a matrix $M$ that can be obtained from the adjacency matrix of $G$ by switching some ones to zeros (i.e., deleting edges) and then setting all diagonal entries to one. This quantity is closely related to the fundamental information-theoretic problems of (linear) index coding (Bar-Yossef et al., FOCS'06), network coding and distributed storage, and to Valiant's approach for proving superlinear circuit lower bounds (Valiant, Boolean Function Complexity '92).\n  We prove tight bounds on the minrank of random Erd\\H{o}s-R\\'enyi graphs $G(n,p)$ for al","authors_text":"Alexander Golovnev, Oded Regev, Omri Weinstein","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-17T09:25:49Z","title":"The Minrank of Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04842","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:f75b4649b5e3550f9986121620726d6c57bff22dfe8b36a46d57a06469c55914","target":"record","created_at":"2026-05-18T00:50:37Z","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":"d1aed3395abe8c704ae9e5ccbd938380a874c0f0adc6a7d4d3cb1d834e10db46","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-17T09:25:49Z","title_canon_sha256":"d315fe21a49edffcc9e3eb547bb80552acac381806bbe17d5d98e0b48cee7b5f"},"schema_version":"1.0","source":{"id":"1607.04842","kind":"arxiv","version":2}},"canonical_sha256":"ece0aea51e60b61b192c9b87f0f22e41114a5919dc10a914f3e606905f38a3c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ece0aea51e60b61b192c9b87f0f22e41114a5919dc10a914f3e606905f38a3c3","first_computed_at":"2026-05-18T00:50:37.863742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:37.863742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yp2oB6OlM+RFKcYSjWmvWMC8d4pNqy/xQxr7Omswh2NgvGEHni/SRJjH+81r/lovEitt63jQYidvpc9bWH0BDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:37.864445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04842","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f75b4649b5e3550f9986121620726d6c57bff22dfe8b36a46d57a06469c55914","sha256:18529a3790e2ff0377c131ead2a7268b22b4459664da046c9f38f7797679c71f"],"state_sha256":"d406391d51433228b0fc1e515c5ee88218e60c5a5a07e061e0b6a34234884794"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXD9w0r7i89VUeM5leugV8hyNFiJ3L4Va635oYaBQqSakSZA8kRfEP4M80OwPhr4vfHhchPJIw959aCF7mfgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:03:18.788755Z","bundle_sha256":"2c3e9e79a7ff5d6125301559f5df8fee5b70dbea1f93bae57063d8e2955370e7"}}