{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EKRZRZTQZTRSWNDRPTH5TULRJE","short_pith_number":"pith:EKRZRZTQ","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"},"canonical_sha256":"22a398e670cce32b34717ccfd9d171490e9973c731bbcacadb89a565e17d6c3a","source":{"kind":"arxiv","id":"1510.06574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06574","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06574v1","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06574","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"pith_short_12","alias_value":"EKRZRZTQZTRS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKRZRZTQZTRSWNDR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKRZRZTQ","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EKRZRZTQZTRSWNDRPTH5TULRJE","target":"record","payload":{"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"},"canonical_sha256":"22a398e670cce32b34717ccfd9d171490e9973c731bbcacadb89a565e17d6c3a","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"},"source_kind":"arxiv","source_id":"1510.06574","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-05-18T01:29:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kA+aCwrpL8Gq0Cazlcfy9fgcT7mK13GCHaf7ogMn3CxVbFHiJU5HXwC75r2PbkoGI+KfndBeXUqTsAnfZe74Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:15:28.739870Z"},"content_sha256":"4f705ef21835e13f583537474f39677111e31f2a833b34b200d7602731c8881f","schema_version":"1.0","event_id":"sha256:4f705ef21835e13f583537474f39677111e31f2a833b34b200d7602731c8881f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EKRZRZTQZTRSWNDRPTH5TULRJE","target":"graph","payload":{"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"},"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-18T01:29:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+0pVGoqXR0Zc6I1SYawGALc5D8Z27pPPPpPOWO42nWenGiEMUdgJXa7vnmJsXAKTkUdS5iNOi7jugzLMiSyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:15:28.740243Z"},"content_sha256":"cc65bc19330e67a5f64fad6035d8d5bb87a725f974d534f71bd2d6ce56a618e1","schema_version":"1.0","event_id":"sha256:cc65bc19330e67a5f64fad6035d8d5bb87a725f974d534f71bd2d6ce56a618e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/bundle.json","state_url":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/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-05-26T05:15:28Z","links":{"resolver":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE","bundle":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/bundle.json","state":"https://pith.science/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKRZRZTQZTRSWNDRPTH5TULRJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EKRZRZTQZTRSWNDRPTH5TULRJE","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":"76a68fa80265e792c6dc4bee07746ee1459a3a165bda12095253ec40eb29ebe6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-22T10:56:18Z","title_canon_sha256":"b260792ade73da9ccf9ebb998dcc2b982e9771a65da61dbbce3b5c80af898c6a"},"schema_version":"1.0","source":{"id":"1510.06574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06574","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06574v1","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06574","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"pith_short_12","alias_value":"EKRZRZTQZTRS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKRZRZTQZTRSWNDR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKRZRZTQ","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:cc65bc19330e67a5f64fad6035d8d5bb87a725f974d534f71bd2d6ce56a618e1","target":"graph","created_at":"2026-05-18T01:29:30Z","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 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.","authors_text":"Saharon Shelah, Simi Haber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-22T10:56:18Z","title":"Random graphs and Lindstrom quantifiers for natural graph properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06574","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:4f705ef21835e13f583537474f39677111e31f2a833b34b200d7602731c8881f","target":"record","created_at":"2026-05-18T01:29:30Z","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":"76a68fa80265e792c6dc4bee07746ee1459a3a165bda12095253ec40eb29ebe6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-22T10:56:18Z","title_canon_sha256":"b260792ade73da9ccf9ebb998dcc2b982e9771a65da61dbbce3b5c80af898c6a"},"schema_version":"1.0","source":{"id":"1510.06574","kind":"arxiv","version":1}},"canonical_sha256":"22a398e670cce32b34717ccfd9d171490e9973c731bbcacadb89a565e17d6c3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22a398e670cce32b34717ccfd9d171490e9973c731bbcacadb89a565e17d6c3a","first_computed_at":"2026-05-18T01:29:30.588518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:30.588518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AYY/S1aMJCJejClnl+VDuOKIYAnkS2xoopnI+LVmHMraHR/8IPmuNFS0fKntS/e1M5bY7+YDE2jOQDhjFBHKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:30.589151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f705ef21835e13f583537474f39677111e31f2a833b34b200d7602731c8881f","sha256:cc65bc19330e67a5f64fad6035d8d5bb87a725f974d534f71bd2d6ce56a618e1"],"state_sha256":"732defdb0470d663d26253b8621ad0fabadddb010912ab4b7e6550b45300b22f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1tDwlbl6Dff6W3KwlDROzpyvR4qpJ0YYXDIlv5I7eflR8w1ewO9AuTrgHAiNIp7cJj+fEDGeKoG/oG5Wl+xDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:15:28.742704Z","bundle_sha256":"b2a157b67dd51542e4d818351803c3fb245b3ac5e9dbad3e6dba4254b744f31e"}}