{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EKRZRZTQZTRSWNDRPTH5TULRJE","short_pith_number":"pith:EKRZRZTQ","schema_version":"1.0","canonical_sha256":"22a398e670cce32b34717ccfd9d171490e9973c731bbcacadb89a565e17d6c3a","source":{"kind":"arxiv","id":"1510.06574","version":1},"attestation_state":"computed","paper":{"title":"Random graphs and Lindstrom quantifiers for natural graph properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Saharon Shelah, Simi Haber","submitted_at":"2015-10-22T10:56:18Z","abstract_excerpt":"We study zero-one laws for random graphs. We focus on the following question that was asked by many: Given a graph property P, is there a language of graphs able to express P while obeying the zero-one law? Our results show that on the one hand there is a (regular) language able to express connectivity and k-colorability for any constant k and still obey the zero-one law. On the other hand we show that in any (semiregular) language strong enough to express Hamiltonicity one can interpret arithmetic and thus the zero-one law fails miserably. This answers a question of Blass and Harary."},"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":"1510.06574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-22T10:56:18Z","cross_cats_sorted":[],"title_canon_sha256":"b260792ade73da9ccf9ebb998dcc2b982e9771a65da61dbbce3b5c80af898c6a","abstract_canon_sha256":"76a68fa80265e792c6dc4bee07746ee1459a3a165bda12095253ec40eb29ebe6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:30.589151Z","signature_b64":"AYY/S1aMJCJejClnl+VDuOKIYAnkS2xoopnI+LVmHMraHR/8IPmuNFS0fKntS/e1M5bY7+YDE2jOQDhjFBHKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22a398e670cce32b34717ccfd9d171490e9973c731bbcacadb89a565e17d6c3a","last_reissued_at":"2026-05-18T01:29:30.588518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:30.588518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random graphs and Lindstrom quantifiers for natural graph properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Saharon Shelah, Simi Haber","submitted_at":"2015-10-22T10:56:18Z","abstract_excerpt":"We study zero-one laws for random graphs. We focus on the following question that was asked by many: Given a graph property P, is there a language of graphs able to express P while obeying the zero-one law? Our results show that on the one hand there is a (regular) language able to express connectivity and k-colorability for any constant k and still obey the zero-one law. On the other hand we show that in any (semiregular) language strong enough to express Hamiltonicity one can interpret arithmetic and thus the zero-one law fails miserably. This answers a question of Blass and Harary."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06574","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.06574","created_at":"2026-05-18T01:29:30.588602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06574v1","created_at":"2026-05-18T01:29:30.588602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06574","created_at":"2026-05-18T01:29:30.588602+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKRZRZTQZTRS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKRZRZTQZTRSWNDR","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKRZRZTQ","created_at":"2026-05-18T12:29:19.899920+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/EKRZRZTQZTRSWNDRPTH5TULRJE","json":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE.json","graph_json":"https://pith.science/api/pith-number/EKRZRZTQZTRSWNDRPTH5TULRJE/graph.json","events_json":"https://pith.science/api/pith-number/EKRZRZTQZTRSWNDRPTH5TULRJE/events.json","paper":"https://pith.science/paper/EKRZRZTQ"},"agent_actions":{"view_html":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE","download_json":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE.json","view_paper":"https://pith.science/paper/EKRZRZTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06574&json=true","fetch_graph":"https://pith.science/api/pith-number/EKRZRZTQZTRSWNDRPTH5TULRJE/graph.json","fetch_events":"https://pith.science/api/pith-number/EKRZRZTQZTRSWNDRPTH5TULRJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/action/storage_attestation","attest_author":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/action/author_attestation","sign_citation":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/action/citation_signature","submit_replication":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/action/replication_record"}},"created_at":"2026-05-18T01:29:30.588602+00:00","updated_at":"2026-05-18T01:29:30.588602+00:00"}