{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SZIKDPQCDUK6DHGEPONEAXURQJ","short_pith_number":"pith:SZIKDPQC","schema_version":"1.0","canonical_sha256":"9650a1be021d15e19cc47b9a405e9182516d7c746f3440fa6a7e937e671ebbeb","source":{"kind":"arxiv","id":"1403.2911","version":1},"attestation_state":"computed","paper":{"title":"On String Graph Limits and the Structure of a Typical String Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew J. Uzzell, Svante Janson","submitted_at":"2014-03-12T12:47:54Z","abstract_excerpt":"We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We also prove similar results for several related graph classes."},"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":"1403.2911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T12:47:54Z","cross_cats_sorted":[],"title_canon_sha256":"27d429c464b4248a04b0a9b875b4a059dccee9d7da178ec4fca6935dc1c1fcd5","abstract_canon_sha256":"4582472cc41faaf76811d9b31833f7ce3892559c2c67a307b5c888d2b3aefd7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:33.609127Z","signature_b64":"0YW5tcXjdD8ToA7aJ+zw6oO2mVFbK7SPUEcy/SNJR4PARkFkzpcUaDO+qyEE+IS530v5lTIUvqyh31M41k9RAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9650a1be021d15e19cc47b9a405e9182516d7c746f3440fa6a7e937e671ebbeb","last_reissued_at":"2026-05-18T02:56:33.608268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:33.608268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On String Graph Limits and the Structure of a Typical String Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew J. Uzzell, Svante Janson","submitted_at":"2014-03-12T12:47:54Z","abstract_excerpt":"We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We also prove similar results for several related graph classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2911","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":"1403.2911","created_at":"2026-05-18T02:56:33.608424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2911v1","created_at":"2026-05-18T02:56:33.608424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2911","created_at":"2026-05-18T02:56:33.608424+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZIKDPQCDUK6","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZIKDPQCDUK6DHGE","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZIKDPQC","created_at":"2026-05-18T12:28:49.207871+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/SZIKDPQCDUK6DHGEPONEAXURQJ","json":"https://pith.science/pith/SZIKDPQCDUK6DHGEPONEAXURQJ.json","graph_json":"https://pith.science/api/pith-number/SZIKDPQCDUK6DHGEPONEAXURQJ/graph.json","events_json":"https://pith.science/api/pith-number/SZIKDPQCDUK6DHGEPONEAXURQJ/events.json","paper":"https://pith.science/paper/SZIKDPQC"},"agent_actions":{"view_html":"https://pith.science/pith/SZIKDPQCDUK6DHGEPONEAXURQJ","download_json":"https://pith.science/pith/SZIKDPQCDUK6DHGEPONEAXURQJ.json","view_paper":"https://pith.science/paper/SZIKDPQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2911&json=true","fetch_graph":"https://pith.science/api/pith-number/SZIKDPQCDUK6DHGEPONEAXURQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SZIKDPQCDUK6DHGEPONEAXURQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZIKDPQCDUK6DHGEPONEAXURQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZIKDPQCDUK6DHGEPONEAXURQJ/action/storage_attestation","attest_author":"https://pith.science/pith/SZIKDPQCDUK6DHGEPONEAXURQJ/action/author_attestation","sign_citation":"https://pith.science/pith/SZIKDPQCDUK6DHGEPONEAXURQJ/action/citation_signature","submit_replication":"https://pith.science/pith/SZIKDPQCDUK6DHGEPONEAXURQJ/action/replication_record"}},"created_at":"2026-05-18T02:56:33.608424+00:00","updated_at":"2026-05-18T02:56:33.608424+00:00"}