{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OQPIPX62RTLWVPHP2NZWHUM3KJ","short_pith_number":"pith:OQPIPX62","schema_version":"1.0","canonical_sha256":"741e87dfda8cd76abcefd37363d19b527aaa668a40ef91a9b261708237aba076","source":{"kind":"arxiv","id":"1701.00806","version":1},"attestation_state":"computed","paper":{"title":"A Structural Characterization for Certifying Robinsonian Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Matteo Seminaroti, Monique Laurent, Shin-ichi Tanigawa","submitted_at":"2017-01-03T19:59:17Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.00806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-03T19:59:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6e2c5de71fa21cad3f3bad59c1a344407ee8561347ef427b267c5ca87c0a8602","abstract_canon_sha256":"c4d10d2c3fb1adb88e43bc726d6c6ae0ef7d10f88600e9b2a6e3026c7c517c06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:33.308983Z","signature_b64":"av2TDmpkM2kujnH6lhY+QVDn5g4MJtTzPBDDb8+banbqpz3AHYhKtHXzWjKyxjpJs7sWnxcIpieTqtZj8E7AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"741e87dfda8cd76abcefd37363d19b527aaa668a40ef91a9b261708237aba076","last_reissued_at":"2026-05-18T00:00:33.308511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:33.308511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Structural Characterization for Certifying Robinsonian Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Matteo Seminaroti, Monique Laurent, Shin-ichi Tanigawa","submitted_at":"2017-01-03T19:59:17Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00806","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.00806","created_at":"2026-05-18T00:00:33.308570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00806v1","created_at":"2026-05-18T00:00:33.308570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00806","created_at":"2026-05-18T00:00:33.308570+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQPIPX62RTLW","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQPIPX62RTLWVPHP","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQPIPX62","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ","json":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ.json","graph_json":"https://pith.science/api/pith-number/OQPIPX62RTLWVPHP2NZWHUM3KJ/graph.json","events_json":"https://pith.science/api/pith-number/OQPIPX62RTLWVPHP2NZWHUM3KJ/events.json","paper":"https://pith.science/paper/OQPIPX62"},"agent_actions":{"view_html":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ","download_json":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ.json","view_paper":"https://pith.science/paper/OQPIPX62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00806&json=true","fetch_graph":"https://pith.science/api/pith-number/OQPIPX62RTLWVPHP2NZWHUM3KJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OQPIPX62RTLWVPHP2NZWHUM3KJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ/action/storage_attestation","attest_author":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ/action/author_attestation","sign_citation":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ/action/citation_signature","submit_replication":"https://pith.science/pith/OQPIPX62RTLWVPHP2NZWHUM3KJ/action/replication_record"}},"created_at":"2026-05-18T00:00:33.308570+00:00","updated_at":"2026-05-18T00:00:33.308570+00:00"}