{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U2ARCG5QGBH5RZJ6XB4VEOPT32","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":"58d3afbf90ec52a10b3cfba61018d8bd3e5afe302eb68e68a12198cb8960fed5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-16T15:26:51Z","title_canon_sha256":"2ed8a2a6e2eaaa238b0d1d280eaa6764818bdffda027400163d694e6d99d6544"},"schema_version":"1.0","source":{"id":"1210.4451","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4451","created_at":"2026-07-05T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4451v3","created_at":"2026-07-05T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4451","created_at":"2026-07-05T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"U2ARCG5QGBH5","created_at":"2026-07-05T01:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"U2ARCG5QGBH5RZJ6","created_at":"2026-07-05T01:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"U2ARCG5Q","created_at":"2026-07-05T01:17:54Z"}],"graph_snapshots":[{"event_id":"sha256:9ba19656de6938d615e39510d60bee9fc90f0b696c8684f12ad0136f52770e23","target":"graph","created_at":"2026-07-05T01:17:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1210.4451/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the distance between $x$ and $y$ increases. We call this a random graph with a linear embedding. We define a new graph parameter $\\Gamma^*$, which aims to measure the similarity of the graph to an instance of a random graph with a linear embedding. For a graph $G$, $\\Gamma^*(G)=0$ if and only if $G$ is a unit interval graph, and thus a deterministic example of a ","authors_text":"Huda Chuangpishit, Jeannette Janssen, Mahya Ghandehari, Matt Hurshman, Nauzer Kalyaniwalla","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-16T15:26:51Z","title":"Linear embeddings of graphs and graph limits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4451","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:f7bdbb18ffc802d732dc5287b80f798bb5c10c440fd1c884736df3c506a28361","target":"record","created_at":"2026-07-05T01:17:54Z","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":"58d3afbf90ec52a10b3cfba61018d8bd3e5afe302eb68e68a12198cb8960fed5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-16T15:26:51Z","title_canon_sha256":"2ed8a2a6e2eaaa238b0d1d280eaa6764818bdffda027400163d694e6d99d6544"},"schema_version":"1.0","source":{"id":"1210.4451","kind":"arxiv","version":3}},"canonical_sha256":"a681111bb0304fd8e53eb8795239f3de8fbd0064e4093ba33064893f3a1e4f89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a681111bb0304fd8e53eb8795239f3de8fbd0064e4093ba33064893f3a1e4f89","first_computed_at":"2026-07-05T01:17:54.049559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:54.049559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SB0RmJ4hwGlqkrSlb3mQCs2LYPrm4viL2ZRI4bd1NEPGVI0JVST+LknziO34gAkOFFehEOdalCo7bn7jA8RICA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:54.049919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4451","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7bdbb18ffc802d732dc5287b80f798bb5c10c440fd1c884736df3c506a28361","sha256:9ba19656de6938d615e39510d60bee9fc90f0b696c8684f12ad0136f52770e23"],"state_sha256":"91acea799f0cd1d05f0a641ca7efc1c1646f78834ab820f882458dd379e01312"}