{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FZJVKEEQ3X7CMN25YC45XVWT2E","short_pith_number":"pith:FZJVKEEQ","canonical_record":{"source":{"id":"1504.06586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T18:05:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c1af9ea83f3923a4e4944da1a75286ce3ef678138f19bae93ae7220f61b9a688","abstract_canon_sha256":"17fb3f451def7df6a37b361ba2ba846ba1eac43a6730dfd58e47d201f529423e"},"schema_version":"1.0"},"canonical_sha256":"2e53551090ddfe26375dc0b9dbd6d3d1241276a8ba060cbfeb8816327fab3076","source":{"kind":"arxiv","id":"1504.06586","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06586","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06586v2","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06586","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"FZJVKEEQ3X7C","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FZJVKEEQ3X7CMN25","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FZJVKEEQ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FZJVKEEQ3X7CMN25YC45XVWT2E","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T18:05:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c1af9ea83f3923a4e4944da1a75286ce3ef678138f19bae93ae7220f61b9a688","abstract_canon_sha256":"17fb3f451def7df6a37b361ba2ba846ba1eac43a6730dfd58e47d201f529423e"},"schema_version":"1.0"},"canonical_sha256":"2e53551090ddfe26375dc0b9dbd6d3d1241276a8ba060cbfeb8816327fab3076","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:48.259648Z","signature_b64":"Ui/I7mAFEtUBt8T+v/FlBj+ZNJQI6dnwvBInfkaS1j83PHQmVQGh+4DG9+3DcAAmLgPLzklcT90DR8yMkuLzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e53551090ddfe26375dc0b9dbd6d3d1241276a8ba060cbfeb8816327fab3076","last_reissued_at":"2026-05-18T00:54:48.259190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:48.259190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06586","source_version":2,"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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPv42VgE9258URe9VQdnwKRw/H44SlnoGKjukhSGWVCwBltGkYYLYcfBhAilolw9exDl4sllc0Ul6Nbs0rTTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:49:17.334002Z"},"content_sha256":"5ae017b5677a8f0fb51865eb3bc33e1addffa7aa92af6ef28f4ab29cf1a2c871","schema_version":"1.0","event_id":"sha256:5ae017b5677a8f0fb51865eb3bc33e1addffa7aa92af6ef28f4ab29cf1a2c871"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FZJVKEEQ3X7CMN25YC45XVWT2E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lex-BFS-based recognition algorithm for Robinsonian matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Matteo Seminaroti, Monique Laurent","submitted_at":"2015-04-24T18:05:00Z","abstract_excerpt":"Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be reordered. We present a new polynomial time algorithm to recognize Robinsonian matrices based on a new characterization of Robinsonian matrices in terms of straight enumerations of unit interval graphs. The algorithm is simple and is based essentially on lexicographic breadth-first search (Lex-BFS), using a divide-and-conquer strategy. When applied to a nonnegative symmetric $n\\times n$ matrix with~$m$ nonzero entries and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06586","kind":"arxiv","version":2},"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:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wudCi8Uyzc/x1WylVM6VOMsS4B9VhzGMs/XrVDDtKULQaI2hYl1yfSUkDOq/T2g3PUc63h/KQYHmorAYU5JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:49:17.334371Z"},"content_sha256":"9a05ea0a77c9681b0b08c12c729e307e3df9eed021a0e10511eb2fc7c8e604e2","schema_version":"1.0","event_id":"sha256:9a05ea0a77c9681b0b08c12c729e307e3df9eed021a0e10511eb2fc7c8e604e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZJVKEEQ3X7CMN25YC45XVWT2E/bundle.json","state_url":"https://pith.science/pith/FZJVKEEQ3X7CMN25YC45XVWT2E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZJVKEEQ3X7CMN25YC45XVWT2E/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-21T22:49:17Z","links":{"resolver":"https://pith.science/pith/FZJVKEEQ3X7CMN25YC45XVWT2E","bundle":"https://pith.science/pith/FZJVKEEQ3X7CMN25YC45XVWT2E/bundle.json","state":"https://pith.science/pith/FZJVKEEQ3X7CMN25YC45XVWT2E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZJVKEEQ3X7CMN25YC45XVWT2E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FZJVKEEQ3X7CMN25YC45XVWT2E","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":"17fb3f451def7df6a37b361ba2ba846ba1eac43a6730dfd58e47d201f529423e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T18:05:00Z","title_canon_sha256":"c1af9ea83f3923a4e4944da1a75286ce3ef678138f19bae93ae7220f61b9a688"},"schema_version":"1.0","source":{"id":"1504.06586","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06586","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06586v2","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06586","created_at":"2026-05-18T00:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"FZJVKEEQ3X7C","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FZJVKEEQ3X7CMN25","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FZJVKEEQ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:9a05ea0a77c9681b0b08c12c729e307e3df9eed021a0e10511eb2fc7c8e604e2","target":"graph","created_at":"2026-05-18T00:54:48Z","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":"Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be reordered. We present a new polynomial time algorithm to recognize Robinsonian matrices based on a new characterization of Robinsonian matrices in terms of straight enumerations of unit interval graphs. The algorithm is simple and is based essentially on lexicographic breadth-first search (Lex-BFS), using a divide-and-conquer strategy. When applied to a nonnegative symmetric $n\\times n$ matrix with~$m$ nonzero entries and","authors_text":"Matteo Seminaroti, Monique Laurent","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T18:05:00Z","title":"A Lex-BFS-based recognition algorithm for Robinsonian matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06586","kind":"arxiv","version":2},"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:5ae017b5677a8f0fb51865eb3bc33e1addffa7aa92af6ef28f4ab29cf1a2c871","target":"record","created_at":"2026-05-18T00:54:48Z","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":"17fb3f451def7df6a37b361ba2ba846ba1eac43a6730dfd58e47d201f529423e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-24T18:05:00Z","title_canon_sha256":"c1af9ea83f3923a4e4944da1a75286ce3ef678138f19bae93ae7220f61b9a688"},"schema_version":"1.0","source":{"id":"1504.06586","kind":"arxiv","version":2}},"canonical_sha256":"2e53551090ddfe26375dc0b9dbd6d3d1241276a8ba060cbfeb8816327fab3076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e53551090ddfe26375dc0b9dbd6d3d1241276a8ba060cbfeb8816327fab3076","first_computed_at":"2026-05-18T00:54:48.259190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:48.259190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ui/I7mAFEtUBt8T+v/FlBj+ZNJQI6dnwvBInfkaS1j83PHQmVQGh+4DG9+3DcAAmLgPLzklcT90DR8yMkuLzCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:48.259648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06586","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ae017b5677a8f0fb51865eb3bc33e1addffa7aa92af6ef28f4ab29cf1a2c871","sha256:9a05ea0a77c9681b0b08c12c729e307e3df9eed021a0e10511eb2fc7c8e604e2"],"state_sha256":"765dfdd544a1ddfbdac35a7e48ce22aba3ee1dc8ad683f3db89dadf88f477dfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KSBBTKkRQrvZtNbHxLKY1FQR32/StkXJbDjgY00ocMSxPg4Erx1J4nahgQ6ljVnl/2zmL1C38iIEtjiKv5cDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:49:17.336361Z","bundle_sha256":"af99351508489c92f732254735a518f027a644a84114216e74e07b0407d1cc82"}}