{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:R52GJKJWBAH3ABHCSE4ZALI7ND","short_pith_number":"pith:R52GJKJW","canonical_record":{"source":{"id":"1305.1059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-05T22:13:57Z","cross_cats_sorted":[],"title_canon_sha256":"19fcca5c370aa5e2c508bd2b173aa099a68484f9e5e47ccc53f91363cb583e23","abstract_canon_sha256":"122fd795e78c689a379a9e1ec06dc84c0d943837f3214e9b20db1a974c5fc384"},"schema_version":"1.0"},"canonical_sha256":"8f7464a936080fb004e29139902d1f68f876ea26c3a835f5d45d5b935ec03fc2","source":{"kind":"arxiv","id":"1305.1059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1059","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1059v1","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1059","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"R52GJKJWBAH3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R52GJKJWBAH3ABHC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R52GJKJW","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:R52GJKJWBAH3ABHCSE4ZALI7ND","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-05T22:13:57Z","cross_cats_sorted":[],"title_canon_sha256":"19fcca5c370aa5e2c508bd2b173aa099a68484f9e5e47ccc53f91363cb583e23","abstract_canon_sha256":"122fd795e78c689a379a9e1ec06dc84c0d943837f3214e9b20db1a974c5fc384"},"schema_version":"1.0"},"canonical_sha256":"8f7464a936080fb004e29139902d1f68f876ea26c3a835f5d45d5b935ec03fc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:24.240142Z","signature_b64":"h+vIMV3Kdzu1zO0T6FPh3LRPAYx73vpdU/QkEZdqbvw9QAB+aHwfx4yPjlOu/LN9H/ryvO09AXMo7urPm50iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f7464a936080fb004e29139902d1f68f876ea26c3a835f5d45d5b935ec03fc2","last_reissued_at":"2026-05-18T03:26:24.239511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:24.239511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1059","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-18T03:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VF/QJnMFOda2d9eiysnlorGar8n4BcrVJH5DUhdFnYmIKBYbW8+VAh1R2WD1ITO20/lwGj3PyirZkBNmB/mAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:35:05.758143Z"},"content_sha256":"27d97b64fc557bc470adbdcb0c7ef2789991eb75c528b4c0017ba3bccd5021de","schema_version":"1.0","event_id":"sha256:27d97b64fc557bc470adbdcb0c7ef2789991eb75c528b4c0017ba3bccd5021de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:R52GJKJWBAH3ABHCSE4ZALI7ND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subsquares Approach - Simple Scheme for Solving Overdetermined Interval Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Jaroslav Hor\\'a\\v{c}ek, Milan Hlad\\'ik","submitted_at":"2013-05-05T22:13:57Z","abstract_excerpt":"In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this scheme and discuss their features. We start with a simple algorithm as a motivation, then we continue with a sequential algorithm. Both algorithms can be easily parallelized. The features of both algorithms will be discussed and numerically tested."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1059","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-18T03:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcL3ysi14MdF/7n8iNoOc8orJSSDfJR0aN2cn1XK0uCSnYqq5LYbK+7qfxhO1LyIysmD3lqvYzd7PYXH9X/vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:35:05.758498Z"},"content_sha256":"dd3de4083cc33cab3061540edafd0eee80bd5be56e930ec073833026b4c78a20","schema_version":"1.0","event_id":"sha256:dd3de4083cc33cab3061540edafd0eee80bd5be56e930ec073833026b4c78a20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R52GJKJWBAH3ABHCSE4ZALI7ND/bundle.json","state_url":"https://pith.science/pith/R52GJKJWBAH3ABHCSE4ZALI7ND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R52GJKJWBAH3ABHCSE4ZALI7ND/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:35:05Z","links":{"resolver":"https://pith.science/pith/R52GJKJWBAH3ABHCSE4ZALI7ND","bundle":"https://pith.science/pith/R52GJKJWBAH3ABHCSE4ZALI7ND/bundle.json","state":"https://pith.science/pith/R52GJKJWBAH3ABHCSE4ZALI7ND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R52GJKJWBAH3ABHCSE4ZALI7ND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R52GJKJWBAH3ABHCSE4ZALI7ND","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":"122fd795e78c689a379a9e1ec06dc84c0d943837f3214e9b20db1a974c5fc384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-05T22:13:57Z","title_canon_sha256":"19fcca5c370aa5e2c508bd2b173aa099a68484f9e5e47ccc53f91363cb583e23"},"schema_version":"1.0","source":{"id":"1305.1059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1059","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1059v1","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1059","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"R52GJKJWBAH3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R52GJKJWBAH3ABHC","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R52GJKJW","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:dd3de4083cc33cab3061540edafd0eee80bd5be56e930ec073833026b4c78a20","target":"graph","created_at":"2026-05-18T03:26:24Z","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":"In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this scheme and discuss their features. We start with a simple algorithm as a motivation, then we continue with a sequential algorithm. Both algorithms can be easily parallelized. The features of both algorithms will be discussed and numerically tested.","authors_text":"Jaroslav Hor\\'a\\v{c}ek, Milan Hlad\\'ik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-05T22:13:57Z","title":"Subsquares Approach - Simple Scheme for Solving Overdetermined Interval Linear Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1059","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:27d97b64fc557bc470adbdcb0c7ef2789991eb75c528b4c0017ba3bccd5021de","target":"record","created_at":"2026-05-18T03:26:24Z","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":"122fd795e78c689a379a9e1ec06dc84c0d943837f3214e9b20db1a974c5fc384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-05-05T22:13:57Z","title_canon_sha256":"19fcca5c370aa5e2c508bd2b173aa099a68484f9e5e47ccc53f91363cb583e23"},"schema_version":"1.0","source":{"id":"1305.1059","kind":"arxiv","version":1}},"canonical_sha256":"8f7464a936080fb004e29139902d1f68f876ea26c3a835f5d45d5b935ec03fc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f7464a936080fb004e29139902d1f68f876ea26c3a835f5d45d5b935ec03fc2","first_computed_at":"2026-05-18T03:26:24.239511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:24.239511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h+vIMV3Kdzu1zO0T6FPh3LRPAYx73vpdU/QkEZdqbvw9QAB+aHwfx4yPjlOu/LN9H/ryvO09AXMo7urPm50iDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:24.240142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27d97b64fc557bc470adbdcb0c7ef2789991eb75c528b4c0017ba3bccd5021de","sha256:dd3de4083cc33cab3061540edafd0eee80bd5be56e930ec073833026b4c78a20"],"state_sha256":"8641d5bbe6839fb66dac4f8b8cb6361f2f4ff605438a6ff4cae829d0e1193234"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmu7KU1ZFkaVhs5AbtkrnAqFxko/cNrK5QE3Kg7tW6FbIowCP33G/TuXTguoiR84mx0FnC6VOaOg3WRsrvGHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:35:05.760459Z","bundle_sha256":"21945d7f82cb2901071d21c1030181513d952ef24bcc0ca3114d8783fc0900a7"}}