{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:A6GPXORJC22MKWITZOHWLO4WTZ","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":"86f6bd1cfb51ef19d9137315004609816ab380d18bf71224b28c460f961c3525","cross_cats_sorted":["math.LO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T02:25:40Z","title_canon_sha256":"0a79570327be62bfc8fce22e55c38d8bb9f14f6413bbf36cf708b4fb2d63c6d0"},"schema_version":"1.0","source":{"id":"1108.4995","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4995","created_at":"2026-05-18T04:02:52Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4995v3","created_at":"2026-05-18T04:02:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4995","created_at":"2026-05-18T04:02:52Z"},{"alias_kind":"pith_short_12","alias_value":"A6GPXORJC22M","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A6GPXORJC22MKWIT","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A6GPXORJ","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:cee8a9b0d7693264639c8ee1bd49cddcc7e746d31c51f93a1a787cf9218f7717","target":"graph","created_at":"2026-05-18T04:02:52Z","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":"Given a set B of finite rooted graphs and a radius r as an input, we prove that it is undecidable to determine whether there exists a sequence (G_i) of finite bounded degree graphs such that the rooted r-radius neighbourhood of a random node of G_i is isomorphic to a rooted graph in B with probability tending to 1. Our proof implies a similar result for the case where the sequence (G_i) is replaced by a unimodular random graph.","authors_text":"Endre Cs\\'oka","cross_cats":["math.LO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T02:25:40Z","title":"An undecidability result on limits of sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4995","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:a24177ec14d52301b137ddf0d1c66a14b521b174a235d298e56ead0328dce6de","target":"record","created_at":"2026-05-18T04:02:52Z","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":"86f6bd1cfb51ef19d9137315004609816ab380d18bf71224b28c460f961c3525","cross_cats_sorted":["math.LO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-25T02:25:40Z","title_canon_sha256":"0a79570327be62bfc8fce22e55c38d8bb9f14f6413bbf36cf708b4fb2d63c6d0"},"schema_version":"1.0","source":{"id":"1108.4995","kind":"arxiv","version":3}},"canonical_sha256":"078cfbba2916b4c55913cb8f65bb969e6db58b9fc9166167649536dcdc055d57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"078cfbba2916b4c55913cb8f65bb969e6db58b9fc9166167649536dcdc055d57","first_computed_at":"2026-05-18T04:02:52.632854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:52.632854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PvEQcONCgyRqY4LUGVmiTWyuv9ra4rvvqTJ3Iu3pHCSR9sgmmUeRj0TE2UtpuCx8gIdY2LjAvV45kWXQCkFWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:52.633532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4995","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a24177ec14d52301b137ddf0d1c66a14b521b174a235d298e56ead0328dce6de","sha256:cee8a9b0d7693264639c8ee1bd49cddcc7e746d31c51f93a1a787cf9218f7717"],"state_sha256":"40776db431030610b4c62b3431770caceac5d6fa1090e503577f4c80ac0999d2"}