{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:QAEYWLOMT2FBBCUXONQOZZWS72","short_pith_number":"pith:QAEYWLOM","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"},"canonical_sha256":"80098b2dcc9e8a108a977360ece6d2feb44ac99adfdeed860286f39a3c980b12","source":{"kind":"arxiv","id":"2112.04408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.04408","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2112.04408v1","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04408","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"QAEYWLOMT2FB","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"pith_short_16","alias_value":"QAEYWLOMT2FBBCUX","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"pith_short_8","alias_value":"QAEYWLOM","created_at":"2026-07-05T03:39:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:QAEYWLOMT2FBBCUXONQOZZWS72","target":"record","payload":{"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"},"canonical_sha256":"80098b2dcc9e8a108a977360ece6d2feb44ac99adfdeed860286f39a3c980b12","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"},"source_kind":"arxiv","source_id":"2112.04408","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXRJKKAXRyP/lGae4GNnQ3nWv9KbaGXZaosMZ/Gz0DQv9c12z3UcSV8nyYgYDYcabRtR7+Mh1Ygkdl52ZSAZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:39:53.298887Z"},"content_sha256":"530827b32b3c4f9517a0f2b2900cf859a84fdd8be6fdadb0a46bbd78ad3ba0e9","schema_version":"1.0","event_id":"sha256:530827b32b3c4f9517a0f2b2900cf859a84fdd8be6fdadb0a46bbd78ad3ba0e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:QAEYWLOMT2FBBCUXONQOZZWS72","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wyb6bju0FzhqXBx1yrdo5rWT68dAvAACH0MnqBy60Wahar6IDtRsSoZos2hmduhxXS3TtIFCvteCtaQykfUuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:39:53.299797Z"},"content_sha256":"6aa6e607a6b7149af9a2d786e35293f388ee0fc4915dfd768254bd09f757bf81","schema_version":"1.0","event_id":"sha256:6aa6e607a6b7149af9a2d786e35293f388ee0fc4915dfd768254bd09f757bf81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/bundle.json","state_url":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAEYWLOMT2FBBCUXONQOZZWS72/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T13:39:53Z","links":{"resolver":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72","bundle":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/bundle.json","state":"https://pith.science/pith/QAEYWLOMT2FBBCUXONQOZZWS72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAEYWLOMT2FBBCUXONQOZZWS72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:QAEYWLOMT2FBBCUXONQOZZWS72","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":"efd0c64fb89f237a359cd5d5664bb575a385af92fd4542e2582796df1ee04283","cross_cats_sorted":["stat.CO","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-12-08T16:53:45Z","title_canon_sha256":"4b3e8b2c61a47ab07f72e1341960f173f2488d12e0473afbeda943e0402cffd4"},"schema_version":"1.0","source":{"id":"2112.04408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.04408","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2112.04408v1","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04408","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"QAEYWLOMT2FB","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"pith_short_16","alias_value":"QAEYWLOMT2FBBCUX","created_at":"2026-07-05T03:39:09Z"},{"alias_kind":"pith_short_8","alias_value":"QAEYWLOM","created_at":"2026-07-05T03:39:09Z"}],"graph_snapshots":[{"event_id":"sha256:6aa6e607a6b7149af9a2d786e35293f388ee0fc4915dfd768254bd09f757bf81","target":"graph","created_at":"2026-07-05T03:39:09Z","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/2112.04408/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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(","authors_text":"Aaron Smith, Amine Natik","cross_cats":["stat.CO","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-12-08T16:53:45Z","title":"Consistency of Spectral Seriation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04408","kind":"arxiv","version":1},"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:530827b32b3c4f9517a0f2b2900cf859a84fdd8be6fdadb0a46bbd78ad3ba0e9","target":"record","created_at":"2026-07-05T03:39:09Z","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":"efd0c64fb89f237a359cd5d5664bb575a385af92fd4542e2582796df1ee04283","cross_cats_sorted":["stat.CO","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-12-08T16:53:45Z","title_canon_sha256":"4b3e8b2c61a47ab07f72e1341960f173f2488d12e0473afbeda943e0402cffd4"},"schema_version":"1.0","source":{"id":"2112.04408","kind":"arxiv","version":1}},"canonical_sha256":"80098b2dcc9e8a108a977360ece6d2feb44ac99adfdeed860286f39a3c980b12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80098b2dcc9e8a108a977360ece6d2feb44ac99adfdeed860286f39a3c980b12","first_computed_at":"2026-07-05T03:39:09.312127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:39:09.312127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Szq7Yll+wvfTdZMxWVoDa0mRLkFBIdIvEA9o5F8Q9idB6Kv3nVrbmPtQabuEV1YdjomTKroojSzChIcW3B3Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:39:09.312504Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.04408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:530827b32b3c4f9517a0f2b2900cf859a84fdd8be6fdadb0a46bbd78ad3ba0e9","sha256:6aa6e607a6b7149af9a2d786e35293f388ee0fc4915dfd768254bd09f757bf81"],"state_sha256":"5e799cd4f22f1401bddfb0ecef7faaab66858761868b57c6f53b0a65d379503e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kp3lwH8wT2oTpqH8ix16IGqDQUqW4pmIHhRIkzBZ/b9APvmSC/w3gSWCPpGa9KkAtEB1rBCM2JzfM0yFXUYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:39:53.369533Z","bundle_sha256":"040b78f2728218e898d4f41bf456575be5d69d7607a8e4f040a2edc9128ca578"}}