{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:HGS4QKEDCBCCFC5A4S4DSJMLSY","short_pith_number":"pith:HGS4QKED","schema_version":"1.0","canonical_sha256":"39a5c828831044228ba0e4b839258b961b5e4a73738c3e23eaf585344ebe5f16","source":{"kind":"arxiv","id":"math/9501221","version":1},"attestation_state":"computed","paper":{"title":"Convergence in homogeneous random graphs","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Saharon Shelah, Tomasz {\\L}uczak","submitted_at":"1995-01-15T00:00:00Z","abstract_excerpt":"For a sequence p=(p(1),p(2), ...) let G(n,p) denote the random graph with vertex set {1,2, ...,n} in which two vertices i, j are adjacent with probability p(|i-j|), independently for each pair. We study how the convergence of probabilities of first order properties of G(n,p), can be affected by the behaviour of p and the strength of the language we use."},"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":"math/9501221","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"1995-01-15T00:00:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7f2dfb9d4b98874430e5ec018f6f707d8d47f3c915d86bc67ad4f5ed719dbd1a","abstract_canon_sha256":"6a9df5dbbef168782d800ecb27e9cef36edede42e2e343c27dc5b504f4e2eab9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:50.622208Z","signature_b64":"hdiH8NPJhnPPZVa0RyJUpH0Uy/4VWlv+AG2UZ9l61zkes+Y4jqc6tX1RqPFSd+Nb1893YD1w6J3Bt0FZvAz7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39a5c828831044228ba0e4b839258b961b5e4a73738c3e23eaf585344ebe5f16","last_reissued_at":"2026-05-18T01:05:50.621435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:50.621435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence in homogeneous random graphs","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Saharon Shelah, Tomasz {\\L}uczak","submitted_at":"1995-01-15T00:00:00Z","abstract_excerpt":"For a sequence p=(p(1),p(2), ...) let G(n,p) denote the random graph with vertex set {1,2, ...,n} in which two vertices i, j are adjacent with probability p(|i-j|), independently for each pair. We study how the convergence of probabilities of first order properties of G(n,p), can be affected by the behaviour of p and the strength of the language we use."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9501221","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":"math/9501221","created_at":"2026-05-18T01:05:50.621558+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9501221v1","created_at":"2026-05-18T01:05:50.621558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9501221","created_at":"2026-05-18T01:05:50.621558+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGS4QKEDCBCC","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGS4QKEDCBCCFC5A","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGS4QKED","created_at":"2026-05-18T12:25:47.700082+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/HGS4QKEDCBCCFC5A4S4DSJMLSY","json":"https://pith.science/pith/HGS4QKEDCBCCFC5A4S4DSJMLSY.json","graph_json":"https://pith.science/api/pith-number/HGS4QKEDCBCCFC5A4S4DSJMLSY/graph.json","events_json":"https://pith.science/api/pith-number/HGS4QKEDCBCCFC5A4S4DSJMLSY/events.json","paper":"https://pith.science/paper/HGS4QKED"},"agent_actions":{"view_html":"https://pith.science/pith/HGS4QKEDCBCCFC5A4S4DSJMLSY","download_json":"https://pith.science/pith/HGS4QKEDCBCCFC5A4S4DSJMLSY.json","view_paper":"https://pith.science/paper/HGS4QKED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9501221&json=true","fetch_graph":"https://pith.science/api/pith-number/HGS4QKEDCBCCFC5A4S4DSJMLSY/graph.json","fetch_events":"https://pith.science/api/pith-number/HGS4QKEDCBCCFC5A4S4DSJMLSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGS4QKEDCBCCFC5A4S4DSJMLSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGS4QKEDCBCCFC5A4S4DSJMLSY/action/storage_attestation","attest_author":"https://pith.science/pith/HGS4QKEDCBCCFC5A4S4DSJMLSY/action/author_attestation","sign_citation":"https://pith.science/pith/HGS4QKEDCBCCFC5A4S4DSJMLSY/action/citation_signature","submit_replication":"https://pith.science/pith/HGS4QKEDCBCCFC5A4S4DSJMLSY/action/replication_record"}},"created_at":"2026-05-18T01:05:50.621558+00:00","updated_at":"2026-05-18T01:05:50.621558+00:00"}