{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YPDLHZT6KXZZVCWAWDWD2JVELU","short_pith_number":"pith:YPDLHZT6","schema_version":"1.0","canonical_sha256":"c3c6b3e67e55f39a8ac0b0ec3d26a45d17dbabd377c021ec302af5bd7e30b3b4","source":{"kind":"arxiv","id":"1310.2195","version":3},"attestation_state":"computed","paper":{"title":"The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jonathan M. Borwein, Matthew K. Tam","submitted_at":"2013-10-08T17:09:11Z","abstract_excerpt":"We analyse the behaviour of the newly introduced cyclic Douglas-Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is possibly empty."},"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":"1310.2195","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-08T17:09:11Z","cross_cats_sorted":[],"title_canon_sha256":"98fac0d0c2541d5224da1a75b671926d2654ff937e2d7cd6b1346ad272c773f9","abstract_canon_sha256":"c3342af5edbbc1338e15f71be70db47de69591e635a1a324edc1e7fbe61235cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:02.670492Z","signature_b64":"Sd0t8nkXs1NNaCECGdjXTWaySdxxd1RjTqtUr9gigQ9sBX4KejrkgRXbFXx2LOPPwuIfqD8Uyw4kek8/oGvAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3c6b3e67e55f39a8ac0b0ec3d26a45d17dbabd377c021ec302af5bd7e30b3b4","last_reissued_at":"2026-05-18T00:15:02.669520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:02.669520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jonathan M. Borwein, Matthew K. Tam","submitted_at":"2013-10-08T17:09:11Z","abstract_excerpt":"We analyse the behaviour of the newly introduced cyclic Douglas-Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is possibly empty."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2195","kind":"arxiv","version":3},"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":"1310.2195","created_at":"2026-05-18T00:15:02.669702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2195v3","created_at":"2026-05-18T00:15:02.669702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2195","created_at":"2026-05-18T00:15:02.669702+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPDLHZT6KXZZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPDLHZT6KXZZVCWA","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPDLHZT6","created_at":"2026-05-18T12:28:09.283467+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/YPDLHZT6KXZZVCWAWDWD2JVELU","json":"https://pith.science/pith/YPDLHZT6KXZZVCWAWDWD2JVELU.json","graph_json":"https://pith.science/api/pith-number/YPDLHZT6KXZZVCWAWDWD2JVELU/graph.json","events_json":"https://pith.science/api/pith-number/YPDLHZT6KXZZVCWAWDWD2JVELU/events.json","paper":"https://pith.science/paper/YPDLHZT6"},"agent_actions":{"view_html":"https://pith.science/pith/YPDLHZT6KXZZVCWAWDWD2JVELU","download_json":"https://pith.science/pith/YPDLHZT6KXZZVCWAWDWD2JVELU.json","view_paper":"https://pith.science/paper/YPDLHZT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2195&json=true","fetch_graph":"https://pith.science/api/pith-number/YPDLHZT6KXZZVCWAWDWD2JVELU/graph.json","fetch_events":"https://pith.science/api/pith-number/YPDLHZT6KXZZVCWAWDWD2JVELU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPDLHZT6KXZZVCWAWDWD2JVELU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPDLHZT6KXZZVCWAWDWD2JVELU/action/storage_attestation","attest_author":"https://pith.science/pith/YPDLHZT6KXZZVCWAWDWD2JVELU/action/author_attestation","sign_citation":"https://pith.science/pith/YPDLHZT6KXZZVCWAWDWD2JVELU/action/citation_signature","submit_replication":"https://pith.science/pith/YPDLHZT6KXZZVCWAWDWD2JVELU/action/replication_record"}},"created_at":"2026-05-18T00:15:02.669702+00:00","updated_at":"2026-05-18T00:15:02.669702+00:00"}