{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7NXHYKO3MP5ZIDPX2RA4UZORUI","short_pith_number":"pith:7NXHYKO3","canonical_record":{"source":{"id":"1407.6248","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-17T16:25:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0d4c4d7f703a1fd6a575826a2b773b81efa2e2df4319054e6c6477363a7d5ce2","abstract_canon_sha256":"251b59b8b6d62bca0400bcf957867c5f031759e56a08a1ba208db91a77fff3b0"},"schema_version":"1.0"},"canonical_sha256":"fb6e7c29db63fb940df7d441ca65d1a236fe99eb271c4ebdef418362f4c91704","source":{"kind":"arxiv","id":"1407.6248","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6248","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6248v3","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6248","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"pith_short_12","alias_value":"7NXHYKO3MP5Z","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7NXHYKO3MP5ZIDPX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7NXHYKO3","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7NXHYKO3MP5ZIDPX2RA4UZORUI","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6248","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-17T16:25:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0d4c4d7f703a1fd6a575826a2b773b81efa2e2df4319054e6c6477363a7d5ce2","abstract_canon_sha256":"251b59b8b6d62bca0400bcf957867c5f031759e56a08a1ba208db91a77fff3b0"},"schema_version":"1.0"},"canonical_sha256":"fb6e7c29db63fb940df7d441ca65d1a236fe99eb271c4ebdef418362f4c91704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:22.703125Z","signature_b64":"RvhLSSD/doFhnZhutND76aE5qmJUQepBYLjuMU4OfNMelycHWVj9yX5rxLhaRIjaPu6iqptSSjmpxE/NkoWeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb6e7c29db63fb940df7d441ca65d1a236fe99eb271c4ebdef418362f4c91704","last_reissued_at":"2026-05-18T01:35:22.702524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:22.702524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6248","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-18T01:35:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdR03tO1QdTr4Tdm2Amd8qyZnJ0T6+/uUWbqTW1U7KotPPHbyTsGtR+PEUN60iRyIZLayTUy7fuewOrFeyTiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:20:51.134218Z"},"content_sha256":"035553bfa3ab551a7c637084a60d550af6b24ef5ae57e6a9ef38eed98849fec0","schema_version":"1.0","event_id":"sha256:035553bfa3ab551a7c637084a60d550af6b24ef5ae57e6a9ef38eed98849fec0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7NXHYKO3MP5ZIDPX2RA4UZORUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The phase transition in the multi-type binomial random graph $G(\\mathbf{n},P)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Ang\\'elica Pach\\'on, Christoph Koch, Mihyun Kang","submitted_at":"2014-07-17T16:25:30Z","abstract_excerpt":"We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\\mathbf{n},P)$ every vertex has one of two types, the vector $\\mathbf{n}$ describes the number of vertices of each type, and any edge $\\{u,v\\}$ is present independently with a probability that is given by an entry of the probability matrix $P$ according to the types of $u$ and $v.$ We prove that in the weakly supercritical regime, i.e. if the distance to the critical point of the phase transition is given by an $\\va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6248","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-18T01:35:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cg+rQ2TIn+6v4Cc1trq9aiSpfNus9UnHK7Zp25AjG0F1l+pLceCCK1SB0cP8gr00Tg1CiVuonUDUc/bsI/obBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:20:51.134879Z"},"content_sha256":"5e34d0eb9a6b2794d5e70f081fc719d4d42cce2e7e0f5d6e8d25f5fc8ce436d8","schema_version":"1.0","event_id":"sha256:5e34d0eb9a6b2794d5e70f081fc719d4d42cce2e7e0f5d6e8d25f5fc8ce436d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NXHYKO3MP5ZIDPX2RA4UZORUI/bundle.json","state_url":"https://pith.science/pith/7NXHYKO3MP5ZIDPX2RA4UZORUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NXHYKO3MP5ZIDPX2RA4UZORUI/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-05-31T20:20:51Z","links":{"resolver":"https://pith.science/pith/7NXHYKO3MP5ZIDPX2RA4UZORUI","bundle":"https://pith.science/pith/7NXHYKO3MP5ZIDPX2RA4UZORUI/bundle.json","state":"https://pith.science/pith/7NXHYKO3MP5ZIDPX2RA4UZORUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NXHYKO3MP5ZIDPX2RA4UZORUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7NXHYKO3MP5ZIDPX2RA4UZORUI","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":"251b59b8b6d62bca0400bcf957867c5f031759e56a08a1ba208db91a77fff3b0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-17T16:25:30Z","title_canon_sha256":"0d4c4d7f703a1fd6a575826a2b773b81efa2e2df4319054e6c6477363a7d5ce2"},"schema_version":"1.0","source":{"id":"1407.6248","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6248","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6248v3","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6248","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"pith_short_12","alias_value":"7NXHYKO3MP5Z","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7NXHYKO3MP5ZIDPX","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7NXHYKO3","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:5e34d0eb9a6b2794d5e70f081fc719d4d42cce2e7e0f5d6e8d25f5fc8ce436d8","target":"graph","created_at":"2026-05-18T01:35:22Z","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 size of the largest component in the $2$-type binomial random graph $G(\\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\\mathbf{n},P)$ every vertex has one of two types, the vector $\\mathbf{n}$ describes the number of vertices of each type, and any edge $\\{u,v\\}$ is present independently with a probability that is given by an entry of the probability matrix $P$ according to the types of $u$ and $v.$ We prove that in the weakly supercritical regime, i.e. if the distance to the critical point of the phase transition is given by an $\\va","authors_text":"Ang\\'elica Pach\\'on, Christoph Koch, Mihyun Kang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-17T16:25:30Z","title":"The phase transition in the multi-type binomial random graph $G(\\mathbf{n},P)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6248","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:035553bfa3ab551a7c637084a60d550af6b24ef5ae57e6a9ef38eed98849fec0","target":"record","created_at":"2026-05-18T01:35:22Z","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":"251b59b8b6d62bca0400bcf957867c5f031759e56a08a1ba208db91a77fff3b0","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-17T16:25:30Z","title_canon_sha256":"0d4c4d7f703a1fd6a575826a2b773b81efa2e2df4319054e6c6477363a7d5ce2"},"schema_version":"1.0","source":{"id":"1407.6248","kind":"arxiv","version":3}},"canonical_sha256":"fb6e7c29db63fb940df7d441ca65d1a236fe99eb271c4ebdef418362f4c91704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb6e7c29db63fb940df7d441ca65d1a236fe99eb271c4ebdef418362f4c91704","first_computed_at":"2026-05-18T01:35:22.702524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:22.702524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RvhLSSD/doFhnZhutND76aE5qmJUQepBYLjuMU4OfNMelycHWVj9yX5rxLhaRIjaPu6iqptSSjmpxE/NkoWeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:22.703125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6248","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:035553bfa3ab551a7c637084a60d550af6b24ef5ae57e6a9ef38eed98849fec0","sha256:5e34d0eb9a6b2794d5e70f081fc719d4d42cce2e7e0f5d6e8d25f5fc8ce436d8"],"state_sha256":"3148e3120c10964cb14a6437448d893f9c933560fde57856c1c109551dde1cee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/USP+GXWqs682hwvmIQrOVldnB1yslVtKF9aNmgx5QR1dUR+bS387/lpFXGmUL7gR8GWf5/0iYVd5XijdTPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:20:51.138193Z","bundle_sha256":"ed177e0096c2e48bd9b14d56980e8c6e176aeddcdcf026f01ef2ecf109a87d01"}}