{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F2Z64LUWXSCI3633NLE3ZIFA3Y","short_pith_number":"pith:F2Z64LUW","canonical_record":{"source":{"id":"1701.08292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T14:18:12Z","cross_cats_sorted":[],"title_canon_sha256":"398f4a0526be14cb2565ff1c5d6d1798dc2f5043777cd0c9149e276025eaf4e2","abstract_canon_sha256":"b3d281c2f2c5aeb2c6678ef2e0b1d7317008a2da8ad59bd6cb583677358c8a8a"},"schema_version":"1.0"},"canonical_sha256":"2eb3ee2e96bc848dfb7b6ac9bca0a0de35a417778c93fe7b12057cee01d8e852","source":{"kind":"arxiv","id":"1701.08292","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08292","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08292v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08292","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"F2Z64LUWXSCI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F2Z64LUWXSCI3633","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F2Z64LUW","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F2Z64LUWXSCI3633NLE3ZIFA3Y","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T14:18:12Z","cross_cats_sorted":[],"title_canon_sha256":"398f4a0526be14cb2565ff1c5d6d1798dc2f5043777cd0c9149e276025eaf4e2","abstract_canon_sha256":"b3d281c2f2c5aeb2c6678ef2e0b1d7317008a2da8ad59bd6cb583677358c8a8a"},"schema_version":"1.0"},"canonical_sha256":"2eb3ee2e96bc848dfb7b6ac9bca0a0de35a417778c93fe7b12057cee01d8e852","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:54.637079Z","signature_b64":"vCNu+EqtaYPXckSNA0NiNOLrUJSi+ddppQhBvzKxsl3Z/lHJhOH1ZALZV7sJ3gFJVSRw4v3Le3ymAmjfQ5/JBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb3ee2e96bc848dfb7b6ac9bca0a0de35a417778c93fe7b12057cee01d8e852","last_reissued_at":"2026-05-18T00:51:54.636406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:54.636406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08292","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-18T00:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JBz32gitf1ATD+4S/Iu2qOxwmk/K2+wP7ma1x1TXYqBU+ri6al7dNGd7YUaLsMam2RHx/8VViMBYWuVrjTwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:26:45.377087Z"},"content_sha256":"f289f8689d6ca623980e25fdc97743ad5f315130f42313ec26bb971346f509ea","schema_version":"1.0","event_id":"sha256:f289f8689d6ca623980e25fdc97743ad5f315130f42313ec26bb971346f509ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F2Z64LUWXSCI3633NLE3ZIFA3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kneser ranks of random graphs and minimum difference representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ida Kantor, Zolt\\'an F\\\"uredi","submitted_at":"2017-01-28T14:18:12Z","abstract_excerpt":"Every graph $G=(V,E)$ is an induced subgraph of some Kneser graph of rank $k$, i.e., there is an assignment of (distinct) $k$-sets $v \\mapsto A_v$ to the vertices $v\\in V$ such that $A_u$ and $A_v$ are disjoint if and only if $uv\\in E$. The smallest such $k$ is called the Kneser rank of $G$ and denoted by $f_{\\rm Kneser}(G)$. As an application of a result of Frieze and Reed concerning the clique cover number of random graphs we show that for constant $0< p< 1$ there exist constants $c_i=c_i(p)>0$, $i=1,2$ such that with high probability \\[ c_1 n/(\\log n)< f_{\\rm Kneser}(G) < c_2 n/(\\log n). \\]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08292","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-18T00:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TtHCcdpi0PivXe2L0+qbp21/TBG8Mnt5GgR1+3sG6MxXFcQM0MXpc527B5O9AnJHHwIQxiEWQnbu/KDcVESaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:26:45.377736Z"},"content_sha256":"8b93d33a7bfd8127259cd4a9aa0c7d69b72a56880ff53306ade729e22a4e5ad4","schema_version":"1.0","event_id":"sha256:8b93d33a7bfd8127259cd4a9aa0c7d69b72a56880ff53306ade729e22a4e5ad4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2Z64LUWXSCI3633NLE3ZIFA3Y/bundle.json","state_url":"https://pith.science/pith/F2Z64LUWXSCI3633NLE3ZIFA3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2Z64LUWXSCI3633NLE3ZIFA3Y/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-01T03:26:45Z","links":{"resolver":"https://pith.science/pith/F2Z64LUWXSCI3633NLE3ZIFA3Y","bundle":"https://pith.science/pith/F2Z64LUWXSCI3633NLE3ZIFA3Y/bundle.json","state":"https://pith.science/pith/F2Z64LUWXSCI3633NLE3ZIFA3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2Z64LUWXSCI3633NLE3ZIFA3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F2Z64LUWXSCI3633NLE3ZIFA3Y","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":"b3d281c2f2c5aeb2c6678ef2e0b1d7317008a2da8ad59bd6cb583677358c8a8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T14:18:12Z","title_canon_sha256":"398f4a0526be14cb2565ff1c5d6d1798dc2f5043777cd0c9149e276025eaf4e2"},"schema_version":"1.0","source":{"id":"1701.08292","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08292","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08292v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08292","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"F2Z64LUWXSCI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F2Z64LUWXSCI3633","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F2Z64LUW","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:8b93d33a7bfd8127259cd4a9aa0c7d69b72a56880ff53306ade729e22a4e5ad4","target":"graph","created_at":"2026-05-18T00:51:54Z","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":"Every graph $G=(V,E)$ is an induced subgraph of some Kneser graph of rank $k$, i.e., there is an assignment of (distinct) $k$-sets $v \\mapsto A_v$ to the vertices $v\\in V$ such that $A_u$ and $A_v$ are disjoint if and only if $uv\\in E$. The smallest such $k$ is called the Kneser rank of $G$ and denoted by $f_{\\rm Kneser}(G)$. As an application of a result of Frieze and Reed concerning the clique cover number of random graphs we show that for constant $0< p< 1$ there exist constants $c_i=c_i(p)>0$, $i=1,2$ such that with high probability \\[ c_1 n/(\\log n)< f_{\\rm Kneser}(G) < c_2 n/(\\log n). \\]","authors_text":"Ida Kantor, Zolt\\'an F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T14:18:12Z","title":"Kneser ranks of random graphs and minimum difference representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08292","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:f289f8689d6ca623980e25fdc97743ad5f315130f42313ec26bb971346f509ea","target":"record","created_at":"2026-05-18T00:51:54Z","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":"b3d281c2f2c5aeb2c6678ef2e0b1d7317008a2da8ad59bd6cb583677358c8a8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-28T14:18:12Z","title_canon_sha256":"398f4a0526be14cb2565ff1c5d6d1798dc2f5043777cd0c9149e276025eaf4e2"},"schema_version":"1.0","source":{"id":"1701.08292","kind":"arxiv","version":1}},"canonical_sha256":"2eb3ee2e96bc848dfb7b6ac9bca0a0de35a417778c93fe7b12057cee01d8e852","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2eb3ee2e96bc848dfb7b6ac9bca0a0de35a417778c93fe7b12057cee01d8e852","first_computed_at":"2026-05-18T00:51:54.636406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:54.636406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCNu+EqtaYPXckSNA0NiNOLrUJSi+ddppQhBvzKxsl3Z/lHJhOH1ZALZV7sJ3gFJVSRw4v3Le3ymAmjfQ5/JBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:54.637079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08292","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f289f8689d6ca623980e25fdc97743ad5f315130f42313ec26bb971346f509ea","sha256:8b93d33a7bfd8127259cd4a9aa0c7d69b72a56880ff53306ade729e22a4e5ad4"],"state_sha256":"987413f80d663fc11219c212e9c538e7916b2b44b332f2aa4b212b0c11e1a852"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0V5Dw9VIgUMYbiv9cuhgj5whqmbSPz2uIFpRP8PolBCAxSMR0Qx4Jo103Lgoaz+KbQ3TljOOxmnYGMc9IsEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:26:45.381820Z","bundle_sha256":"7f4d2caf2d39efff5da87458cb877900a21af79a0a590183c9caa17b208da6a0"}}