{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3P3ZKH3F43JJKSMLMFXO753R3X","short_pith_number":"pith:3P3ZKH3F","canonical_record":{"source":{"id":"1602.00349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-01T00:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"394b543cafd19e8341ff55710a446de307a949ea0f31cc3b0f92f664396f89ef","abstract_canon_sha256":"e73937217d28b737290539d660815dbe4acd77bc3633afe3406b4855a1caff54"},"schema_version":"1.0"},"canonical_sha256":"dbf7951f65e6d295498b616eeff771ddd244aadde24f692baf88fd257f9cef08","source":{"kind":"arxiv","id":"1602.00349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00349","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00349v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00349","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"3P3ZKH3F43JJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3P3ZKH3F43JJKSML","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3P3ZKH3F","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3P3ZKH3F43JJKSMLMFXO753R3X","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-01T00:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"394b543cafd19e8341ff55710a446de307a949ea0f31cc3b0f92f664396f89ef","abstract_canon_sha256":"e73937217d28b737290539d660815dbe4acd77bc3633afe3406b4855a1caff54"},"schema_version":"1.0"},"canonical_sha256":"dbf7951f65e6d295498b616eeff771ddd244aadde24f692baf88fd257f9cef08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:35.619043Z","signature_b64":"0AD1L0Lfrw86Eh/U5gi/2p9BxIzkOLHmTGFqG0qt5puuB0tRy4Lry0hVHy9e7GIHq0gbUx6HwmBwdz7v39NpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbf7951f65e6d295498b616eeff771ddd244aadde24f692baf88fd257f9cef08","last_reissued_at":"2026-05-18T01:21:35.618545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:35.618545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00349","source_version":1,"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-18T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9/IMRpwBegJFf5zHsdRD/aXHWAhEEf3n582kG8LEP3WH8veFkLBEqa9P4ufdMj/K3HFm+yIIsJyD7BxKiyACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:53:26.471988Z"},"content_sha256":"8e8601ce99b41545f7c1cd58a4dc6b932b1a1762a338f6ff7f5b940e6b534a5d","schema_version":"1.0","event_id":"sha256:8e8601ce99b41545f7c1cd58a4dc6b932b1a1762a338f6ff7f5b940e6b534a5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3P3ZKH3F43JJKSMLMFXO753R3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval Linear Algebra and Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jaroslav Hor\\'a\\v{c}ek, Michal \\v{C}ern\\'y, Milan Hlad\\'ik","submitted_at":"2016-02-01T00:00:15Z","abstract_excerpt":"This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding solvability of a linear system, computing inverse matrix, eigenvalues, checking positive (semi)definiteness or stability. We discuss these problems and relations between them from the view of computational complexity. Many problems in interval linear algebra are intractable, hence we emphasize subclasses of these problems that are easily solvable or decidable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00349","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"},"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-18T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxGY343u3APde01nsq+X5SKwa1wglgXOBd36j8zD6Rdd71MLJiZusfUB9vlfPKvpKTzUI71hHBiHsJDSnDReBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:53:26.472824Z"},"content_sha256":"a6406af21546129f19f2583982398a1fa8106db2cc5854e822c0ea25733dddc8","schema_version":"1.0","event_id":"sha256:a6406af21546129f19f2583982398a1fa8106db2cc5854e822c0ea25733dddc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3P3ZKH3F43JJKSMLMFXO753R3X/bundle.json","state_url":"https://pith.science/pith/3P3ZKH3F43JJKSMLMFXO753R3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3P3ZKH3F43JJKSMLMFXO753R3X/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-06T16:53:26Z","links":{"resolver":"https://pith.science/pith/3P3ZKH3F43JJKSMLMFXO753R3X","bundle":"https://pith.science/pith/3P3ZKH3F43JJKSMLMFXO753R3X/bundle.json","state":"https://pith.science/pith/3P3ZKH3F43JJKSMLMFXO753R3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3P3ZKH3F43JJKSMLMFXO753R3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3P3ZKH3F43JJKSMLMFXO753R3X","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":"e73937217d28b737290539d660815dbe4acd77bc3633afe3406b4855a1caff54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-01T00:00:15Z","title_canon_sha256":"394b543cafd19e8341ff55710a446de307a949ea0f31cc3b0f92f664396f89ef"},"schema_version":"1.0","source":{"id":"1602.00349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00349","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00349v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00349","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"3P3ZKH3F43JJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3P3ZKH3F43JJKSML","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3P3ZKH3F","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:a6406af21546129f19f2583982398a1fa8106db2cc5854e822c0ea25733dddc8","target":"graph","created_at":"2026-05-18T01:21:35Z","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":"This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding solvability of a linear system, computing inverse matrix, eigenvalues, checking positive (semi)definiteness or stability. We discuss these problems and relations between them from the view of computational complexity. Many problems in interval linear algebra are intractable, hence we emphasize subclasses of these problems that are easily solvable or decidable","authors_text":"Jaroslav Hor\\'a\\v{c}ek, Michal \\v{C}ern\\'y, Milan Hlad\\'ik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-01T00:00:15Z","title":"Interval Linear Algebra and Computational Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00349","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:8e8601ce99b41545f7c1cd58a4dc6b932b1a1762a338f6ff7f5b940e6b534a5d","target":"record","created_at":"2026-05-18T01:21:35Z","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":"e73937217d28b737290539d660815dbe4acd77bc3633afe3406b4855a1caff54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-01T00:00:15Z","title_canon_sha256":"394b543cafd19e8341ff55710a446de307a949ea0f31cc3b0f92f664396f89ef"},"schema_version":"1.0","source":{"id":"1602.00349","kind":"arxiv","version":1}},"canonical_sha256":"dbf7951f65e6d295498b616eeff771ddd244aadde24f692baf88fd257f9cef08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbf7951f65e6d295498b616eeff771ddd244aadde24f692baf88fd257f9cef08","first_computed_at":"2026-05-18T01:21:35.618545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:35.618545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0AD1L0Lfrw86Eh/U5gi/2p9BxIzkOLHmTGFqG0qt5puuB0tRy4Lry0hVHy9e7GIHq0gbUx6HwmBwdz7v39NpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:35.619043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e8601ce99b41545f7c1cd58a4dc6b932b1a1762a338f6ff7f5b940e6b534a5d","sha256:a6406af21546129f19f2583982398a1fa8106db2cc5854e822c0ea25733dddc8"],"state_sha256":"07dece20a69f1b40ea3336494018e1685c27f106547c0e820a210e5a46d8be30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9E2cywLKc0DcxMwEbotsmaY1zMWn6TaS5sRBut0nc7eSqtGyWAkg82ENTxusBlVTMlCS5QE2il3+TVcANTiUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:53:26.476208Z","bundle_sha256":"758d407b741d9e0079c8e70e6a4812c2bad7db4409f9307d86b1a94b38f02711"}}