{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K4LPOYFNLMQL4QWACULM6U7XRU","short_pith_number":"pith:K4LPOYFN","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"},"canonical_sha256":"5716f760ad5b20be42c01516cf53f78d3bc55e53553492a696568ea1a506c647","source":{"kind":"arxiv","id":"1601.03714","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03714","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03714v3","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03714","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"K4LPOYFNLMQL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K4LPOYFNLMQL4QWA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K4LPOYFN","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K4LPOYFNLMQL4QWACULM6U7XRU","target":"record","payload":{"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"},"canonical_sha256":"5716f760ad5b20be42c01516cf53f78d3bc55e53553492a696568ea1a506c647","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"},"source_kind":"arxiv","source_id":"1601.03714","source_version":3,"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-18T00:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qvBo5hmi/GjBaZAh3YsrBGBA+2Xni6Zawq4WnXeK/j7nxe66qYVvIsWIALJbymqnNCmDs1ERuYrKgcELcpFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:50:12.901176Z"},"content_sha256":"98229934608a1942c22398db7264be1cb9745fd987ff5f23a22e7cdf6da8b9bf","schema_version":"1.0","event_id":"sha256:98229934608a1942c22398db7264be1cb9745fd987ff5f23a22e7cdf6da8b9bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K4LPOYFNLMQL4QWACULM6U7XRU","target":"graph","payload":{"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"},"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-18T00:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9TfAAvKd6S5W21YDUmiMYPhhYC6im3wk0z2CWvkPW4sILnsMC+GO/Dlg65s8F36K458g6OU1AjJiGl1AcH8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:50:12.901541Z"},"content_sha256":"892bcc58f127c272d7918cafab61352b94e4d3b7bd080a6d8db97e638c3c6ed7","schema_version":"1.0","event_id":"sha256:892bcc58f127c272d7918cafab61352b94e4d3b7bd080a6d8db97e638c3c6ed7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/bundle.json","state_url":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4LPOYFNLMQL4QWACULM6U7XRU/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-04T13:50:12Z","links":{"resolver":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU","bundle":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/bundle.json","state":"https://pith.science/pith/K4LPOYFNLMQL4QWACULM6U7XRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4LPOYFNLMQL4QWACULM6U7XRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K4LPOYFNLMQL4QWACULM6U7XRU","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":"0c555abfac689bf818cb9902393c049959c5c41e5edec15dfa9c8ace067dd4c0","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T20:19:33Z","title_canon_sha256":"6d8e24cee141f2fc0cb08925b7d2330557aca58dce521c78d98270974999a58f"},"schema_version":"1.0","source":{"id":"1601.03714","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03714","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03714v3","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03714","created_at":"2026-05-18T00:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"K4LPOYFNLMQL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K4LPOYFNLMQL4QWA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K4LPOYFN","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:892bcc58f127c272d7918cafab61352b94e4d3b7bd080a6d8db97e638c3c6ed7","target":"graph","created_at":"2026-05-18T00:51:51Z","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":"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","authors_text":"Bruce Reed, Dieter Rautenbach, Felix Joos, Guillem Perarnau","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T20:19:33Z","title":"How to determine if a random graph with a fixed degree sequence has a giant component"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03714","kind":"arxiv","version":3},"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:98229934608a1942c22398db7264be1cb9745fd987ff5f23a22e7cdf6da8b9bf","target":"record","created_at":"2026-05-18T00:51:51Z","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":"0c555abfac689bf818cb9902393c049959c5c41e5edec15dfa9c8ace067dd4c0","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T20:19:33Z","title_canon_sha256":"6d8e24cee141f2fc0cb08925b7d2330557aca58dce521c78d98270974999a58f"},"schema_version":"1.0","source":{"id":"1601.03714","kind":"arxiv","version":3}},"canonical_sha256":"5716f760ad5b20be42c01516cf53f78d3bc55e53553492a696568ea1a506c647","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5716f760ad5b20be42c01516cf53f78d3bc55e53553492a696568ea1a506c647","first_computed_at":"2026-05-18T00:51:51.986519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:51.986519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x+SuMrr7wlrJEZ4eonVfH+Wn8RdfE0woe9uDrMzH430xRX1dJSBFtMryhL+JHF/edtCEnh4TrsXJLlQV/8cjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:51.987234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03714","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98229934608a1942c22398db7264be1cb9745fd987ff5f23a22e7cdf6da8b9bf","sha256:892bcc58f127c272d7918cafab61352b94e4d3b7bd080a6d8db97e638c3c6ed7"],"state_sha256":"74f6e740f6a19a0471e523682bdb600db7bc6b23144c07d96f361384f93a8121"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmnZvM8TGUn/5Kai0EvWrF2dhpD1RPYM4tb/XUbacyPol8xIjS3ysGwygQr0CAUhZatcbI0UEBjRO5zEZvG5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:50:12.903483Z","bundle_sha256":"36f7accde1501347757b11a5d71ed3934a6c291ef83a866940761a2e80c9e1b2"}}