{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E4ULXIGG4EMH3NL7HNVRM6ORQN","short_pith_number":"pith:E4ULXIGG","schema_version":"1.0","canonical_sha256":"2728bba0c6e1187db57f3b6b1679d1837b3815c18249aee4dec5afb6d27e7c8e","source":{"kind":"arxiv","id":"1402.2184","version":2},"attestation_state":"computed","paper":{"title":"A SAT Attack on the Erdos Discrepancy Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.NT"],"primary_cat":"cs.DM","authors_text":"Alexei Lisitsa, Boris Konev","submitted_at":"2014-02-10T15:33:07Z","abstract_excerpt":"In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> C. The conjecture has been referred to as one of the major open problems in combinatorial number theory and discrepancy theory. For the particular case of C=1 a human proof of the conjecture exists; for C=2 a bespoke computer program had generated sequences of length 1124 having discrepancy 2, but the status of the conjecture remained open even for such a small bound"},"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":"1402.2184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-10T15:33:07Z","cross_cats_sorted":["math.CO","math.NT"],"title_canon_sha256":"556df27ff0458724d2f0d56484a4141d6a74e424c53b8100514cd98593f0df50","abstract_canon_sha256":"7b38373bfc3054f6bf4131e709e5639e27f0bdffb5b0c2741a58b8996f47d4bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.223871Z","signature_b64":"+FZGjw4e9lHzrDaBI1EtpLunAVBnJisaL/kRC8KRI2hUiUmF+hhYw3ccLNwozBRjmaMsPOy7bJKF5MnAeaE0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2728bba0c6e1187db57f3b6b1679d1837b3815c18249aee4dec5afb6d27e7c8e","last_reissued_at":"2026-05-18T02:58:56.223389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.223389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A SAT Attack on the Erdos Discrepancy Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.NT"],"primary_cat":"cs.DM","authors_text":"Alexei Lisitsa, Boris Konev","submitted_at":"2014-02-10T15:33:07Z","abstract_excerpt":"In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> C. The conjecture has been referred to as one of the major open problems in combinatorial number theory and discrepancy theory. For the particular case of C=1 a human proof of the conjecture exists; for C=2 a bespoke computer program had generated sequences of length 1124 having discrepancy 2, but the status of the conjecture remained open even for such a small bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2184","kind":"arxiv","version":2},"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":"1402.2184","created_at":"2026-05-18T02:58:56.223460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2184v2","created_at":"2026-05-18T02:58:56.223460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2184","created_at":"2026-05-18T02:58:56.223460+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4ULXIGG4EMH","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4ULXIGG4EMH3NL7","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4ULXIGG","created_at":"2026-05-18T12:28:25.294606+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/E4ULXIGG4EMH3NL7HNVRM6ORQN","json":"https://pith.science/pith/E4ULXIGG4EMH3NL7HNVRM6ORQN.json","graph_json":"https://pith.science/api/pith-number/E4ULXIGG4EMH3NL7HNVRM6ORQN/graph.json","events_json":"https://pith.science/api/pith-number/E4ULXIGG4EMH3NL7HNVRM6ORQN/events.json","paper":"https://pith.science/paper/E4ULXIGG"},"agent_actions":{"view_html":"https://pith.science/pith/E4ULXIGG4EMH3NL7HNVRM6ORQN","download_json":"https://pith.science/pith/E4ULXIGG4EMH3NL7HNVRM6ORQN.json","view_paper":"https://pith.science/paper/E4ULXIGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2184&json=true","fetch_graph":"https://pith.science/api/pith-number/E4ULXIGG4EMH3NL7HNVRM6ORQN/graph.json","fetch_events":"https://pith.science/api/pith-number/E4ULXIGG4EMH3NL7HNVRM6ORQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4ULXIGG4EMH3NL7HNVRM6ORQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4ULXIGG4EMH3NL7HNVRM6ORQN/action/storage_attestation","attest_author":"https://pith.science/pith/E4ULXIGG4EMH3NL7HNVRM6ORQN/action/author_attestation","sign_citation":"https://pith.science/pith/E4ULXIGG4EMH3NL7HNVRM6ORQN/action/citation_signature","submit_replication":"https://pith.science/pith/E4ULXIGG4EMH3NL7HNVRM6ORQN/action/replication_record"}},"created_at":"2026-05-18T02:58:56.223460+00:00","updated_at":"2026-05-18T02:58:56.223460+00:00"}