{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IADYAPABICF24JOJAZBXMZ5PDQ","short_pith_number":"pith:IADYAPAB","canonical_record":{"source":{"id":"1412.1124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-02T22:37:17Z","cross_cats_sorted":[],"title_canon_sha256":"1ab5964557e5d139ca6adf7d90e5e6da223b2482bd4619a0c41354bd9f56c15f","abstract_canon_sha256":"4ad8c51a94e5c0169fac1a398a3ab856a9967fa6fcbb224c984ce2b6a5578d00"},"schema_version":"1.0"},"canonical_sha256":"4007803c01408bae25c906437667af1c1c829e80ae9d7fa69e703d785dcee400","source":{"kind":"arxiv","id":"1412.1124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1124","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1124v1","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1124","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"pith_short_12","alias_value":"IADYAPABICF2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IADYAPABICF24JOJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IADYAPAB","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IADYAPABICF24JOJAZBXMZ5PDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-02T22:37:17Z","cross_cats_sorted":[],"title_canon_sha256":"1ab5964557e5d139ca6adf7d90e5e6da223b2482bd4619a0c41354bd9f56c15f","abstract_canon_sha256":"4ad8c51a94e5c0169fac1a398a3ab856a9967fa6fcbb224c984ce2b6a5578d00"},"schema_version":"1.0"},"canonical_sha256":"4007803c01408bae25c906437667af1c1c829e80ae9d7fa69e703d785dcee400","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:13.382328Z","signature_b64":"RzDfDdwUzwyQUtuR1Tq1nuLauOoGO1QsnOh/Om+BYxq/6URffPSZocO0eiIuDxArVb3GPIGVFvKQgkmRyy+LDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4007803c01408bae25c906437667af1c1c829e80ae9d7fa69e703d785dcee400","last_reissued_at":"2026-05-18T02:32:13.381848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:13.381848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1124","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-18T02:32:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/6ViOL12Rvl+/8YzSrCwXp5WLeg9JSCEoxnw0p63zJ0aSUq7XouUCIxKvuoVaDHgGAY7IkiDIY4A619N60UDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:23:57.358572Z"},"content_sha256":"6662081372a466e1c0d371ca7ad267e174ebf9083ae219b8c7a6175aee94f625","schema_version":"1.0","event_id":"sha256:6662081372a466e1c0d371ca7ad267e174ebf9083ae219b8c7a6175aee94f625"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IADYAPABICF24JOJAZBXMZ5PDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-like resolution complexity of two planar problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anna Malova, Dmitry Itsykson, Dmitry Sokolov, Vsevolod Oparin","submitted_at":"2014-12-02T22:37:17Z","abstract_excerpt":"We consider two CSP problems: the first CSP encodes 2D Sperner's lemma for the standard triangulation of the right triangle on $n^2$ small triangles; the second CSP encodes the fact that it is impossible to match cells of $n \\times n$ square to arrows (two horizontal, two vertical and four diagonal) such that arrows in two cells with a common edge differ by at most $45^\\circ$, and all arrows on the boundary of the square do not look outside (this fact is a corollary of the Brower's fixed point theorem). We prove that the tree-like resolution complexities of these CSPs are $2^{\\Theta(n)}$. For "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1124","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-18T02:32:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qWKNhn6Hu3frpubNtZAtDa8Zvq8aMm3xPy9Ax8FbhMSgGM+ug8+Y00nfpPwFj6qbv99V4rqCRIWalQq837nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:23:57.358921Z"},"content_sha256":"3375a6b012f5236e4b7fa04d534f271dd0fcdee7a54262adc2b3b5190f7c96ab","schema_version":"1.0","event_id":"sha256:3375a6b012f5236e4b7fa04d534f271dd0fcdee7a54262adc2b3b5190f7c96ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IADYAPABICF24JOJAZBXMZ5PDQ/bundle.json","state_url":"https://pith.science/pith/IADYAPABICF24JOJAZBXMZ5PDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IADYAPABICF24JOJAZBXMZ5PDQ/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-03T07:23:57Z","links":{"resolver":"https://pith.science/pith/IADYAPABICF24JOJAZBXMZ5PDQ","bundle":"https://pith.science/pith/IADYAPABICF24JOJAZBXMZ5PDQ/bundle.json","state":"https://pith.science/pith/IADYAPABICF24JOJAZBXMZ5PDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IADYAPABICF24JOJAZBXMZ5PDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IADYAPABICF24JOJAZBXMZ5PDQ","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":"4ad8c51a94e5c0169fac1a398a3ab856a9967fa6fcbb224c984ce2b6a5578d00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-02T22:37:17Z","title_canon_sha256":"1ab5964557e5d139ca6adf7d90e5e6da223b2482bd4619a0c41354bd9f56c15f"},"schema_version":"1.0","source":{"id":"1412.1124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1124","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1124v1","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1124","created_at":"2026-05-18T02:32:13Z"},{"alias_kind":"pith_short_12","alias_value":"IADYAPABICF2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IADYAPABICF24JOJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IADYAPAB","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:3375a6b012f5236e4b7fa04d534f271dd0fcdee7a54262adc2b3b5190f7c96ab","target":"graph","created_at":"2026-05-18T02:32:13Z","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":"We consider two CSP problems: the first CSP encodes 2D Sperner's lemma for the standard triangulation of the right triangle on $n^2$ small triangles; the second CSP encodes the fact that it is impossible to match cells of $n \\times n$ square to arrows (two horizontal, two vertical and four diagonal) such that arrows in two cells with a common edge differ by at most $45^\\circ$, and all arrows on the boundary of the square do not look outside (this fact is a corollary of the Brower's fixed point theorem). We prove that the tree-like resolution complexities of these CSPs are $2^{\\Theta(n)}$. For ","authors_text":"Anna Malova, Dmitry Itsykson, Dmitry Sokolov, Vsevolod Oparin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-02T22:37:17Z","title":"Tree-like resolution complexity of two planar problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1124","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:6662081372a466e1c0d371ca7ad267e174ebf9083ae219b8c7a6175aee94f625","target":"record","created_at":"2026-05-18T02:32:13Z","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":"4ad8c51a94e5c0169fac1a398a3ab856a9967fa6fcbb224c984ce2b6a5578d00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-02T22:37:17Z","title_canon_sha256":"1ab5964557e5d139ca6adf7d90e5e6da223b2482bd4619a0c41354bd9f56c15f"},"schema_version":"1.0","source":{"id":"1412.1124","kind":"arxiv","version":1}},"canonical_sha256":"4007803c01408bae25c906437667af1c1c829e80ae9d7fa69e703d785dcee400","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4007803c01408bae25c906437667af1c1c829e80ae9d7fa69e703d785dcee400","first_computed_at":"2026-05-18T02:32:13.381848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:13.381848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RzDfDdwUzwyQUtuR1Tq1nuLauOoGO1QsnOh/Om+BYxq/6URffPSZocO0eiIuDxArVb3GPIGVFvKQgkmRyy+LDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:13.382328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6662081372a466e1c0d371ca7ad267e174ebf9083ae219b8c7a6175aee94f625","sha256:3375a6b012f5236e4b7fa04d534f271dd0fcdee7a54262adc2b3b5190f7c96ab"],"state_sha256":"9963b047dd865b37544b074fccf97ae4f857ddf0593faebcd118a8f3c76baa2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJyj42i+R9dRtSEfXQJbu+dSZXyaALCA5tmMWH2YzNlnLAIsmh2xbd02haE/7pFh1U1jYlbA2DFNBNsX+Sr6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:23:57.360893Z","bundle_sha256":"f00848ed1fa45af0b1175e01431a2df68a9b9b5c38f1b3eb90991250f0404755"}}