{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U2ARCG5QGBH5RZJ6XB4VEOPT32","short_pith_number":"pith:U2ARCG5Q","schema_version":"1.0","canonical_sha256":"a681111bb0304fd8e53eb8795239f3de8fbd0064e4093ba33064893f3a1e4f89","source":{"kind":"arxiv","id":"1210.4451","version":3},"attestation_state":"computed","paper":{"title":"Linear embeddings of graphs and graph limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Huda Chuangpishit, Jeannette Janssen, Mahya Ghandehari, Matt Hurshman, Nauzer Kalyaniwalla","submitted_at":"2012-10-16T15:26:51Z","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 "},"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":"1210.4451","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-16T15:26:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2ed8a2a6e2eaaa238b0d1d280eaa6764818bdffda027400163d694e6d99d6544","abstract_canon_sha256":"58d3afbf90ec52a10b3cfba61018d8bd3e5afe302eb68e68a12198cb8960fed5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:54.049919Z","signature_b64":"SB0RmJ4hwGlqkrSlb3mQCs2LYPrm4viL2ZRI4bd1NEPGVI0JVST+LknziO34gAkOFFehEOdalCo7bn7jA8RICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a681111bb0304fd8e53eb8795239f3de8fbd0064e4093ba33064893f3a1e4f89","last_reissued_at":"2026-07-05T01:17:54.049559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:54.049559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear embeddings of graphs and graph limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Huda Chuangpishit, Jeannette Janssen, Mahya Ghandehari, Matt Hurshman, Nauzer Kalyaniwalla","submitted_at":"2012-10-16T15:26:51Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4451","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1210.4451/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1210.4451","created_at":"2026-07-05T01:17:54.049621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4451v3","created_at":"2026-07-05T01:17:54.049621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4451","created_at":"2026-07-05T01:17:54.049621+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2ARCG5QGBH5","created_at":"2026-07-05T01:17:54.049621+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2ARCG5QGBH5RZJ6","created_at":"2026-07-05T01:17:54.049621+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2ARCG5Q","created_at":"2026-07-05T01:17:54.049621+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/U2ARCG5QGBH5RZJ6XB4VEOPT32","json":"https://pith.science/pith/U2ARCG5QGBH5RZJ6XB4VEOPT32.json","graph_json":"https://pith.science/api/pith-number/U2ARCG5QGBH5RZJ6XB4VEOPT32/graph.json","events_json":"https://pith.science/api/pith-number/U2ARCG5QGBH5RZJ6XB4VEOPT32/events.json","paper":"https://pith.science/paper/U2ARCG5Q"},"agent_actions":{"view_html":"https://pith.science/pith/U2ARCG5QGBH5RZJ6XB4VEOPT32","download_json":"https://pith.science/pith/U2ARCG5QGBH5RZJ6XB4VEOPT32.json","view_paper":"https://pith.science/paper/U2ARCG5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4451&json=true","fetch_graph":"https://pith.science/api/pith-number/U2ARCG5QGBH5RZJ6XB4VEOPT32/graph.json","fetch_events":"https://pith.science/api/pith-number/U2ARCG5QGBH5RZJ6XB4VEOPT32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2ARCG5QGBH5RZJ6XB4VEOPT32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2ARCG5QGBH5RZJ6XB4VEOPT32/action/storage_attestation","attest_author":"https://pith.science/pith/U2ARCG5QGBH5RZJ6XB4VEOPT32/action/author_attestation","sign_citation":"https://pith.science/pith/U2ARCG5QGBH5RZJ6XB4VEOPT32/action/citation_signature","submit_replication":"https://pith.science/pith/U2ARCG5QGBH5RZJ6XB4VEOPT32/action/replication_record"}},"created_at":"2026-07-05T01:17:54.049621+00:00","updated_at":"2026-07-05T01:17:54.049621+00:00"}