{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QAEYWLOMT2FBBCUXONQOZZWS72","short_pith_number":"pith:QAEYWLOM","schema_version":"1.0","canonical_sha256":"80098b2dcc9e8a108a977360ece6d2feb44ac99adfdeed860286f39a3c980b12","source":{"kind":"arxiv","id":"2112.04408","version":1},"attestation_state":"computed","paper":{"title":"Consistency of Spectral Seriation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaron Smith, Amine Natik","submitted_at":"2021-12-08T16:53:45Z","abstract_excerpt":"Consider a random graph $G$ of size $N$ constructed according to a \\textit{graphon} $w \\, : \\, [0,1]^{2} \\mapsto [0,1]$ as follows. First embed $N$ vertices $V = \\{v_1, v_2, \\ldots, v_N\\}$ into the interval $[0,1]$, then for each $i < j$ add an edge between $v_{i}, v_{j}$ with probability $w(v_{i}, v_{j})$. Given only the adjacency matrix of the graph, we might expect to be able to approximately reconstruct the permutation $\\sigma$ for which $v_{\\sigma(1)} < \\ldots < v_{\\sigma(N)}$ if $w$ satisfies the following \\textit{linear embedding} property introduced in [Janssen 2019]: for each $x$, $w("},"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":"2112.04408","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-12-08T16:53:45Z","cross_cats_sorted":["stat.CO","stat.TH"],"title_canon_sha256":"4b3e8b2c61a47ab07f72e1341960f173f2488d12e0473afbeda943e0402cffd4","abstract_canon_sha256":"efd0c64fb89f237a359cd5d5664bb575a385af92fd4542e2582796df1ee04283"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:39:09.312504Z","signature_b64":"9Szq7Yll+wvfTdZMxWVoDa0mRLkFBIdIvEA9o5F8Q9idB6Kv3nVrbmPtQabuEV1YdjomTKroojSzChIcW3B3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80098b2dcc9e8a108a977360ece6d2feb44ac99adfdeed860286f39a3c980b12","last_reissued_at":"2026-07-05T03:39:09.312127Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:39:09.312127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistency of Spectral Seriation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaron Smith, Amine Natik","submitted_at":"2021-12-08T16:53:45Z","abstract_excerpt":"Consider a random graph $G$ of size $N$ constructed according to a \\textit{graphon} $w \\, : \\, [0,1]^{2} \\mapsto [0,1]$ as follows. First embed $N$ vertices $V = \\{v_1, v_2, \\ldots, v_N\\}$ into the interval $[0,1]$, then for each $i < j$ add an edge between $v_{i}, v_{j}$ with probability $w(v_{i}, v_{j})$. Given only the adjacency matrix of the graph, we might expect to be able to approximately reconstruct the permutation $\\sigma$ for which $v_{\\sigma(1)} < \\ldots < v_{\\sigma(N)}$ if $w$ satisfies the following \\textit{linear embedding} property introduced in [Janssen 2019]: for each $x$, $w("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04408","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.04408/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":"2112.04408","created_at":"2026-07-05T03:39:09.312183+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.04408v1","created_at":"2026-07-05T03:39:09.312183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04408","created_at":"2026-07-05T03:39:09.312183+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAEYWLOMT2FB","created_at":"2026-07-05T03:39:09.312183+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAEYWLOMT2FBBCUX","created_at":"2026-07-05T03:39:09.312183+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAEYWLOM","created_at":"2026-07-05T03:39:09.312183+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.04168","citing_title":"Principal Curves In Metric Spaces And The Space Of Probability Measures","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72","json":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72.json","graph_json":"https://pith.science/api/pith-number/QAEYWLOMT2FBBCUXONQOZZWS72/graph.json","events_json":"https://pith.science/api/pith-number/QAEYWLOMT2FBBCUXONQOZZWS72/events.json","paper":"https://pith.science/paper/QAEYWLOM"},"agent_actions":{"view_html":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72","download_json":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72.json","view_paper":"https://pith.science/paper/QAEYWLOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.04408&json=true","fetch_graph":"https://pith.science/api/pith-number/QAEYWLOMT2FBBCUXONQOZZWS72/graph.json","fetch_events":"https://pith.science/api/pith-number/QAEYWLOMT2FBBCUXONQOZZWS72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/action/storage_attestation","attest_author":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/action/author_attestation","sign_citation":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/action/citation_signature","submit_replication":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/action/replication_record"}},"created_at":"2026-07-05T03:39:09.312183+00:00","updated_at":"2026-07-05T03:39:09.312183+00:00"}