{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LY4COP4M33QSK6YFLJZTAAIZS4","short_pith_number":"pith:LY4COP4M","canonical_record":{"source":{"id":"1301.4790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-21T08:33:37Z","cross_cats_sorted":[],"title_canon_sha256":"a3c2cdc8f71bc4e903c02ceacfe456f15e0391389df902735c99c5354542f88f","abstract_canon_sha256":"a12fb6673359b1436ccf804738a86c95dcefb81c179729c1d389775d1e4b1cf8"},"schema_version":"1.0"},"canonical_sha256":"5e38273f8cdee1257b055a73300119972c2a238262ab6255c1ad40ed90093fb7","source":{"kind":"arxiv","id":"1301.4790","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4790","created_at":"2026-05-18T03:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4790v1","created_at":"2026-05-18T03:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4790","created_at":"2026-05-18T03:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"LY4COP4M33QS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LY4COP4M33QSK6YF","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LY4COP4M","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LY4COP4M33QSK6YFLJZTAAIZS4","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-21T08:33:37Z","cross_cats_sorted":[],"title_canon_sha256":"a3c2cdc8f71bc4e903c02ceacfe456f15e0391389df902735c99c5354542f88f","abstract_canon_sha256":"a12fb6673359b1436ccf804738a86c95dcefb81c179729c1d389775d1e4b1cf8"},"schema_version":"1.0"},"canonical_sha256":"5e38273f8cdee1257b055a73300119972c2a238262ab6255c1ad40ed90093fb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:55.603079Z","signature_b64":"YvgXT7IYpT7AUQCPKyCeKgCjbg8j3Snvz7hcuCSexBXrD45pAdSSQ+nwQKvjcL1asBJuk9QGU6w+gzWmyZ8iAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e38273f8cdee1257b055a73300119972c2a238262ab6255c1ad40ed90093fb7","last_reissued_at":"2026-05-18T03:35:55.602423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:55.602423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4790","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-18T03:35:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8RxmrSMcCsIdnsWmxlWoZW4ElP6ut2eimM1OzapVt0i5EpmGj1Jr3otcOGwzaOoTGXRFF1IlQOgFz3LR4bECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:44:11.535973Z"},"content_sha256":"0abd46fd47b5341dd004f0a5f6504dce821bf351fb92510726dfcf2e79f8949e","schema_version":"1.0","event_id":"sha256:0abd46fd47b5341dd004f0a5f6504dce821bf351fb92510726dfcf2e79f8949e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LY4COP4M33QSK6YFLJZTAAIZS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Biclique cover of the complete graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Farokhlagha Moazami, Nasrin Soltankhah","submitted_at":"2013-01-21T08:33:37Z","abstract_excerpt":"Let $K$ be a set of $k$ positive integers. A biclique cover of type $K$ of a graph $G$ is a collection of complete bipartite subgraphs of $G$ such that for every edge $e$ of $G$, the number of bicliques need to cover $e$ is a member of $K$. If $K=\\{1,2,..., k\\}$ then the maximum number of the vertices of a complete graph that admits a biclique cover of type $K$ with $d$ bicliques, $n(k,d)$, is the maximum possible cardinality of a $k$-neighborly family of standard boxes in $\\mathbb{R}^d$.\n  In this paper, we obtain an upper bound for $n(k,d)$. Also, we show that the upper bound can be improved"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4790","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-18T03:35:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JD1LXE78W7dQ0FqZI6xQezvO5HXz0jHJ3ZfJpCgUvbhRg3cFHkVzH39l8ASJjXvMAw3CVeaJf8TcSuA7EIVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:44:11.536322Z"},"content_sha256":"fa7547f0593716a0415c6d5d54f9752dd24fca7749514d7adecfded43d6db924","schema_version":"1.0","event_id":"sha256:fa7547f0593716a0415c6d5d54f9752dd24fca7749514d7adecfded43d6db924"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LY4COP4M33QSK6YFLJZTAAIZS4/bundle.json","state_url":"https://pith.science/pith/LY4COP4M33QSK6YFLJZTAAIZS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LY4COP4M33QSK6YFLJZTAAIZS4/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-28T14:44:11Z","links":{"resolver":"https://pith.science/pith/LY4COP4M33QSK6YFLJZTAAIZS4","bundle":"https://pith.science/pith/LY4COP4M33QSK6YFLJZTAAIZS4/bundle.json","state":"https://pith.science/pith/LY4COP4M33QSK6YFLJZTAAIZS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LY4COP4M33QSK6YFLJZTAAIZS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LY4COP4M33QSK6YFLJZTAAIZS4","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":"a12fb6673359b1436ccf804738a86c95dcefb81c179729c1d389775d1e4b1cf8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-21T08:33:37Z","title_canon_sha256":"a3c2cdc8f71bc4e903c02ceacfe456f15e0391389df902735c99c5354542f88f"},"schema_version":"1.0","source":{"id":"1301.4790","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4790","created_at":"2026-05-18T03:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4790v1","created_at":"2026-05-18T03:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4790","created_at":"2026-05-18T03:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"LY4COP4M33QS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LY4COP4M33QSK6YF","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LY4COP4M","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:fa7547f0593716a0415c6d5d54f9752dd24fca7749514d7adecfded43d6db924","target":"graph","created_at":"2026-05-18T03:35:55Z","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":"Let $K$ be a set of $k$ positive integers. A biclique cover of type $K$ of a graph $G$ is a collection of complete bipartite subgraphs of $G$ such that for every edge $e$ of $G$, the number of bicliques need to cover $e$ is a member of $K$. If $K=\\{1,2,..., k\\}$ then the maximum number of the vertices of a complete graph that admits a biclique cover of type $K$ with $d$ bicliques, $n(k,d)$, is the maximum possible cardinality of a $k$-neighborly family of standard boxes in $\\mathbb{R}^d$.\n  In this paper, we obtain an upper bound for $n(k,d)$. Also, we show that the upper bound can be improved","authors_text":"Farokhlagha Moazami, Nasrin Soltankhah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-21T08:33:37Z","title":"On the Biclique cover of the complete graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4790","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:0abd46fd47b5341dd004f0a5f6504dce821bf351fb92510726dfcf2e79f8949e","target":"record","created_at":"2026-05-18T03:35:55Z","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":"a12fb6673359b1436ccf804738a86c95dcefb81c179729c1d389775d1e4b1cf8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-21T08:33:37Z","title_canon_sha256":"a3c2cdc8f71bc4e903c02ceacfe456f15e0391389df902735c99c5354542f88f"},"schema_version":"1.0","source":{"id":"1301.4790","kind":"arxiv","version":1}},"canonical_sha256":"5e38273f8cdee1257b055a73300119972c2a238262ab6255c1ad40ed90093fb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e38273f8cdee1257b055a73300119972c2a238262ab6255c1ad40ed90093fb7","first_computed_at":"2026-05-18T03:35:55.602423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:55.602423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YvgXT7IYpT7AUQCPKyCeKgCjbg8j3Snvz7hcuCSexBXrD45pAdSSQ+nwQKvjcL1asBJuk9QGU6w+gzWmyZ8iAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:55.603079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4790","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0abd46fd47b5341dd004f0a5f6504dce821bf351fb92510726dfcf2e79f8949e","sha256:fa7547f0593716a0415c6d5d54f9752dd24fca7749514d7adecfded43d6db924"],"state_sha256":"0aa5e8cbcf5dcb46b8e2b5e427d069aceafecc770f401bb88297cf683ac5e593"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bm5PdGqOgouNoVNa5woKx4bcOHzo9iJ4/u2B99MdzYHiJyrCOkbaiekMQPv+z8Te9B/uoegUOfYKvYXTEqZSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:44:11.538139Z","bundle_sha256":"4e0b6462fccad3f7602cdf1cbd89beeec5bdd7ac0fe71d60992a8060a8307384"}}