{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:23N7OA2GVZQU5KBWQTLVJDK4TV","short_pith_number":"pith:23N7OA2G","schema_version":"1.0","canonical_sha256":"d6dbf70346ae614ea83684d7548d5c9d5889c79260a5d14dfce31e9e2c04786d","source":{"kind":"arxiv","id":"2204.07376","version":2},"attestation_state":"computed","paper":{"title":"The semi-random tree process","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lyuben Lichev, Sofiya Burova","submitted_at":"2022-04-15T08:26:15Z","abstract_excerpt":"The online semi-random graph process is a one-player game which starts with the empty graph on $n$ vertices. At every round, a player (called Builder) is presented with a vertex $v$ chosen uniformly at random and independently from previous rounds, and constructs an edge of their choice that is incident to $v$. Inspired by recent advances on the semi-random graph process, we define a family of generalised online semi-random models.\n  We analyse a particular instance that shares similar features with the original semi-random graph process and determine the hitting times of the classical graph p"},"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":"2204.07376","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2022-04-15T08:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"a15d8487a9f62986886040130486e9d7b3332fda82305822a6c484e163a5ef68","abstract_canon_sha256":"5438fb3effe158739e583849ee8a21fe233fdcb3b79059853800eec1883d1f8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:03.562179Z","signature_b64":"HAftlQIFRnHbBxFmgRXCuKBiq6o70BrVIjH2yGR5tNBtC7P/BhWQbODMxawbZI7b5vehsoNToAtufzjCRrMyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6dbf70346ae614ea83684d7548d5c9d5889c79260a5d14dfce31e9e2c04786d","last_reissued_at":"2026-07-05T06:31:03.561716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:03.561716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The semi-random tree process","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lyuben Lichev, Sofiya Burova","submitted_at":"2022-04-15T08:26:15Z","abstract_excerpt":"The online semi-random graph process is a one-player game which starts with the empty graph on $n$ vertices. At every round, a player (called Builder) is presented with a vertex $v$ chosen uniformly at random and independently from previous rounds, and constructs an edge of their choice that is incident to $v$. Inspired by recent advances on the semi-random graph process, we define a family of generalised online semi-random models.\n  We analyse a particular instance that shares similar features with the original semi-random graph process and determine the hitting times of the classical graph p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.07376","kind":"arxiv","version":2},"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/2204.07376/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2204.07376","created_at":"2026-07-05T06:31:03.561772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.07376v2","created_at":"2026-07-05T06:31:03.561772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.07376","created_at":"2026-07-05T06:31:03.561772+00:00"},{"alias_kind":"pith_short_12","alias_value":"23N7OA2GVZQU","created_at":"2026-07-05T06:31:03.561772+00:00"},{"alias_kind":"pith_short_16","alias_value":"23N7OA2GVZQU5KBW","created_at":"2026-07-05T06:31:03.561772+00:00"},{"alias_kind":"pith_short_8","alias_value":"23N7OA2G","created_at":"2026-07-05T06:31:03.561772+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/23N7OA2GVZQU5KBWQTLVJDK4TV","json":"https://pith.science/pith/23N7OA2GVZQU5KBWQTLVJDK4TV.json","graph_json":"https://pith.science/api/pith-number/23N7OA2GVZQU5KBWQTLVJDK4TV/graph.json","events_json":"https://pith.science/api/pith-number/23N7OA2GVZQU5KBWQTLVJDK4TV/events.json","paper":"https://pith.science/paper/23N7OA2G"},"agent_actions":{"view_html":"https://pith.science/pith/23N7OA2GVZQU5KBWQTLVJDK4TV","download_json":"https://pith.science/pith/23N7OA2GVZQU5KBWQTLVJDK4TV.json","view_paper":"https://pith.science/paper/23N7OA2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.07376&json=true","fetch_graph":"https://pith.science/api/pith-number/23N7OA2GVZQU5KBWQTLVJDK4TV/graph.json","fetch_events":"https://pith.science/api/pith-number/23N7OA2GVZQU5KBWQTLVJDK4TV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23N7OA2GVZQU5KBWQTLVJDK4TV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23N7OA2GVZQU5KBWQTLVJDK4TV/action/storage_attestation","attest_author":"https://pith.science/pith/23N7OA2GVZQU5KBWQTLVJDK4TV/action/author_attestation","sign_citation":"https://pith.science/pith/23N7OA2GVZQU5KBWQTLVJDK4TV/action/citation_signature","submit_replication":"https://pith.science/pith/23N7OA2GVZQU5KBWQTLVJDK4TV/action/replication_record"}},"created_at":"2026-07-05T06:31:03.561772+00:00","updated_at":"2026-07-05T06:31:03.561772+00:00"}