{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LLSXI543ZV5CUKMRCKC7MBAWL3","short_pith_number":"pith:LLSXI543","canonical_record":{"source":{"id":"1601.03521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T09:10:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"51322b704dde32cb7140e482e7da294babcbed1bd57dac6d1de4fb51a2c21cb5","abstract_canon_sha256":"9cc5452c3764f19e5ec32d498c7b444440a6e9bd8fe26a5d26093d33f81c834f"},"schema_version":"1.0"},"canonical_sha256":"5ae574779bcd7a2a29911285f604165ef8fd86aca117a818ea4903c99d907d43","source":{"kind":"arxiv","id":"1601.03521","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03521","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03521v2","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03521","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"LLSXI543ZV5C","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLSXI543ZV5CUKMR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLSXI543","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LLSXI543ZV5CUKMRCKC7MBAWL3","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T09:10:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"51322b704dde32cb7140e482e7da294babcbed1bd57dac6d1de4fb51a2c21cb5","abstract_canon_sha256":"9cc5452c3764f19e5ec32d498c7b444440a6e9bd8fe26a5d26093d33f81c834f"},"schema_version":"1.0"},"canonical_sha256":"5ae574779bcd7a2a29911285f604165ef8fd86aca117a818ea4903c99d907d43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:47.986019Z","signature_b64":"HqNcR3+uErf6tEVcOZoOPfq0A/dxCE8wAEIND0VDuEu8mNWxF97SngYinOxRDsJnac4s7thYOyIwOe04wJM4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ae574779bcd7a2a29911285f604165ef8fd86aca117a818ea4903c99d907d43","last_reissued_at":"2026-05-18T00:54:47.985638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:47.985638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03521","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h82/aIdtYzyHzcIA/cr7z8R6p2iCFtFZzJQ9u8ReL2hK9rU0JQQ7Zn428EZM1ZtOcgAFn1mkK8icpsWdxsBjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:48:20.543870Z"},"content_sha256":"10c436839dc20f74a6f6783ced277f0e3c27f3d303eb705d06bae5f12378df52","schema_version":"1.0","event_id":"sha256:10c436839dc20f74a6f6783ced277f0e3c27f3d303eb705d06bae5f12378df52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LLSXI543ZV5CUKMRCKC7MBAWL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Matteo Seminaroti, Monique Laurent","submitted_at":"2016-01-14T09:10:48Z","abstract_excerpt":"We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As main ingredient we introduce a new algorithm, named Similarity-First-Search (SFS), which extends Lexicographic Breadth-First Search (Lex-BFS) to weighted graphs and which we use in a multisweep algorithm to recognize Robinsonian matrices. Since Robinsonian binary matrices correspond to unit interval graphs, our algorithm can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03521","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwHkxpXS69DqiizHR86V3ZtmqmWi+kq+33FKUlaoOLm+7rd9J6n8RotnNBC7kTEz2mfVoMmeo3HstdFf3nuAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:48:20.544222Z"},"content_sha256":"bd023ce26af2d7f2cc66967427b55f5b92392b42c1f58cf5c65292571e063929","schema_version":"1.0","event_id":"sha256:bd023ce26af2d7f2cc66967427b55f5b92392b42c1f58cf5c65292571e063929"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLSXI543ZV5CUKMRCKC7MBAWL3/bundle.json","state_url":"https://pith.science/pith/LLSXI543ZV5CUKMRCKC7MBAWL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLSXI543ZV5CUKMRCKC7MBAWL3/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-21T21:48:20Z","links":{"resolver":"https://pith.science/pith/LLSXI543ZV5CUKMRCKC7MBAWL3","bundle":"https://pith.science/pith/LLSXI543ZV5CUKMRCKC7MBAWL3/bundle.json","state":"https://pith.science/pith/LLSXI543ZV5CUKMRCKC7MBAWL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLSXI543ZV5CUKMRCKC7MBAWL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LLSXI543ZV5CUKMRCKC7MBAWL3","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":"9cc5452c3764f19e5ec32d498c7b444440a6e9bd8fe26a5d26093d33f81c834f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T09:10:48Z","title_canon_sha256":"51322b704dde32cb7140e482e7da294babcbed1bd57dac6d1de4fb51a2c21cb5"},"schema_version":"1.0","source":{"id":"1601.03521","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03521","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03521v2","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03521","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"LLSXI543ZV5C","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLSXI543ZV5CUKMR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLSXI543","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:bd023ce26af2d7f2cc66967427b55f5b92392b42c1f58cf5c65292571e063929","target":"graph","created_at":"2026-05-18T00:54:47Z","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":"We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As main ingredient we introduce a new algorithm, named Similarity-First-Search (SFS), which extends Lexicographic Breadth-First Search (Lex-BFS) to weighted graphs and which we use in a multisweep algorithm to recognize Robinsonian matrices. Since Robinsonian binary matrices correspond to unit interval graphs, our algorithm can b","authors_text":"Matteo Seminaroti, Monique Laurent","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T09:10:48Z","title":"Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03521","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:10c436839dc20f74a6f6783ced277f0e3c27f3d303eb705d06bae5f12378df52","target":"record","created_at":"2026-05-18T00:54:47Z","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":"9cc5452c3764f19e5ec32d498c7b444440a6e9bd8fe26a5d26093d33f81c834f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-14T09:10:48Z","title_canon_sha256":"51322b704dde32cb7140e482e7da294babcbed1bd57dac6d1de4fb51a2c21cb5"},"schema_version":"1.0","source":{"id":"1601.03521","kind":"arxiv","version":2}},"canonical_sha256":"5ae574779bcd7a2a29911285f604165ef8fd86aca117a818ea4903c99d907d43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ae574779bcd7a2a29911285f604165ef8fd86aca117a818ea4903c99d907d43","first_computed_at":"2026-05-18T00:54:47.985638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:47.985638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HqNcR3+uErf6tEVcOZoOPfq0A/dxCE8wAEIND0VDuEu8mNWxF97SngYinOxRDsJnac4s7thYOyIwOe04wJM4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:47.986019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03521","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10c436839dc20f74a6f6783ced277f0e3c27f3d303eb705d06bae5f12378df52","sha256:bd023ce26af2d7f2cc66967427b55f5b92392b42c1f58cf5c65292571e063929"],"state_sha256":"a075bf35f7d49ca86dc75916883c4470a82abdce3bc894c11dc26bdee18d4d89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9a+sqvo/B9TiKFuRWe99ikaYvE5P3Kt433bp7aPKZKiK3OSVRhro7lC9+ZEc6DAsDmU9y+eRwNHt3CdkgOdQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:48:20.546255Z","bundle_sha256":"96fcd77a90b8bbd2caf338282726a9a165936cb721d0f1d0d79eb00d01e252eb"}}