{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:3ZUWQP4HIUSJCGWJ6FBZXRCE4R","short_pith_number":"pith:3ZUWQP4H","schema_version":"1.0","canonical_sha256":"de69683f874524911ac9f1439bc444e4522e3b478916e8350da2f74524e1100f","source":{"kind":"arxiv","id":"0905.0434","version":1},"attestation_state":"computed","paper":{"title":"Duality in inhomogeneous random graphs, and the cut metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Oliver Riordan, Svante Janson","submitted_at":"2009-05-04T17:56:27Z","abstract_excerpt":"The classical random graph model $G(n,\\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved for various models; they are useful since it is often much easier to study the subcritical model than to directly study small components in the supercritical model. Here we prove a duality principle of this type for a very general class of random graphs with independence between the edges, defined by convergence of the matrices of edge probabilities in the "},"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":"0905.0434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-04T17:56:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"c071c9e35a3471b122c3dfa5e480067d495905a8fe50bb12680f9f82cc3f6c40","abstract_canon_sha256":"1a63c779cca9f68e4167d0c184058f18ff0685806f67d1c82f54db4052cca256"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:36.457437Z","signature_b64":"CcHe686JU9onxIbsrga01hW2pSwHn6y7QKuqEOcI6AdwXAXT+e1Jo+kewA4leMo6c+jLcwS6cIB7UuR/xTvvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de69683f874524911ac9f1439bc444e4522e3b478916e8350da2f74524e1100f","last_reissued_at":"2026-05-18T04:09:36.457002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:36.457002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Duality in inhomogeneous random graphs, and the cut metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Oliver Riordan, Svante Janson","submitted_at":"2009-05-04T17:56:27Z","abstract_excerpt":"The classical random graph model $G(n,\\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved for various models; they are useful since it is often much easier to study the subcritical model than to directly study small components in the supercritical model. Here we prove a duality principle of this type for a very general class of random graphs with independence between the edges, defined by convergence of the matrices of edge probabilities in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0434","kind":"arxiv","version":1},"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":"0905.0434","created_at":"2026-05-18T04:09:36.457061+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.0434v1","created_at":"2026-05-18T04:09:36.457061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0434","created_at":"2026-05-18T04:09:36.457061+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZUWQP4HIUSJ","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZUWQP4HIUSJCGWJ","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZUWQP4H","created_at":"2026-05-18T12:25:58.018023+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/3ZUWQP4HIUSJCGWJ6FBZXRCE4R","json":"https://pith.science/pith/3ZUWQP4HIUSJCGWJ6FBZXRCE4R.json","graph_json":"https://pith.science/api/pith-number/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/graph.json","events_json":"https://pith.science/api/pith-number/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/events.json","paper":"https://pith.science/paper/3ZUWQP4H"},"agent_actions":{"view_html":"https://pith.science/pith/3ZUWQP4HIUSJCGWJ6FBZXRCE4R","download_json":"https://pith.science/pith/3ZUWQP4HIUSJCGWJ6FBZXRCE4R.json","view_paper":"https://pith.science/paper/3ZUWQP4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.0434&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/action/storage_attestation","attest_author":"https://pith.science/pith/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/action/author_attestation","sign_citation":"https://pith.science/pith/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/action/citation_signature","submit_replication":"https://pith.science/pith/3ZUWQP4HIUSJCGWJ6FBZXRCE4R/action/replication_record"}},"created_at":"2026-05-18T04:09:36.457061+00:00","updated_at":"2026-05-18T04:09:36.457061+00:00"}