{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U7THNRPYEIZRSW2HKL43IQ42OP","short_pith_number":"pith:U7THNRPY","canonical_record":{"source":{"id":"1312.4494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-16T20:09:35Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"481e1148f4765d60973d603da7b2ebd8f6c0dc8485067a02029dde3ff560e6fb","abstract_canon_sha256":"4ed7133480b35adcf08025537c71a3149d278a9c190157d93040ca79155d13d0"},"schema_version":"1.0"},"canonical_sha256":"a7e676c5f82233195b4752f9b4439a73c295aed43d56e630eeae109c35bae736","source":{"kind":"arxiv","id":"1312.4494","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4494","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4494v2","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4494","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"U7THNRPYEIZR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U7THNRPYEIZRSW2H","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U7THNRPY","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U7THNRPYEIZRSW2HKL43IQ42OP","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-16T20:09:35Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"481e1148f4765d60973d603da7b2ebd8f6c0dc8485067a02029dde3ff560e6fb","abstract_canon_sha256":"4ed7133480b35adcf08025537c71a3149d278a9c190157d93040ca79155d13d0"},"schema_version":"1.0"},"canonical_sha256":"a7e676c5f82233195b4752f9b4439a73c295aed43d56e630eeae109c35bae736","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:16.968793Z","signature_b64":"2yAwE0edicQgzjIaCIBpacnu4bPhKVAlWifYbQ1N03M4sTfulEokibGGpi+gr2LoWD3y0APGH1jXg77pUzrQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7e676c5f82233195b4752f9b4439a73c295aed43d56e630eeae109c35bae736","last_reissued_at":"2026-05-18T01:23:16.968236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:16.968236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4494","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-18T01:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YeSIu9bYB3YgzKCRG9xrisRyi/z2SuXU3d2zRq56W4ReC8YWthtkzoXRGDf3jGK90wDb+emsyKLVjeu7TJ+FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:36:06.196428Z"},"content_sha256":"b576645b778f3bf4489aa7c914e2a755c8908a28c48f464eab2360321aef0708","schema_version":"1.0","event_id":"sha256:b576645b778f3bf4489aa7c914e2a755c8908a28c48f464eab2360321aef0708"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U7THNRPYEIZRSW2HKL43IQ42OP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The densest subgraph problem in sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Justin Salez, Venkat Anantharam","submitted_at":"2013-12-16T20:09:35Z","abstract_excerpt":"We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erd\\H{o}s-R\\'{e}nyi model, where it settles a conjecture of Hajek [IEEE Trans. Inform. Theory 36 (1990) 1398-1414]. Our proof consists in extending the notion of balanced loads from finite graphs to their local weak limits, using unimodularity. This is a new illustration of the objective method described by Aldous and Steele [In Probability on Discrete Structures (2004) 1-72 Springer]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4494","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-18T01:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yynPbKrAW35GR05jOH5oNR0cuCakZbDSZeBzs8avy0C+AiAorxUifpZPVAfbBCh+/IujZmCo/Jbp94pF/sbvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:36:06.196976Z"},"content_sha256":"d92eeb9197b511582547693628d232f205cdadd628a2b2c4c0612c9b66156beb","schema_version":"1.0","event_id":"sha256:d92eeb9197b511582547693628d232f205cdadd628a2b2c4c0612c9b66156beb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/bundle.json","state_url":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7THNRPYEIZRSW2HKL43IQ42OP/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-09T13:36:06Z","links":{"resolver":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP","bundle":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/bundle.json","state":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7THNRPYEIZRSW2HKL43IQ42OP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U7THNRPYEIZRSW2HKL43IQ42OP","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":"4ed7133480b35adcf08025537c71a3149d278a9c190157d93040ca79155d13d0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-16T20:09:35Z","title_canon_sha256":"481e1148f4765d60973d603da7b2ebd8f6c0dc8485067a02029dde3ff560e6fb"},"schema_version":"1.0","source":{"id":"1312.4494","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4494","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4494v2","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4494","created_at":"2026-05-18T01:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"U7THNRPYEIZR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U7THNRPYEIZRSW2H","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U7THNRPY","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:d92eeb9197b511582547693628d232f205cdadd628a2b2c4c0612c9b66156beb","target":"graph","created_at":"2026-05-18T01:23:16Z","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 determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erd\\H{o}s-R\\'{e}nyi model, where it settles a conjecture of Hajek [IEEE Trans. Inform. Theory 36 (1990) 1398-1414]. Our proof consists in extending the notion of balanced loads from finite graphs to their local weak limits, using unimodularity. This is a new illustration of the objective method described by Aldous and Steele [In Probability on Discrete Structures (2004) 1-72 Springer].","authors_text":"Justin Salez, Venkat Anantharam","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-16T20:09:35Z","title":"The densest subgraph problem in sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4494","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:b576645b778f3bf4489aa7c914e2a755c8908a28c48f464eab2360321aef0708","target":"record","created_at":"2026-05-18T01:23:16Z","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":"4ed7133480b35adcf08025537c71a3149d278a9c190157d93040ca79155d13d0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-12-16T20:09:35Z","title_canon_sha256":"481e1148f4765d60973d603da7b2ebd8f6c0dc8485067a02029dde3ff560e6fb"},"schema_version":"1.0","source":{"id":"1312.4494","kind":"arxiv","version":2}},"canonical_sha256":"a7e676c5f82233195b4752f9b4439a73c295aed43d56e630eeae109c35bae736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7e676c5f82233195b4752f9b4439a73c295aed43d56e630eeae109c35bae736","first_computed_at":"2026-05-18T01:23:16.968236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:16.968236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2yAwE0edicQgzjIaCIBpacnu4bPhKVAlWifYbQ1N03M4sTfulEokibGGpi+gr2LoWD3y0APGH1jXg77pUzrQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:16.968793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4494","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b576645b778f3bf4489aa7c914e2a755c8908a28c48f464eab2360321aef0708","sha256:d92eeb9197b511582547693628d232f205cdadd628a2b2c4c0612c9b66156beb"],"state_sha256":"0defadb1ea2202d24deb5a6228e065c01f3f66ec4a3d5225e8e269f9baa12bd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4GDsVKU6yFzS1GQOlkj/jsMMqp7o/XoSFVIHdjYZdFgflZV0XT+w/rHra1tACu504tCBXmn5LYtadR0uMjNxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:36:06.199644Z","bundle_sha256":"3208aebc6b36606c799b74c59e5aa31754374310e5e5924ae2550222308e1abb"}}