{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:75MAGVDD3T7CMCRPF2FGI4HHOF","short_pith_number":"pith:75MAGVDD","schema_version":"1.0","canonical_sha256":"ff58035463dcfe260a2f2e8a6470e77142e41391aa13d08e0738dc80a097b523","source":{"kind":"arxiv","id":"1704.06683","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.06683","created_at":"2026-05-18T00:27:36.250611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06683v3","created_at":"2026-05-18T00:27:36.250611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06683","created_at":"2026-05-18T00:27:36.250611+00:00"},{"alias_kind":"pith_short_12","alias_value":"75MAGVDD3T7C","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"75MAGVDD3T7CMCRP","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"75MAGVDD","created_at":"2026-05-18T12:31:03.183658+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/75MAGVDD3T7CMCRPF2FGI4HHOF","json":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF.json","graph_json":"https://pith.science/api/pith-number/75MAGVDD3T7CMCRPF2FGI4HHOF/graph.json","events_json":"https://pith.science/api/pith-number/75MAGVDD3T7CMCRPF2FGI4HHOF/events.json","paper":"https://pith.science/paper/75MAGVDD"},"agent_actions":{"view_html":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF","download_json":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF.json","view_paper":"https://pith.science/paper/75MAGVDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06683&json=true","fetch_graph":"https://pith.science/api/pith-number/75MAGVDD3T7CMCRPF2FGI4HHOF/graph.json","fetch_events":"https://pith.science/api/pith-number/75MAGVDD3T7CMCRPF2FGI4HHOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/action/storage_attestation","attest_author":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/action/author_attestation","sign_citation":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/action/citation_signature","submit_replication":"https://pith.science/pith/75MAGVDD3T7CMCRPF2FGI4HHOF/action/replication_record"}},"created_at":"2026-05-18T00:27:36.250611+00:00","updated_at":"2026-05-18T00:27:36.250611+00:00"}