{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I7XHMPQDO2354D7AVLZ4OYRD3H","short_pith_number":"pith:I7XHMPQD","schema_version":"1.0","canonical_sha256":"47ee763e0376b7de0fe0aaf3c76223d9ddbfbe9c6fed1261e787099cfe4d3301","source":{"kind":"arxiv","id":"1305.2657","version":1},"attestation_state":"computed","paper":{"title":"Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Francisco J. Arag\\'on Artacho, Jonathan M. Borwein, Matthew K. Tam","submitted_at":"2013-05-13T02:00:51Z","abstract_excerpt":"We discuss recent positive experiences applying convex feasibility algorithms of Douglas--Rachford type to highly combinatorial and far from convex problems."},"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":"1305.2657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-13T02:00:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"55eea1109c9e6edea527be3d5d5fa138543d04024e0bba27b40fdbd3f90fcf0e","abstract_canon_sha256":"3fb1a36817dcc2eb4e95aa74174dae235178166314d155ef4bda880a9589ceff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:38.153445Z","signature_b64":"t41jfZbyQeSKZwkNeAEv3UhpLvJKYyzkyK18cQWGwT7w0792wVy0oxYWa5u6MrCi8wvfiZvjQMtJVb2K4Qj3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47ee763e0376b7de0fe0aaf3c76223d9ddbfbe9c6fed1261e787099cfe4d3301","last_reissued_at":"2026-05-18T01:37:38.152839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:38.152839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Francisco J. Arag\\'on Artacho, Jonathan M. Borwein, Matthew K. Tam","submitted_at":"2013-05-13T02:00:51Z","abstract_excerpt":"We discuss recent positive experiences applying convex feasibility algorithms of Douglas--Rachford type to highly combinatorial and far from convex problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2657","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":"1305.2657","created_at":"2026-05-18T01:37:38.152912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2657v1","created_at":"2026-05-18T01:37:38.152912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2657","created_at":"2026-05-18T01:37:38.152912+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7XHMPQDO235","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7XHMPQDO2354D7A","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7XHMPQD","created_at":"2026-05-18T12:27:46.883200+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/I7XHMPQDO2354D7AVLZ4OYRD3H","json":"https://pith.science/pith/I7XHMPQDO2354D7AVLZ4OYRD3H.json","graph_json":"https://pith.science/api/pith-number/I7XHMPQDO2354D7AVLZ4OYRD3H/graph.json","events_json":"https://pith.science/api/pith-number/I7XHMPQDO2354D7AVLZ4OYRD3H/events.json","paper":"https://pith.science/paper/I7XHMPQD"},"agent_actions":{"view_html":"https://pith.science/pith/I7XHMPQDO2354D7AVLZ4OYRD3H","download_json":"https://pith.science/pith/I7XHMPQDO2354D7AVLZ4OYRD3H.json","view_paper":"https://pith.science/paper/I7XHMPQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2657&json=true","fetch_graph":"https://pith.science/api/pith-number/I7XHMPQDO2354D7AVLZ4OYRD3H/graph.json","fetch_events":"https://pith.science/api/pith-number/I7XHMPQDO2354D7AVLZ4OYRD3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7XHMPQDO2354D7AVLZ4OYRD3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7XHMPQDO2354D7AVLZ4OYRD3H/action/storage_attestation","attest_author":"https://pith.science/pith/I7XHMPQDO2354D7AVLZ4OYRD3H/action/author_attestation","sign_citation":"https://pith.science/pith/I7XHMPQDO2354D7AVLZ4OYRD3H/action/citation_signature","submit_replication":"https://pith.science/pith/I7XHMPQDO2354D7AVLZ4OYRD3H/action/replication_record"}},"created_at":"2026-05-18T01:37:38.152912+00:00","updated_at":"2026-05-18T01:37:38.152912+00:00"}