{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:APFYL6U57X7KWDUB3VGSLQXU6U","short_pith_number":"pith:APFYL6U5","canonical_record":{"source":{"id":"1506.01083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-02T23:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"d7f0fc9f8dddbb89c4f1137267345220aab38192280d46ca1992fe448e98e0f4","abstract_canon_sha256":"96a1c6b60f9f930b5b359aa7b0114c2437e0b51e5b18f8d2af58c00f44f5723d"},"schema_version":"1.0"},"canonical_sha256":"03cb85fa9dfdfeab0e81dd4d25c2f4f52e5ebacf6a0e2364ff76edf5e29240c6","source":{"kind":"arxiv","id":"1506.01083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01083","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01083v1","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01083","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"APFYL6U57X7K","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"APFYL6U57X7KWDUB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"APFYL6U5","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:APFYL6U57X7KWDUB3VGSLQXU6U","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-02T23:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"d7f0fc9f8dddbb89c4f1137267345220aab38192280d46ca1992fe448e98e0f4","abstract_canon_sha256":"96a1c6b60f9f930b5b359aa7b0114c2437e0b51e5b18f8d2af58c00f44f5723d"},"schema_version":"1.0"},"canonical_sha256":"03cb85fa9dfdfeab0e81dd4d25c2f4f52e5ebacf6a0e2364ff76edf5e29240c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:26.429710Z","signature_b64":"LjcxYlyqK1hHBPCpweVxrbQHtXPQnfeFxjZyXHs+qHlABOzsFd/blxBIA0+aPKK4xfstxP2IcjYrCuT9Q8cCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03cb85fa9dfdfeab0e81dd4d25c2f4f52e5ebacf6a0e2364ff76edf5e29240c6","last_reissued_at":"2026-05-18T01:58:26.429289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:26.429289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01083","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-18T01:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f58C1UZ5NQ0/jtGLp6NDwwpDnusL5X2Mo+KTbneq8z1SH2Py59IvM71TQGYUMY/dGeXKqErCsvvbqDFkBPyXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:59:46.901672Z"},"content_sha256":"6094aeba0c96362e6153bdfa95380632f4f0433d1cd7242e4485a7671fca03f8","schema_version":"1.0","event_id":"sha256:6094aeba0c96362e6153bdfa95380632f4f0433d1cd7242e4485a7671fca03f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:APFYL6U57X7KWDUB3VGSLQXU6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dependent Random Graphs and Multiparty Pointer Jumping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Joshua Brody, Mario Sanchez","submitted_at":"2015-06-02T23:08:16Z","abstract_excerpt":"We initiate a study of a relaxed version of the standard Erdos-Renyi random graph model, where each edge may depend on a few other edges. We call such graphs \"dependent random graphs\". Our main result in this direction is a thorough understanding of the clique number of dependent random graphs. We also obtain bounds for the chromatic number. Surprisingly, many of the standard properties of random graphs also hold in this relaxed setting. We show that with high probability, a dependent random graph will contain a clique of size $\\frac{(1-o(1))\\log n}{\\log(1/p)}$, and the chromatic number will b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01083","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-18T01:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHE42gKGlK3kD1T2JBk8jIz5Fshx/A/nSzBtk23bEA+Zb20ewRaMdKE7voizmnLcxySpHUEUd3/zQbCd6AIiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:59:46.902218Z"},"content_sha256":"30b2946bc340d57ed123287433422af8bf061e091ba4469185a20597ca8e5580","schema_version":"1.0","event_id":"sha256:30b2946bc340d57ed123287433422af8bf061e091ba4469185a20597ca8e5580"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APFYL6U57X7KWDUB3VGSLQXU6U/bundle.json","state_url":"https://pith.science/pith/APFYL6U57X7KWDUB3VGSLQXU6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APFYL6U57X7KWDUB3VGSLQXU6U/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-03T18:59:46Z","links":{"resolver":"https://pith.science/pith/APFYL6U57X7KWDUB3VGSLQXU6U","bundle":"https://pith.science/pith/APFYL6U57X7KWDUB3VGSLQXU6U/bundle.json","state":"https://pith.science/pith/APFYL6U57X7KWDUB3VGSLQXU6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APFYL6U57X7KWDUB3VGSLQXU6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:APFYL6U57X7KWDUB3VGSLQXU6U","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":"96a1c6b60f9f930b5b359aa7b0114c2437e0b51e5b18f8d2af58c00f44f5723d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-02T23:08:16Z","title_canon_sha256":"d7f0fc9f8dddbb89c4f1137267345220aab38192280d46ca1992fe448e98e0f4"},"schema_version":"1.0","source":{"id":"1506.01083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01083","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01083v1","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01083","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"APFYL6U57X7K","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"APFYL6U57X7KWDUB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"APFYL6U5","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:30b2946bc340d57ed123287433422af8bf061e091ba4469185a20597ca8e5580","target":"graph","created_at":"2026-05-18T01:58:26Z","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":"We initiate a study of a relaxed version of the standard Erdos-Renyi random graph model, where each edge may depend on a few other edges. We call such graphs \"dependent random graphs\". Our main result in this direction is a thorough understanding of the clique number of dependent random graphs. We also obtain bounds for the chromatic number. Surprisingly, many of the standard properties of random graphs also hold in this relaxed setting. We show that with high probability, a dependent random graph will contain a clique of size $\\frac{(1-o(1))\\log n}{\\log(1/p)}$, and the chromatic number will b","authors_text":"Joshua Brody, Mario Sanchez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-02T23:08:16Z","title":"Dependent Random Graphs and Multiparty Pointer Jumping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01083","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:6094aeba0c96362e6153bdfa95380632f4f0433d1cd7242e4485a7671fca03f8","target":"record","created_at":"2026-05-18T01:58:26Z","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":"96a1c6b60f9f930b5b359aa7b0114c2437e0b51e5b18f8d2af58c00f44f5723d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-02T23:08:16Z","title_canon_sha256":"d7f0fc9f8dddbb89c4f1137267345220aab38192280d46ca1992fe448e98e0f4"},"schema_version":"1.0","source":{"id":"1506.01083","kind":"arxiv","version":1}},"canonical_sha256":"03cb85fa9dfdfeab0e81dd4d25c2f4f52e5ebacf6a0e2364ff76edf5e29240c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03cb85fa9dfdfeab0e81dd4d25c2f4f52e5ebacf6a0e2364ff76edf5e29240c6","first_computed_at":"2026-05-18T01:58:26.429289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:26.429289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LjcxYlyqK1hHBPCpweVxrbQHtXPQnfeFxjZyXHs+qHlABOzsFd/blxBIA0+aPKK4xfstxP2IcjYrCuT9Q8cCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:26.429710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6094aeba0c96362e6153bdfa95380632f4f0433d1cd7242e4485a7671fca03f8","sha256:30b2946bc340d57ed123287433422af8bf061e091ba4469185a20597ca8e5580"],"state_sha256":"70c34aa444eb6d0a2c15b40e435a9ad36fee2da02f40384351d2850e36f30ede"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3IBxLGJ3It0yMEIsed3zmUGuKUrlHDM0LE1QH/Fct/V8sIBqsuDNiRmrlMuIJbo5hOJEVGUkMefMYW/tePjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:59:46.904787Z","bundle_sha256":"44281a77680b2ecfaee90f749b8df79921f4b0f9383ff01d472395cd9b029983"}}