{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:75MAGVDD3T7CMCRPF2FGI4HHOF","short_pith_number":"pith:75MAGVDD","canonical_record":{"source":{"id":"1704.06683","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-21T19:08:22Z","cross_cats_sorted":["cs.DS","cs.LO","math.PR"],"title_canon_sha256":"e043bed4ffc1742c604498d1c0fe1d7a0f967a62a3c4a69ccaa6cb773c350724","abstract_canon_sha256":"5526c478ec15bf0606568371e6979d7731e4be86407d79e36ebd268319babb40"},"schema_version":"1.0"},"canonical_sha256":"ff58035463dcfe260a2f2e8a6470e77142e41391aa13d08e0738dc80a097b523","source":{"kind":"arxiv","id":"1704.06683","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06683","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06683v3","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06683","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"75MAGVDD3T7C","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"75MAGVDD3T7CMCRP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"75MAGVDD","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:75MAGVDD3T7CMCRPF2FGI4HHOF","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06683","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-21T19:08:22Z","cross_cats_sorted":["cs.DS","cs.LO","math.PR"],"title_canon_sha256":"e043bed4ffc1742c604498d1c0fe1d7a0f967a62a3c4a69ccaa6cb773c350724","abstract_canon_sha256":"5526c478ec15bf0606568371e6979d7731e4be86407d79e36ebd268319babb40"},"schema_version":"1.0"},"canonical_sha256":"ff58035463dcfe260a2f2e8a6470e77142e41391aa13d08e0738dc80a097b523","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:36.251174Z","signature_b64":"qS3WcM6XfMipnIpTGzmW6TOHZsQgKfKHzDl8r8KcLIn2xXXZjL+gPov/VtLrG0gPfvudhpmQQZTbQYBFmqKGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff58035463dcfe260a2f2e8a6470e77142e41391aa13d08e0738dc80a097b523","last_reissued_at":"2026-05-18T00:27:36.250514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:36.250514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06683","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-05-18T00:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phOMQ2iCbEd5HnFwd+8ieRqGTTh9pBHvxvc+gS+/SiB92zqHpcf7AnX/+NJ4e5huv5rjZ+CgP3D8l6gvzkt3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:21:14.935568Z"},"content_sha256":"a9e8bae3e698380c437d99b24dd7be844df8cd8dcd5a9cbad2bad255a292edf8","schema_version":"1.0","event_id":"sha256:a9e8bae3e698380c437d99b24dd7be844df8cd8dcd5a9cbad2bad255a292edf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:75MAGVDD3T7CMCRPF2FGI4HHOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shifting the Phase Transition Threshold for Random Graphs and 2-SAT using Degree Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LO","math.PR"],"primary_cat":"math.CO","authors_text":"Sergey Dovgal, Vlady Ravelomanana","submitted_at":"2017-04-21T19:08:22Z","abstract_excerpt":"We show that by restricting the degrees of the vertices of a graph to an arbitrary set \\( \\Delta \\), the threshold point $ \\alpha(\\Delta) $ of the phase transition for a random graph with $ n $ vertices and $ m = \\alpha(\\Delta) n $ edges can be either accelerated (e.g., $ \\alpha(\\Delta) \\approx 0.381 $ for $ \\Delta = \\{0,1,4,5\\} $) or postponed (e.g., $ \\alpha(\\{ 2^0, 2^1, \\cdots, 2^k, \\cdots \\}) \\approx 0.795 $) compared to a classical Erd\\H{o}s--R\\'{e}nyi random graph with $ \\alpha(\\mathbb Z_{\\geq 0}) = \\tfrac12 $. In particular, we prove that the probability of graph being nonplanar and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06683","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":""},"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:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pm6FCID1aQTIe/uIS+U6/UHHAPL8T2t2rItKHzspfEt3pLx4OafKjA3qovsizgr8VtMD7uwQwo0qf6TD+Oz8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:21:14.935927Z"},"content_sha256":"204419ccc15c742f290c1fa01b19645b0d1ed82b5fefe6f0f468179926dd17bd","schema_version":"1.0","event_id":"sha256:204419ccc15c742f290c1fa01b19645b0d1ed82b5fefe6f0f468179926dd17bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/bundle.json","state_url":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/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-06-25T09:21:14Z","links":{"resolver":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF","bundle":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/bundle.json","state":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:75MAGVDD3T7CMCRPF2FGI4HHOF","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":"5526c478ec15bf0606568371e6979d7731e4be86407d79e36ebd268319babb40","cross_cats_sorted":["cs.DS","cs.LO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-21T19:08:22Z","title_canon_sha256":"e043bed4ffc1742c604498d1c0fe1d7a0f967a62a3c4a69ccaa6cb773c350724"},"schema_version":"1.0","source":{"id":"1704.06683","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06683","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06683v3","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06683","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"75MAGVDD3T7C","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"75MAGVDD3T7CMCRP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"75MAGVDD","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:204419ccc15c742f290c1fa01b19645b0d1ed82b5fefe6f0f468179926dd17bd","target":"graph","created_at":"2026-05-18T00:27:36Z","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 show that by restricting the degrees of the vertices of a graph to an arbitrary set \\( \\Delta \\), the threshold point $ \\alpha(\\Delta) $ of the phase transition for a random graph with $ n $ vertices and $ m = \\alpha(\\Delta) n $ edges can be either accelerated (e.g., $ \\alpha(\\Delta) \\approx 0.381 $ for $ \\Delta = \\{0,1,4,5\\} $) or postponed (e.g., $ \\alpha(\\{ 2^0, 2^1, \\cdots, 2^k, \\cdots \\}) \\approx 0.795 $) compared to a classical Erd\\H{o}s--R\\'{e}nyi random graph with $ \\alpha(\\mathbb Z_{\\geq 0}) = \\tfrac12 $. In particular, we prove that the probability of graph being nonplanar and the","authors_text":"Sergey Dovgal, Vlady Ravelomanana","cross_cats":["cs.DS","cs.LO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-21T19:08:22Z","title":"Shifting the Phase Transition Threshold for Random Graphs and 2-SAT using Degree Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06683","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:a9e8bae3e698380c437d99b24dd7be844df8cd8dcd5a9cbad2bad255a292edf8","target":"record","created_at":"2026-05-18T00:27:36Z","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":"5526c478ec15bf0606568371e6979d7731e4be86407d79e36ebd268319babb40","cross_cats_sorted":["cs.DS","cs.LO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-21T19:08:22Z","title_canon_sha256":"e043bed4ffc1742c604498d1c0fe1d7a0f967a62a3c4a69ccaa6cb773c350724"},"schema_version":"1.0","source":{"id":"1704.06683","kind":"arxiv","version":3}},"canonical_sha256":"ff58035463dcfe260a2f2e8a6470e77142e41391aa13d08e0738dc80a097b523","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff58035463dcfe260a2f2e8a6470e77142e41391aa13d08e0738dc80a097b523","first_computed_at":"2026-05-18T00:27:36.250514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:36.250514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qS3WcM6XfMipnIpTGzmW6TOHZsQgKfKHzDl8r8KcLIn2xXXZjL+gPov/VtLrG0gPfvudhpmQQZTbQYBFmqKGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:36.251174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06683","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9e8bae3e698380c437d99b24dd7be844df8cd8dcd5a9cbad2bad255a292edf8","sha256:204419ccc15c742f290c1fa01b19645b0d1ed82b5fefe6f0f468179926dd17bd"],"state_sha256":"1aea9fc84721fa575c8112f939cb3ec5a95175cde618e1c48ae3590472431361"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DUzyxqaTi2rFkXMWsAwu2iaw0Oy6LugxERrpHuKFVso82BKzXnfmpJcwy25j1V+lplWBgw4CI9d6938mNiHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:21:14.937883Z","bundle_sha256":"57aaa139edbcbfc7ec0a4fb3d15b8d86edb2a58015d4392c2790c3893b23211c"}}