{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PB52Q6NUOEHBP4TG2JJ4QO3B6G","short_pith_number":"pith:PB52Q6NU","canonical_record":{"source":{"id":"1806.00664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-02T16:33:27Z","cross_cats_sorted":[],"title_canon_sha256":"5fd94866f0bd82ecced5f9e7e880561d7175692160522f942341b2fed983b586","abstract_canon_sha256":"d91f2bba21f527dad88b659cadd4113972ad86d4d5e84bc3be8a772bf8e7b28d"},"schema_version":"1.0"},"canonical_sha256":"787ba879b4710e17f266d253c83b61f1b0be4a4912a378dde0a2285537d49da8","source":{"kind":"arxiv","id":"1806.00664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00664","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00664v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00664","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"PB52Q6NUOEHB","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PB52Q6NUOEHBP4TG","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PB52Q6NU","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PB52Q6NUOEHBP4TG2JJ4QO3B6G","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-02T16:33:27Z","cross_cats_sorted":[],"title_canon_sha256":"5fd94866f0bd82ecced5f9e7e880561d7175692160522f942341b2fed983b586","abstract_canon_sha256":"d91f2bba21f527dad88b659cadd4113972ad86d4d5e84bc3be8a772bf8e7b28d"},"schema_version":"1.0"},"canonical_sha256":"787ba879b4710e17f266d253c83b61f1b0be4a4912a378dde0a2285537d49da8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.799464Z","signature_b64":"o/GcapI2dH/EtnhdPEBZ8nw8auwO3ZqAIh9eL9UtuYNLq3SwMdu94hiy3DHKaNSTnEkTaCuPx1e4H4O9Id2FDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787ba879b4710e17f266d253c83b61f1b0be4a4912a378dde0a2285537d49da8","last_reissued_at":"2026-05-18T00:14:18.798823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.798823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00664","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-05-18T00:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdtiRhJmZHyQ3Y4lxLahIsYj9jx+MlNkOvcS+UbFjwQPsPC6gCVH6fw2HOvqyJT4E9UgfTbLj66g3Oqwr8Y3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:13:40.761725Z"},"content_sha256":"4219a1416b53a91fb6471e86c99026a24bc4a9f89320b14209a1fc6d96bdecba","schema_version":"1.0","event_id":"sha256:4219a1416b53a91fb6471e86c99026a24bc4a9f89320b14209a1fc6d96bdecba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PB52Q6NUOEHBP4TG2JJ4QO3B6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Seriation and Applications to Cancer Genomics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Antoine Recanati, Jean-Philippe Vert, Nicolas Servant","submitted_at":"2018-06-02T16:33:27Z","abstract_excerpt":"The seriation problem seeks to reorder a set of elements given pairwise similarity information, so that elements with higher similarity are closer in the resulting sequence. When a global ordering consistent with the similarity information exists, an exact spectral solution recovers it in the noiseless case and seriation is equivalent to the combinatorial 2-SUM problem over permutations, for which several relaxations have been derived. However, in applications such as DNA assembly, similarity values are often heavily corrupted, and the solution of 2-SUM may no longer yield an approximate seria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00664","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":""},"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-05-18T00:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"99WpXpodpRIWArCc3hHjayWA5jOB+jSDlM4w8vOF8ZwWD5ZygtJhPwmLPSOVD4rxrjklgSDW+7hYBayjLKZpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:13:40.762080Z"},"content_sha256":"f1c677c8dd4ebd48af9a5d12a5945c91d948de0fd029977566715f2f2fdc4d3f","schema_version":"1.0","event_id":"sha256:f1c677c8dd4ebd48af9a5d12a5945c91d948de0fd029977566715f2f2fdc4d3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PB52Q6NUOEHBP4TG2JJ4QO3B6G/bundle.json","state_url":"https://pith.science/pith/PB52Q6NUOEHBP4TG2JJ4QO3B6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PB52Q6NUOEHBP4TG2JJ4QO3B6G/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-06-04T09:13:40Z","links":{"resolver":"https://pith.science/pith/PB52Q6NUOEHBP4TG2JJ4QO3B6G","bundle":"https://pith.science/pith/PB52Q6NUOEHBP4TG2JJ4QO3B6G/bundle.json","state":"https://pith.science/pith/PB52Q6NUOEHBP4TG2JJ4QO3B6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PB52Q6NUOEHBP4TG2JJ4QO3B6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PB52Q6NUOEHBP4TG2JJ4QO3B6G","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":"d91f2bba21f527dad88b659cadd4113972ad86d4d5e84bc3be8a772bf8e7b28d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-02T16:33:27Z","title_canon_sha256":"5fd94866f0bd82ecced5f9e7e880561d7175692160522f942341b2fed983b586"},"schema_version":"1.0","source":{"id":"1806.00664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00664","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00664v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00664","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"PB52Q6NUOEHB","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PB52Q6NUOEHBP4TG","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PB52Q6NU","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:f1c677c8dd4ebd48af9a5d12a5945c91d948de0fd029977566715f2f2fdc4d3f","target":"graph","created_at":"2026-05-18T00:14:18Z","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"},"paper":{"abstract_excerpt":"The seriation problem seeks to reorder a set of elements given pairwise similarity information, so that elements with higher similarity are closer in the resulting sequence. When a global ordering consistent with the similarity information exists, an exact spectral solution recovers it in the noiseless case and seriation is equivalent to the combinatorial 2-SUM problem over permutations, for which several relaxations have been derived. However, in applications such as DNA assembly, similarity values are often heavily corrupted, and the solution of 2-SUM may no longer yield an approximate seria","authors_text":"Alexandre d'Aspremont, Antoine Recanati, Jean-Philippe Vert, Nicolas Servant","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-02T16:33:27Z","title":"Robust Seriation and Applications to Cancer Genomics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00664","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:4219a1416b53a91fb6471e86c99026a24bc4a9f89320b14209a1fc6d96bdecba","target":"record","created_at":"2026-05-18T00:14:18Z","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":"d91f2bba21f527dad88b659cadd4113972ad86d4d5e84bc3be8a772bf8e7b28d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-02T16:33:27Z","title_canon_sha256":"5fd94866f0bd82ecced5f9e7e880561d7175692160522f942341b2fed983b586"},"schema_version":"1.0","source":{"id":"1806.00664","kind":"arxiv","version":1}},"canonical_sha256":"787ba879b4710e17f266d253c83b61f1b0be4a4912a378dde0a2285537d49da8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"787ba879b4710e17f266d253c83b61f1b0be4a4912a378dde0a2285537d49da8","first_computed_at":"2026-05-18T00:14:18.798823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:18.798823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o/GcapI2dH/EtnhdPEBZ8nw8auwO3ZqAIh9eL9UtuYNLq3SwMdu94hiy3DHKaNSTnEkTaCuPx1e4H4O9Id2FDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:18.799464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4219a1416b53a91fb6471e86c99026a24bc4a9f89320b14209a1fc6d96bdecba","sha256:f1c677c8dd4ebd48af9a5d12a5945c91d948de0fd029977566715f2f2fdc4d3f"],"state_sha256":"5c277a025ba42093ca3b8a9e82a42e17dfec492b6183ca9498dc274bea3fb84a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jE8fJTZ4/9ob/GUtlt74y3JLgF+FWBqcru9tJLzQXJJE9zzoYzUjjGz+MQT9g3ROXD4UwEVe1fR4GyLlboEDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:13:40.764050Z","bundle_sha256":"01595e89814d3b869591585de4eac990e12271531e0f8127f322a164bbd47b5c"}}