{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WKOGUT2BHA65HX24MA3CO3S2ZD","short_pith_number":"pith:WKOGUT2B","canonical_record":{"source":{"id":"2506.01612","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.PR","submitted_at":"2025-06-02T12:51:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"84b66a0fd21c69212d130050b1af67f5c8bcec5928a61d547dc866a34568a96b","abstract_canon_sha256":"f5fda57c3a7acb64f4082be50807ffe0a8b886207fead585a0aed8decb0b7ad3"},"schema_version":"1.0"},"canonical_sha256":"b29c6a4f41383dd3df5c6036276e5ac8cf17ddab38e80c13d1b3605261ba7ec4","source":{"kind":"arxiv","id":"2506.01612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01612","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01612v1","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01612","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"WKOGUT2BHA65","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_16","alias_value":"WKOGUT2BHA65HX24","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_8","alias_value":"WKOGUT2B","created_at":"2026-07-05T11:14:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WKOGUT2BHA65HX24MA3CO3S2ZD","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01612","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.PR","submitted_at":"2025-06-02T12:51:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"84b66a0fd21c69212d130050b1af67f5c8bcec5928a61d547dc866a34568a96b","abstract_canon_sha256":"f5fda57c3a7acb64f4082be50807ffe0a8b886207fead585a0aed8decb0b7ad3"},"schema_version":"1.0"},"canonical_sha256":"b29c6a4f41383dd3df5c6036276e5ac8cf17ddab38e80c13d1b3605261ba7ec4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:16.809097Z","signature_b64":"o74yzCM4kLh25n0EcVAUptTn5VVOgEo1xZ3VxwNkwU8HsXzp9X9Hqvo6hbEw6SwmiH5SzooT9aQOYQoaq4QiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b29c6a4f41383dd3df5c6036276e5ac8cf17ddab38e80c13d1b3605261ba7ec4","last_reissued_at":"2026-07-05T11:14:16.808566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:16.808566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01612","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-07-05T11:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guhiUc+++3mee1/aYOs+wXK6/7zFPeDTqPvLLwtklrxlTqs4y++N0KWi1dkO5XjIURvJosGbD7DziARDDjBRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:38:32.217510Z"},"content_sha256":"8f9729cdf2042c85bc4c8039a01fd832dfed925e94ec3b26f47bb3f12e8078ef","schema_version":"1.0","event_id":"sha256:8f9729cdf2042c85bc4c8039a01fd832dfed925e94ec3b26f47bb3f12e8078ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WKOGUT2BHA65HX24MA3CO3S2ZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Percolation on random 2-lifts","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Paul Drouvill\\'e","submitted_at":"2025-06-02T12:51:17Z","abstract_excerpt":"Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a random $2$-lift of $G$ that may not be transitive but still probabilistically exhibit many properties of transitive graphs. Studying percolation in this context can help us test the reliability and robustness of our proofs methods in percolation theory. Our three main results on this model are the continuity of the critical parameter $p_c(G_q)$, for $q\\in(0,1)$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01612","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01612/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-05T11:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZDZJKE7FzK0wHu6g2Bzq4tMSOYTAmYhsq1IGCGzqN1+L/uYV24wLP+Gy+WGox0Zl8tfYluHz0WAY5vmcs4DAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:38:32.219058Z"},"content_sha256":"d2f818432bb6dfc4fe04f5d73e5bfb456fffcf89f84a1fbc5ff3f116eacb02c8","schema_version":"1.0","event_id":"sha256:d2f818432bb6dfc4fe04f5d73e5bfb456fffcf89f84a1fbc5ff3f116eacb02c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKOGUT2BHA65HX24MA3CO3S2ZD/bundle.json","state_url":"https://pith.science/pith/WKOGUT2BHA65HX24MA3CO3S2ZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKOGUT2BHA65HX24MA3CO3S2ZD/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-07T22:38:32Z","links":{"resolver":"https://pith.science/pith/WKOGUT2BHA65HX24MA3CO3S2ZD","bundle":"https://pith.science/pith/WKOGUT2BHA65HX24MA3CO3S2ZD/bundle.json","state":"https://pith.science/pith/WKOGUT2BHA65HX24MA3CO3S2ZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKOGUT2BHA65HX24MA3CO3S2ZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WKOGUT2BHA65HX24MA3CO3S2ZD","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":"f5fda57c3a7acb64f4082be50807ffe0a8b886207fead585a0aed8decb0b7ad3","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.PR","submitted_at":"2025-06-02T12:51:17Z","title_canon_sha256":"84b66a0fd21c69212d130050b1af67f5c8bcec5928a61d547dc866a34568a96b"},"schema_version":"1.0","source":{"id":"2506.01612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01612","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01612v1","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01612","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"WKOGUT2BHA65","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_16","alias_value":"WKOGUT2BHA65HX24","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_8","alias_value":"WKOGUT2B","created_at":"2026-07-05T11:14:16Z"}],"graph_snapshots":[{"event_id":"sha256:d2f818432bb6dfc4fe04f5d73e5bfb456fffcf89f84a1fbc5ff3f116eacb02c8","target":"graph","created_at":"2026-07-05T11:14:16Z","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/2506.01612/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a random $2$-lift of $G$ that may not be transitive but still probabilistically exhibit many properties of transitive graphs. Studying percolation in this context can help us test the reliability and robustness of our proofs methods in percolation theory. Our three main results on this model are the continuity of the critical parameter $p_c(G_q)$, for $q\\in(0,1)$, ","authors_text":"Paul Drouvill\\'e","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.PR","submitted_at":"2025-06-02T12:51:17Z","title":"Percolation on random 2-lifts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01612","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:8f9729cdf2042c85bc4c8039a01fd832dfed925e94ec3b26f47bb3f12e8078ef","target":"record","created_at":"2026-07-05T11:14:16Z","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":"f5fda57c3a7acb64f4082be50807ffe0a8b886207fead585a0aed8decb0b7ad3","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.PR","submitted_at":"2025-06-02T12:51:17Z","title_canon_sha256":"84b66a0fd21c69212d130050b1af67f5c8bcec5928a61d547dc866a34568a96b"},"schema_version":"1.0","source":{"id":"2506.01612","kind":"arxiv","version":1}},"canonical_sha256":"b29c6a4f41383dd3df5c6036276e5ac8cf17ddab38e80c13d1b3605261ba7ec4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b29c6a4f41383dd3df5c6036276e5ac8cf17ddab38e80c13d1b3605261ba7ec4","first_computed_at":"2026-07-05T11:14:16.808566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:16.808566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o74yzCM4kLh25n0EcVAUptTn5VVOgEo1xZ3VxwNkwU8HsXzp9X9Hqvo6hbEw6SwmiH5SzooT9aQOYQoaq4QiDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:16.809097Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f9729cdf2042c85bc4c8039a01fd832dfed925e94ec3b26f47bb3f12e8078ef","sha256:d2f818432bb6dfc4fe04f5d73e5bfb456fffcf89f84a1fbc5ff3f116eacb02c8"],"state_sha256":"b9bbe66ef40376944f5e186c38c3ffef59d8bdafadbf609ea554e27378df93b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFHZGyo+ocf56IDwg+kwJKIaAwt3RvfWRvw28vwFc5mqFlzgjUnKOBQGqOsFFmP4pCJXUaIzYA4Cn+207VUuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T22:38:32.225052Z","bundle_sha256":"e7ff56a0e9bad804452c1d19c4c7fbafc1ae2fdb60f776734040abc10092c443"}}