{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DTAYLPAIXUZMX6AMXDWSMUOAYJ","short_pith_number":"pith:DTAYLPAI","canonical_record":{"source":{"id":"1408.4268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-19T09:47:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"673e5196f5e753ecde5029fcdb106c2c426cb54da77b3fc3f63dbaddb9e63cb4","abstract_canon_sha256":"dc8a84152cc6447be7b584fcebefd5302836f1e3a4142dc887b9f1e2d0583369"},"schema_version":"1.0"},"canonical_sha256":"1cc185bc08bd32cbf80cb8ed2651c0c26b6a108597645e76b2de520b5f40d1fa","source":{"kind":"arxiv","id":"1408.4268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4268","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4268v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4268","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"DTAYLPAIXUZM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DTAYLPAIXUZMX6AM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DTAYLPAI","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DTAYLPAIXUZMX6AMXDWSMUOAYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-19T09:47:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"673e5196f5e753ecde5029fcdb106c2c426cb54da77b3fc3f63dbaddb9e63cb4","abstract_canon_sha256":"dc8a84152cc6447be7b584fcebefd5302836f1e3a4142dc887b9f1e2d0583369"},"schema_version":"1.0"},"canonical_sha256":"1cc185bc08bd32cbf80cb8ed2651c0c26b6a108597645e76b2de520b5f40d1fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:10.023593Z","signature_b64":"cAlNAyPN8puf6LQ3w+XEyTWl7MDe+XKL/2Qtz4fx0Ybm9hBFBhg1q49sXuoGLpuKjdNkYYTDMvm2btX7MuHSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cc185bc08bd32cbf80cb8ed2651c0c26b6a108597645e76b2de520b5f40d1fa","last_reissued_at":"2026-05-18T00:50:10.023110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:10.023110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4268","source_version":1,"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:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMhkHPzdMGHeFPYX61Flj5Cu/sLo99SnpfduvYESFmMR9O2EsqgTMlJ+XvJjwzs7qSB3oShH/RdbG9YnSrJ8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:15:14.903014Z"},"content_sha256":"8a63eff9f644d790408f2ee4fe4b34ada0914d53c5e872783dab332332d68b6a","schema_version":"1.0","event_id":"sha256:8a63eff9f644d790408f2ee4fe4b34ada0914d53c5e872783dab332332d68b6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DTAYLPAIXUZMX6AMXDWSMUOAYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic degree distribution of a duplication-deletion random graph model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Erik Th\\\"ornblad","submitted_at":"2014-08-19T09:47:48Z","abstract_excerpt":"We study a discrete-time duplication-deletion random graph model and analyse its asymptotic degree distribution. The random graphs consists of disjoint cliques. In each time step either a new vertex is brought in with probability $0<p<1$ and attached to an existing clique, chosen with probability proportional to the clique size, or all the edges of a random vertex are deleted with probability $1-p$. We prove almost sure convergence of the asymptotic degree distribution and find its exact values in terms of a hypergeometric integral, expressed in terms of the parameter $p$. In the regime $0<p<\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4268","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"},"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:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODByMDqUZy05nB6iTDqqy20KMizeBl6HTxNCxG/1kw5gOruIt4RfYXwdITRn6aBLFMP/abHhr+Q/zzuw3Q/eBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:15:14.903500Z"},"content_sha256":"fe3c54917af7885d0fef85328adbe2754729dc7573007b6af12a4d8912eb184f","schema_version":"1.0","event_id":"sha256:fe3c54917af7885d0fef85328adbe2754729dc7573007b6af12a4d8912eb184f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTAYLPAIXUZMX6AMXDWSMUOAYJ/bundle.json","state_url":"https://pith.science/pith/DTAYLPAIXUZMX6AMXDWSMUOAYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTAYLPAIXUZMX6AMXDWSMUOAYJ/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-31T12:15:14Z","links":{"resolver":"https://pith.science/pith/DTAYLPAIXUZMX6AMXDWSMUOAYJ","bundle":"https://pith.science/pith/DTAYLPAIXUZMX6AMXDWSMUOAYJ/bundle.json","state":"https://pith.science/pith/DTAYLPAIXUZMX6AMXDWSMUOAYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTAYLPAIXUZMX6AMXDWSMUOAYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DTAYLPAIXUZMX6AMXDWSMUOAYJ","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":"dc8a84152cc6447be7b584fcebefd5302836f1e3a4142dc887b9f1e2d0583369","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-19T09:47:48Z","title_canon_sha256":"673e5196f5e753ecde5029fcdb106c2c426cb54da77b3fc3f63dbaddb9e63cb4"},"schema_version":"1.0","source":{"id":"1408.4268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4268","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4268v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4268","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"DTAYLPAIXUZM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DTAYLPAIXUZMX6AM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DTAYLPAI","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:fe3c54917af7885d0fef85328adbe2754729dc7573007b6af12a4d8912eb184f","target":"graph","created_at":"2026-05-18T00:50:10Z","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 study a discrete-time duplication-deletion random graph model and analyse its asymptotic degree distribution. The random graphs consists of disjoint cliques. In each time step either a new vertex is brought in with probability $0<p<1$ and attached to an existing clique, chosen with probability proportional to the clique size, or all the edges of a random vertex are deleted with probability $1-p$. We prove almost sure convergence of the asymptotic degree distribution and find its exact values in terms of a hypergeometric integral, expressed in terms of the parameter $p$. In the regime $0<p<\\","authors_text":"Erik Th\\\"ornblad","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-19T09:47:48Z","title":"Asymptotic degree distribution of a duplication-deletion random graph model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4268","kind":"arxiv","version":1},"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:8a63eff9f644d790408f2ee4fe4b34ada0914d53c5e872783dab332332d68b6a","target":"record","created_at":"2026-05-18T00:50:10Z","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":"dc8a84152cc6447be7b584fcebefd5302836f1e3a4142dc887b9f1e2d0583369","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-08-19T09:47:48Z","title_canon_sha256":"673e5196f5e753ecde5029fcdb106c2c426cb54da77b3fc3f63dbaddb9e63cb4"},"schema_version":"1.0","source":{"id":"1408.4268","kind":"arxiv","version":1}},"canonical_sha256":"1cc185bc08bd32cbf80cb8ed2651c0c26b6a108597645e76b2de520b5f40d1fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cc185bc08bd32cbf80cb8ed2651c0c26b6a108597645e76b2de520b5f40d1fa","first_computed_at":"2026-05-18T00:50:10.023110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:10.023110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAlNAyPN8puf6LQ3w+XEyTWl7MDe+XKL/2Qtz4fx0Ybm9hBFBhg1q49sXuoGLpuKjdNkYYTDMvm2btX7MuHSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:10.023593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a63eff9f644d790408f2ee4fe4b34ada0914d53c5e872783dab332332d68b6a","sha256:fe3c54917af7885d0fef85328adbe2754729dc7573007b6af12a4d8912eb184f"],"state_sha256":"edae18d606ee0ca03e9dca888a148c03176edf599b12820afd024b85089d9229"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCpUrRvZDeLF4aoOa0/J4rfYD4CUZ5TDlQULXH4spx09vD3NDwVl92UNrwupVrgMv/xxILYzY/wkZcJyjV4EAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:15:14.905907Z","bundle_sha256":"66ba507a88a8b141fad7750f707225e65c1dbd2a14de696d06d080177541fac9"}}