{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OQPIPX62RTLWVPHP2NZWHUM3KJ","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":"c4d10d2c3fb1adb88e43bc726d6c6ae0ef7d10f88600e9b2a6e3026c7c517c06","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-03T19:59:17Z","title_canon_sha256":"6e2c5de71fa21cad3f3bad59c1a344407ee8561347ef427b267c5ca87c0a8602"},"schema_version":"1.0","source":{"id":"1701.00806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00806","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00806v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00806","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"OQPIPX62RTLW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQPIPX62RTLWVPHP","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQPIPX62","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:bb72f1cdc2e2a95a01ac7eb797c5bfe41c693d78c05f95931a01da4c8f59d5c0","target":"graph","created_at":"2026-05-18T00:00:33Z","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":"A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. The adjacency matrix of a graph is Robinsonian precisely when the graph is a unit interval graph, so that Robinsonian matrices form a matrix analogue of the class of unit interval graphs. Here we provide a structural characterization for Robinsonian matrices in terms of forbidden substructures, extending the notion of asteroidal triples to weighted graphs. This implies the known characterization of u","authors_text":"Matteo Seminaroti, Monique Laurent, Shin-ichi Tanigawa","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-03T19:59:17Z","title":"A Structural Characterization for Certifying Robinsonian Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00806","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:bcf73d5baf8bf69828f227ecb2a2810584e5cc497a8b334bfae8bf5dcb7f6de1","target":"record","created_at":"2026-05-18T00:00:33Z","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":"c4d10d2c3fb1adb88e43bc726d6c6ae0ef7d10f88600e9b2a6e3026c7c517c06","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-03T19:59:17Z","title_canon_sha256":"6e2c5de71fa21cad3f3bad59c1a344407ee8561347ef427b267c5ca87c0a8602"},"schema_version":"1.0","source":{"id":"1701.00806","kind":"arxiv","version":1}},"canonical_sha256":"741e87dfda8cd76abcefd37363d19b527aaa668a40ef91a9b261708237aba076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"741e87dfda8cd76abcefd37363d19b527aaa668a40ef91a9b261708237aba076","first_computed_at":"2026-05-18T00:00:33.308511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:33.308511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"av2TDmpkM2kujnH6lhY+QVDn5g4MJtTzPBDDb8+banbqpz3AHYhKtHXzWjKyxjpJs7sWnxcIpieTqtZj8E7AAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:33.308983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcf73d5baf8bf69828f227ecb2a2810584e5cc497a8b334bfae8bf5dcb7f6de1","sha256:bb72f1cdc2e2a95a01ac7eb797c5bfe41c693d78c05f95931a01da4c8f59d5c0"],"state_sha256":"81ea24a770d6b2700bc81480a208cc440ff3f7bfe31cb05495185fa5b45e50fc"}