{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IHNO6DLR6EFBD3Q35SHIVDQ7YN","short_pith_number":"pith:IHNO6DLR","canonical_record":{"source":{"id":"2001.00882","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-01-03T16:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"9cd187a296e4a15f82461017a87510c59938cb0ff5d19379974f88b39191466f","abstract_canon_sha256":"dd8fded8784fa49232530980a8ac680ff740886356fa665b95c3d2ddfd3606b8"},"schema_version":"1.0"},"canonical_sha256":"41daef0d71f10a11ee1bec8e8a8e1fc3627a357881e956b881e272679b00cee2","source":{"kind":"arxiv","id":"2001.00882","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.00882","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"arxiv_version","alias_value":"2001.00882v3","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00882","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"pith_short_12","alias_value":"IHNO6DLR6EFB","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"pith_short_16","alias_value":"IHNO6DLR6EFBD3Q3","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"pith_short_8","alias_value":"IHNO6DLR","created_at":"2026-07-05T03:00:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IHNO6DLR6EFBD3Q35SHIVDQ7YN","target":"record","payload":{"canonical_record":{"source":{"id":"2001.00882","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-01-03T16:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"9cd187a296e4a15f82461017a87510c59938cb0ff5d19379974f88b39191466f","abstract_canon_sha256":"dd8fded8784fa49232530980a8ac680ff740886356fa665b95c3d2ddfd3606b8"},"schema_version":"1.0"},"canonical_sha256":"41daef0d71f10a11ee1bec8e8a8e1fc3627a357881e956b881e272679b00cee2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:44.679582Z","signature_b64":"aai8Xnmzsw6bnQEq/QrAsV1wBx+0uGXVLA9+qh4NOHvULGmYLZjcFuhzbyAvW/ksT1zKoajkeSmEmxoH4SeoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41daef0d71f10a11ee1bec8e8a8e1fc3627a357881e956b881e272679b00cee2","last_reissued_at":"2026-07-05T03:00:44.679140Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:44.679140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.00882","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-07-05T03:00:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvis8+T6Jpl184V4qB14hhqJgs2LqomVIuIjHlPyo2XAPUmyaisIXmE9/vfZr8icX35PQQM0s1du00g16KiACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T16:12:49.606028Z"},"content_sha256":"10c1a8fa4f62f98961bdea86c260385bd7ed345f4ae3a9b4736110fd49b79030","schema_version":"1.0","event_id":"sha256:10c1a8fa4f62f98961bdea86c260385bd7ed345f4ae3a9b4736110fd49b79030"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IHNO6DLR6EFBD3Q35SHIVDQ7YN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential bounds for inhomogeneous random graphs in a Gaussian case","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Othmane Safsafi","submitted_at":"2020-01-03T16:33:06Z","abstract_excerpt":"Rank 1 inhomogeneous random graphs are a natural generalization of Erd\\H{o}s R\\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of the nodes it is connecting. In this article, we give precise and uniform exponential bounds on the size, weight and surplus of rank 1 inhomogeneous random graphs where the weights of the nodes behave like a random variable with finite fourth moment. We focus on the case where the mean degree of a random node is slightly larger than 1, we call that case the bar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00882","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.00882/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:00:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tGEhB/XjreZL7MbMKPhXobYMudzrmfp7Yzukquf9LV5vPrDe1T3pwSU2vOEhrVxpWEBdn+lO6ouve8qu6u1kDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T16:12:49.606606Z"},"content_sha256":"71f6f49fb08548210c40996e139d0c0c5613fed51dc25ff9894c9a24c4561961","schema_version":"1.0","event_id":"sha256:71f6f49fb08548210c40996e139d0c0c5613fed51dc25ff9894c9a24c4561961"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHNO6DLR6EFBD3Q35SHIVDQ7YN/bundle.json","state_url":"https://pith.science/pith/IHNO6DLR6EFBD3Q35SHIVDQ7YN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHNO6DLR6EFBD3Q35SHIVDQ7YN/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-08-20T16:12:49Z","links":{"resolver":"https://pith.science/pith/IHNO6DLR6EFBD3Q35SHIVDQ7YN","bundle":"https://pith.science/pith/IHNO6DLR6EFBD3Q35SHIVDQ7YN/bundle.json","state":"https://pith.science/pith/IHNO6DLR6EFBD3Q35SHIVDQ7YN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHNO6DLR6EFBD3Q35SHIVDQ7YN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IHNO6DLR6EFBD3Q35SHIVDQ7YN","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":"dd8fded8784fa49232530980a8ac680ff740886356fa665b95c3d2ddfd3606b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-01-03T16:33:06Z","title_canon_sha256":"9cd187a296e4a15f82461017a87510c59938cb0ff5d19379974f88b39191466f"},"schema_version":"1.0","source":{"id":"2001.00882","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.00882","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"arxiv_version","alias_value":"2001.00882v3","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00882","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"pith_short_12","alias_value":"IHNO6DLR6EFB","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"pith_short_16","alias_value":"IHNO6DLR6EFBD3Q3","created_at":"2026-07-05T03:00:44Z"},{"alias_kind":"pith_short_8","alias_value":"IHNO6DLR","created_at":"2026-07-05T03:00:44Z"}],"graph_snapshots":[{"event_id":"sha256:71f6f49fb08548210c40996e139d0c0c5613fed51dc25ff9894c9a24c4561961","target":"graph","created_at":"2026-07-05T03:00:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.00882/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Rank 1 inhomogeneous random graphs are a natural generalization of Erd\\H{o}s R\\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of the nodes it is connecting. In this article, we give precise and uniform exponential bounds on the size, weight and surplus of rank 1 inhomogeneous random graphs where the weights of the nodes behave like a random variable with finite fourth moment. We focus on the case where the mean degree of a random node is slightly larger than 1, we call that case the bar","authors_text":"Othmane Safsafi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-01-03T16:33:06Z","title":"Exponential bounds for inhomogeneous random graphs in a Gaussian case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00882","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:10c1a8fa4f62f98961bdea86c260385bd7ed345f4ae3a9b4736110fd49b79030","target":"record","created_at":"2026-07-05T03:00:44Z","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":"dd8fded8784fa49232530980a8ac680ff740886356fa665b95c3d2ddfd3606b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-01-03T16:33:06Z","title_canon_sha256":"9cd187a296e4a15f82461017a87510c59938cb0ff5d19379974f88b39191466f"},"schema_version":"1.0","source":{"id":"2001.00882","kind":"arxiv","version":3}},"canonical_sha256":"41daef0d71f10a11ee1bec8e8a8e1fc3627a357881e956b881e272679b00cee2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41daef0d71f10a11ee1bec8e8a8e1fc3627a357881e956b881e272679b00cee2","first_computed_at":"2026-07-05T03:00:44.679140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:00:44.679140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aai8Xnmzsw6bnQEq/QrAsV1wBx+0uGXVLA9+qh4NOHvULGmYLZjcFuhzbyAvW/ksT1zKoajkeSmEmxoH4SeoBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:00:44.679582Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.00882","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10c1a8fa4f62f98961bdea86c260385bd7ed345f4ae3a9b4736110fd49b79030","sha256:71f6f49fb08548210c40996e139d0c0c5613fed51dc25ff9894c9a24c4561961"],"state_sha256":"37a4459121df3ce31b999805730316533950bf61bd8ad0c3fee5998e3087908f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zON98vvUtfMQI2g7O573G7FLcLn0KiR28rjtsBkFWNGfU83tMUVBvHmr2qcLu6scXYKx/QHrE8hA+RJY588zCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T16:12:49.610836Z","bundle_sha256":"8910992e19487e3665ae6edd32b3ea85596ab19a65b0dc79288666535d0df6d8"}}