{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PLUXP5S2DPJX22V3547VSDCMMA","short_pith_number":"pith:PLUXP5S2","schema_version":"1.0","canonical_sha256":"7ae977f65a1bd37d6abbef3f590c4c600267c54144e1d1b9a319f11b88d7b001","source":{"kind":"arxiv","id":"1711.08732","version":1},"attestation_state":"computed","paper":{"title":"An Overview of Polynomially Computable Characteristics of Special Interval Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Milan Hlad\\'ik","submitted_at":"2017-11-23T15:10:49Z","abstract_excerpt":"It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying polynomially solvable classes thus belongs to important current trends. The purpose of this paper is to review some of such classes. In particular, we focus on several special interval matrices and investigate their convenient properties. We consider tridiagonal matrices, {M,H,P,B}-matrices, inverse M-matrices, inverse nonnegative matrices, nonnegative matrices, "},"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":"1711.08732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-23T15:10:49Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"bd6e4cff14793f167078841790fb9acab21a439db72e8314a53d6fd7c52ac7cd","abstract_canon_sha256":"8056de05665937e062f19b0d71777d273fce79818d8126b776c599555b5f9f9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T19:11:16.336333Z","signature_b64":"0JRtyrzfE7nWxeBGd2mIFPUgzWQ0xdvvehbkKJFm4K+qDAJeJts9DEHVM1KNTFMrsmfwhq5p8+6NRVeNfqSVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ae977f65a1bd37d6abbef3f590c4c600267c54144e1d1b9a319f11b88d7b001","last_reissued_at":"2026-06-04T19:11:16.335746Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T19:11:16.335746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Overview of Polynomially Computable Characteristics of Special Interval Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Milan Hlad\\'ik","submitted_at":"2017-11-23T15:10:49Z","abstract_excerpt":"It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying polynomially solvable classes thus belongs to important current trends. The purpose of this paper is to review some of such classes. In particular, we focus on several special interval matrices and investigate their convenient properties. We consider tridiagonal matrices, {M,H,P,B}-matrices, inverse M-matrices, inverse nonnegative matrices, nonnegative matrices, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08732","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1711.08732/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1711.08732","created_at":"2026-06-04T19:11:16.335814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08732v1","created_at":"2026-06-04T19:11:16.335814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08732","created_at":"2026-06-04T19:11:16.335814+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLUXP5S2DPJX","created_at":"2026-06-04T19:11:16.335814+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLUXP5S2DPJX22V3","created_at":"2026-06-04T19:11:16.335814+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLUXP5S2","created_at":"2026-06-04T19:11:16.335814+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/PLUXP5S2DPJX22V3547VSDCMMA","json":"https://pith.science/pith/PLUXP5S2DPJX22V3547VSDCMMA.json","graph_json":"https://pith.science/api/pith-number/PLUXP5S2DPJX22V3547VSDCMMA/graph.json","events_json":"https://pith.science/api/pith-number/PLUXP5S2DPJX22V3547VSDCMMA/events.json","paper":"https://pith.science/paper/PLUXP5S2"},"agent_actions":{"view_html":"https://pith.science/pith/PLUXP5S2DPJX22V3547VSDCMMA","download_json":"https://pith.science/pith/PLUXP5S2DPJX22V3547VSDCMMA.json","view_paper":"https://pith.science/paper/PLUXP5S2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08732&json=true","fetch_graph":"https://pith.science/api/pith-number/PLUXP5S2DPJX22V3547VSDCMMA/graph.json","fetch_events":"https://pith.science/api/pith-number/PLUXP5S2DPJX22V3547VSDCMMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLUXP5S2DPJX22V3547VSDCMMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLUXP5S2DPJX22V3547VSDCMMA/action/storage_attestation","attest_author":"https://pith.science/pith/PLUXP5S2DPJX22V3547VSDCMMA/action/author_attestation","sign_citation":"https://pith.science/pith/PLUXP5S2DPJX22V3547VSDCMMA/action/citation_signature","submit_replication":"https://pith.science/pith/PLUXP5S2DPJX22V3547VSDCMMA/action/replication_record"}},"created_at":"2026-06-04T19:11:16.335814+00:00","updated_at":"2026-06-04T19:11:16.335814+00:00"}