{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DV5TPS3I7WRKI43IBJPYVPJLUD","short_pith_number":"pith:DV5TPS3I","schema_version":"1.0","canonical_sha256":"1d7b37cb68fda2a473680a5f8abd2ba0d0c9f786a4cfecf645d5ec343795f3c5","source":{"kind":"arxiv","id":"1507.04389","version":3},"attestation_state":"computed","paper":{"title":"Uniform linear embeddings of graphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Huda Chuangpishit, Jeannette Janssen, Mahya Ghandehari","submitted_at":"2015-07-15T20:41:20Z","abstract_excerpt":"Let $w:[0,1]^2\\rightarrow [0,1]$ be a symmetric function, and consider the random process $G(n,w)$, where vertices are chosen from $[0,1]$ uniformly at random, and $w$ governs the edge formation probability. Such a random graph is said to have a linear embedding, if the probability of linking to a particular vertex $v$ decreases with distance. The rate of decrease, in general, depends on the particular vertex $v$. A linear embedding is called uniform if the probability of a link between two vertices depends only on the distance between them. In this article, we consider the question whether it"},"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":"1507.04389","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-15T20:41:20Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e9c5b5cd8c9f13d463827f0fe8f396d8e43e43d1e0b6565e8e0e6a354dcaacc4","abstract_canon_sha256":"33e1e0f3b1ddad2438f3ea04d8342f4d1ee58cd8ebaaa665a960cea2a77e2b3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:41.687374Z","signature_b64":"IZUC0PwRLJ2P+389JINICWACW2W37VSuNkuzQs+jXRNNULvxv8IurNhih6wd3WMpgzVo3ycZUYLNDole6H4wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d7b37cb68fda2a473680a5f8abd2ba0d0c9f786a4cfecf645d5ec343795f3c5","last_reissued_at":"2026-05-18T01:04:41.686989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:41.686989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform linear embeddings of graphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Huda Chuangpishit, Jeannette Janssen, Mahya Ghandehari","submitted_at":"2015-07-15T20:41:20Z","abstract_excerpt":"Let $w:[0,1]^2\\rightarrow [0,1]$ be a symmetric function, and consider the random process $G(n,w)$, where vertices are chosen from $[0,1]$ uniformly at random, and $w$ governs the edge formation probability. Such a random graph is said to have a linear embedding, if the probability of linking to a particular vertex $v$ decreases with distance. The rate of decrease, in general, depends on the particular vertex $v$. A linear embedding is called uniform if the probability of a link between two vertices depends only on the distance between them. In this article, we consider the question whether it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04389","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":""},"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":"1507.04389","created_at":"2026-05-18T01:04:41.687048+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04389v3","created_at":"2026-05-18T01:04:41.687048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04389","created_at":"2026-05-18T01:04:41.687048+00:00"},{"alias_kind":"pith_short_12","alias_value":"DV5TPS3I7WRK","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DV5TPS3I7WRKI43I","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DV5TPS3I","created_at":"2026-05-18T12:29:17.054201+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/DV5TPS3I7WRKI43IBJPYVPJLUD","json":"https://pith.science/pith/DV5TPS3I7WRKI43IBJPYVPJLUD.json","graph_json":"https://pith.science/api/pith-number/DV5TPS3I7WRKI43IBJPYVPJLUD/graph.json","events_json":"https://pith.science/api/pith-number/DV5TPS3I7WRKI43IBJPYVPJLUD/events.json","paper":"https://pith.science/paper/DV5TPS3I"},"agent_actions":{"view_html":"https://pith.science/pith/DV5TPS3I7WRKI43IBJPYVPJLUD","download_json":"https://pith.science/pith/DV5TPS3I7WRKI43IBJPYVPJLUD.json","view_paper":"https://pith.science/paper/DV5TPS3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04389&json=true","fetch_graph":"https://pith.science/api/pith-number/DV5TPS3I7WRKI43IBJPYVPJLUD/graph.json","fetch_events":"https://pith.science/api/pith-number/DV5TPS3I7WRKI43IBJPYVPJLUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DV5TPS3I7WRKI43IBJPYVPJLUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DV5TPS3I7WRKI43IBJPYVPJLUD/action/storage_attestation","attest_author":"https://pith.science/pith/DV5TPS3I7WRKI43IBJPYVPJLUD/action/author_attestation","sign_citation":"https://pith.science/pith/DV5TPS3I7WRKI43IBJPYVPJLUD/action/citation_signature","submit_replication":"https://pith.science/pith/DV5TPS3I7WRKI43IBJPYVPJLUD/action/replication_record"}},"created_at":"2026-05-18T01:04:41.687048+00:00","updated_at":"2026-05-18T01:04:41.687048+00:00"}