{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BPCC6KOAN3KYSSOKLBJBWO62CP","short_pith_number":"pith:BPCC6KOA","canonical_record":{"source":{"id":"2403.01563","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-03T16:55:41Z","cross_cats_sorted":[],"title_canon_sha256":"76282094caf9710112a95b06faefcb2fa08365af4a167ac4295d9981e5d2ec06","abstract_canon_sha256":"4fac053e3093958c299baa37d87a0709e0b197a0abe4f51d5053a307fc262206"},"schema_version":"1.0"},"canonical_sha256":"0bc42f29c06ed58949ca58521b3bda13dfb0cb8798330e8040a215bfad0d4338","source":{"kind":"arxiv","id":"2403.01563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.01563","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"2403.01563v1","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01563","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"BPCC6KOAN3KY","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_16","alias_value":"BPCC6KOAN3KYSSOK","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_8","alias_value":"BPCC6KOA","created_at":"2026-07-05T07:51:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BPCC6KOAN3KYSSOKLBJBWO62CP","target":"record","payload":{"canonical_record":{"source":{"id":"2403.01563","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-03T16:55:41Z","cross_cats_sorted":[],"title_canon_sha256":"76282094caf9710112a95b06faefcb2fa08365af4a167ac4295d9981e5d2ec06","abstract_canon_sha256":"4fac053e3093958c299baa37d87a0709e0b197a0abe4f51d5053a307fc262206"},"schema_version":"1.0"},"canonical_sha256":"0bc42f29c06ed58949ca58521b3bda13dfb0cb8798330e8040a215bfad0d4338","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:48.865819Z","signature_b64":"2pM7ApkZwldePZWrukqYQfiRu1C1546SPuBAQTE5tq9XtDU856j31XIGZ5FJptU2PnSC2j1F8HZt//leb4ijAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bc42f29c06ed58949ca58521b3bda13dfb0cb8798330e8040a215bfad0d4338","last_reissued_at":"2026-07-05T07:51:48.865382Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:48.865382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.01563","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-07-05T07:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BefrM/EJaE7hj5A8kH/8c1xnwu5LTOEpZs2UC6X0mnCJqNh7y8MbjOtZDfbQjAzsG05q0Rck5YTgrvaqCszBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:08:14.127666Z"},"content_sha256":"2309fcf972eccd23e42b3c2d5a01f7c5a72c0220226ecbbf377bd15e88649a99","schema_version":"1.0","event_id":"sha256:2309fcf972eccd23e42b3c2d5a01f7c5a72c0220226ecbbf377bd15e88649a99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BPCC6KOAN3KYSSOKLBJBWO62CP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $k$-representation number of the random graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ayush Basu, Marcelo Sales, Vojt\\v{e}ch R\\\"odl","submitted_at":"2024-03-03T16:55:41Z","abstract_excerpt":"The $k$-representation number of a graph $G$ is the minimum cardinality of the system of vertex subsets with the property that every edge of $G$ is covered at least $k$ times while every non-edge is covered at most $(k-1)$ times. In particular, for $k=1$ this notion is equivalent to the clique number of a graph $G$. Extending results of Frieze and Reed, and Eaton and Grable, we study the $k$-representation number of $G(n,1/2)$. As a tool, we will prove a sharp concentration result counting the number of induced subgraphs of $G(n,1/2)$ with density $(\\frac{1}{2}+\\alpha)$. In Lemma 3.7, we will "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01563","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.01563/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZrUeCwhaBy2shaqGM1JIauQJrC1XiYna/2Z1XLkWlyEk1q/Ywm9fIovmcAFGP1D41Vb/1gK+TqLEi9jJG4AEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:08:14.128029Z"},"content_sha256":"115e81a999e110cf3ad457ebdc7a002c7d36296e8c4c1eed3e6045279531aa75","schema_version":"1.0","event_id":"sha256:115e81a999e110cf3ad457ebdc7a002c7d36296e8c4c1eed3e6045279531aa75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPCC6KOAN3KYSSOKLBJBWO62CP/bundle.json","state_url":"https://pith.science/pith/BPCC6KOAN3KYSSOKLBJBWO62CP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPCC6KOAN3KYSSOKLBJBWO62CP/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-07-06T18:08:14Z","links":{"resolver":"https://pith.science/pith/BPCC6KOAN3KYSSOKLBJBWO62CP","bundle":"https://pith.science/pith/BPCC6KOAN3KYSSOKLBJBWO62CP/bundle.json","state":"https://pith.science/pith/BPCC6KOAN3KYSSOKLBJBWO62CP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPCC6KOAN3KYSSOKLBJBWO62CP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BPCC6KOAN3KYSSOKLBJBWO62CP","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":"4fac053e3093958c299baa37d87a0709e0b197a0abe4f51d5053a307fc262206","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-03T16:55:41Z","title_canon_sha256":"76282094caf9710112a95b06faefcb2fa08365af4a167ac4295d9981e5d2ec06"},"schema_version":"1.0","source":{"id":"2403.01563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.01563","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"2403.01563v1","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01563","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"BPCC6KOAN3KY","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_16","alias_value":"BPCC6KOAN3KYSSOK","created_at":"2026-07-05T07:51:48Z"},{"alias_kind":"pith_short_8","alias_value":"BPCC6KOA","created_at":"2026-07-05T07:51:48Z"}],"graph_snapshots":[{"event_id":"sha256:115e81a999e110cf3ad457ebdc7a002c7d36296e8c4c1eed3e6045279531aa75","target":"graph","created_at":"2026-07-05T07:51:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.01563/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $k$-representation number of a graph $G$ is the minimum cardinality of the system of vertex subsets with the property that every edge of $G$ is covered at least $k$ times while every non-edge is covered at most $(k-1)$ times. In particular, for $k=1$ this notion is equivalent to the clique number of a graph $G$. Extending results of Frieze and Reed, and Eaton and Grable, we study the $k$-representation number of $G(n,1/2)$. As a tool, we will prove a sharp concentration result counting the number of induced subgraphs of $G(n,1/2)$ with density $(\\frac{1}{2}+\\alpha)$. In Lemma 3.7, we will ","authors_text":"Ayush Basu, Marcelo Sales, Vojt\\v{e}ch R\\\"odl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-03T16:55:41Z","title":"The $k$-representation number of the random graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01563","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:2309fcf972eccd23e42b3c2d5a01f7c5a72c0220226ecbbf377bd15e88649a99","target":"record","created_at":"2026-07-05T07:51:48Z","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":"4fac053e3093958c299baa37d87a0709e0b197a0abe4f51d5053a307fc262206","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-03-03T16:55:41Z","title_canon_sha256":"76282094caf9710112a95b06faefcb2fa08365af4a167ac4295d9981e5d2ec06"},"schema_version":"1.0","source":{"id":"2403.01563","kind":"arxiv","version":1}},"canonical_sha256":"0bc42f29c06ed58949ca58521b3bda13dfb0cb8798330e8040a215bfad0d4338","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bc42f29c06ed58949ca58521b3bda13dfb0cb8798330e8040a215bfad0d4338","first_computed_at":"2026-07-05T07:51:48.865382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:51:48.865382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2pM7ApkZwldePZWrukqYQfiRu1C1546SPuBAQTE5tq9XtDU856j31XIGZ5FJptU2PnSC2j1F8HZt//leb4ijAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:51:48.865819Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.01563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2309fcf972eccd23e42b3c2d5a01f7c5a72c0220226ecbbf377bd15e88649a99","sha256:115e81a999e110cf3ad457ebdc7a002c7d36296e8c4c1eed3e6045279531aa75"],"state_sha256":"5d4d0adaad3ae75a077cab3074df0d9498529d86fa19d25840322515462a518e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tRfIa1TBb91ZHQ7Yiygn+Kh4F4yvqgTrUT6mCYEI0GU78hV5GAvvbrAYrpx1ja4nNcd4WrLIApN/G1cIv9TAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:08:14.130008Z","bundle_sha256":"7bb79e39236e7a47534ffd45e37b2f7a1f76df8de1252a310f18b8db6f668418"}}