{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K4LPOYFNLMQL4QWACULM6U7XRU","short_pith_number":"pith:K4LPOYFN","schema_version":"1.0","canonical_sha256":"5716f760ad5b20be42c01516cf53f78d3bc55e53553492a696568ea1a506c647","source":{"kind":"arxiv","id":"1601.03714","version":3},"attestation_state":"computed","paper":{"title":"How to determine if a random graph with a fixed degree sequence has a giant component","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Bruce Reed, Dieter Rautenbach, Felix Joos, Guillem Perarnau","submitted_at":"2016-01-14T20:19:33Z","abstract_excerpt":"For a fixed degree sequence $\\mathcal{D}=(d_1,...,d_n)$, let $G(\\mathcal{D})$ be a uniformly chosen (simple) graph on $\\{1,...,n\\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\\mathcal{D})$ has a giant component with high probability, essentially imposing no conditions on $\\mathcal{D}$. We simply insist that the sum of the degrees in $\\mathcal{D}$ which are not 2 is at least $\\lambda(n)$ for some function $\\lambda$ going to infinity with $n$. This is a relatively minor technical condition, and when $\\mathcal{D}$ does not satisfy it, both the probability that $G"},"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":"1601.03714","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T20:19:33Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"6d8e24cee141f2fc0cb08925b7d2330557aca58dce521c78d98270974999a58f","abstract_canon_sha256":"0c555abfac689bf818cb9902393c049959c5c41e5edec15dfa9c8ace067dd4c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:51.987234Z","signature_b64":"x+SuMrr7wlrJEZ4eonVfH+Wn8RdfE0woe9uDrMzH430xRX1dJSBFtMryhL+JHF/edtCEnh4TrsXJLlQV/8cjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5716f760ad5b20be42c01516cf53f78d3bc55e53553492a696568ea1a506c647","last_reissued_at":"2026-05-18T00:51:51.986519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:51.986519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to determine if a random graph with a fixed degree sequence has a giant component","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Bruce Reed, Dieter Rautenbach, Felix Joos, Guillem Perarnau","submitted_at":"2016-01-14T20:19:33Z","abstract_excerpt":"For a fixed degree sequence $\\mathcal{D}=(d_1,...,d_n)$, let $G(\\mathcal{D})$ be a uniformly chosen (simple) graph on $\\{1,...,n\\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\\mathcal{D})$ has a giant component with high probability, essentially imposing no conditions on $\\mathcal{D}$. We simply insist that the sum of the degrees in $\\mathcal{D}$ which are not 2 is at least $\\lambda(n)$ for some function $\\lambda$ going to infinity with $n$. This is a relatively minor technical condition, and when $\\mathcal{D}$ does not satisfy it, both the probability that $G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03714","kind":"arxiv","version":3},"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":"1601.03714","created_at":"2026-05-18T00:51:51.986654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03714v3","created_at":"2026-05-18T00:51:51.986654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03714","created_at":"2026-05-18T00:51:51.986654+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4LPOYFNLMQL","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4LPOYFNLMQL4QWA","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4LPOYFN","created_at":"2026-05-18T12:30:25.849896+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/K4LPOYFNLMQL4QWACULM6U7XRU","json":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU.json","graph_json":"https://pith.science/api/pith-number/K4LPOYFNLMQL4QWACULM6U7XRU/graph.json","events_json":"https://pith.science/api/pith-number/K4LPOYFNLMQL4QWACULM6U7XRU/events.json","paper":"https://pith.science/paper/K4LPOYFN"},"agent_actions":{"view_html":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU","download_json":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU.json","view_paper":"https://pith.science/paper/K4LPOYFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03714&json=true","fetch_graph":"https://pith.science/api/pith-number/K4LPOYFNLMQL4QWACULM6U7XRU/graph.json","fetch_events":"https://pith.science/api/pith-number/K4LPOYFNLMQL4QWACULM6U7XRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/action/storage_attestation","attest_author":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/action/author_attestation","sign_citation":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/action/citation_signature","submit_replication":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/action/replication_record"}},"created_at":"2026-05-18T00:51:51.986654+00:00","updated_at":"2026-05-18T00:51:51.986654+00:00"}