{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:U7THNRPYEIZRSW2HKL43IQ42OP","short_pith_number":"pith:U7THNRPY","schema_version":"1.0","canonical_sha256":"a7e676c5f82233195b4752f9b4439a73c295aed43d56e630eeae109c35bae736","source":{"kind":"arxiv","id":"1312.4494","version":2},"attestation_state":"computed","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]."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.4494","created_at":"2026-05-18T01:23:16.968329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4494v2","created_at":"2026-05-18T01:23:16.968329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4494","created_at":"2026-05-18T01:23:16.968329+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7THNRPYEIZR","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7THNRPYEIZRSW2H","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7THNRPY","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP","json":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP.json","graph_json":"https://pith.science/api/pith-number/U7THNRPYEIZRSW2HKL43IQ42OP/graph.json","events_json":"https://pith.science/api/pith-number/U7THNRPYEIZRSW2HKL43IQ42OP/events.json","paper":"https://pith.science/paper/U7THNRPY"},"agent_actions":{"view_html":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP","download_json":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP.json","view_paper":"https://pith.science/paper/U7THNRPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4494&json=true","fetch_graph":"https://pith.science/api/pith-number/U7THNRPYEIZRSW2HKL43IQ42OP/graph.json","fetch_events":"https://pith.science/api/pith-number/U7THNRPYEIZRSW2HKL43IQ42OP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/action/storage_attestation","attest_author":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/action/author_attestation","sign_citation":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/action/citation_signature","submit_replication":"https://pith.science/pith/U7THNRPYEIZRSW2HKL43IQ42OP/action/replication_record"}},"created_at":"2026-05-18T01:23:16.968329+00:00","updated_at":"2026-05-18T01:23:16.968329+00:00"}