{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FUO2ND37UV7N3VL2K2QTQH6ZX5","short_pith_number":"pith:FUO2ND37","schema_version":"1.0","canonical_sha256":"2d1da68f7fa57eddd57a56a1381fd9bf4c234a25b063078a6a3a93ead2798fe2","source":{"kind":"arxiv","id":"1506.05279","version":2},"attestation_state":"computed","paper":{"title":"Non-dominating sequences of vectors using only resets and increments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eryk Kopczynski, Tomasz Gogacz, Wojciech Czerwinski","submitted_at":"2015-06-17T11:21:35Z","abstract_excerpt":"We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\\theta (n)}}$. It perfectly match the previously known upperbound."},"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":"1506.05279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-06-17T11:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"6735f2193b6b58a4ec23c379b7cb3b0062aabcda6889a3d50aab638c803d3e1c","abstract_canon_sha256":"1590b5e756036ea4fc001cf276a5efc583bb477c4277736b3d3608f49dfab51f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:11.700557Z","signature_b64":"wcH5Fj1BMjcivGVIw4ntaqTb75pybmQzmKREzEbIqObC51bE7spR/tkB96nbvTl0mQ0rcdTqffyKmQXlzeqhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d1da68f7fa57eddd57a56a1381fd9bf4c234a25b063078a6a3a93ead2798fe2","last_reissued_at":"2026-05-18T01:25:11.699978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:11.699978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-dominating sequences of vectors using only resets and increments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eryk Kopczynski, Tomasz Gogacz, Wojciech Czerwinski","submitted_at":"2015-06-17T11:21:35Z","abstract_excerpt":"We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\\theta (n)}}$. It perfectly match the previously known upperbound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05279","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":"1506.05279","created_at":"2026-05-18T01:25:11.700058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.05279v2","created_at":"2026-05-18T01:25:11.700058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05279","created_at":"2026-05-18T01:25:11.700058+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUO2ND37UV7N","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUO2ND37UV7N3VL2","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUO2ND37","created_at":"2026-05-18T12:29:22.688609+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/FUO2ND37UV7N3VL2K2QTQH6ZX5","json":"https://pith.science/pith/FUO2ND37UV7N3VL2K2QTQH6ZX5.json","graph_json":"https://pith.science/api/pith-number/FUO2ND37UV7N3VL2K2QTQH6ZX5/graph.json","events_json":"https://pith.science/api/pith-number/FUO2ND37UV7N3VL2K2QTQH6ZX5/events.json","paper":"https://pith.science/paper/FUO2ND37"},"agent_actions":{"view_html":"https://pith.science/pith/FUO2ND37UV7N3VL2K2QTQH6ZX5","download_json":"https://pith.science/pith/FUO2ND37UV7N3VL2K2QTQH6ZX5.json","view_paper":"https://pith.science/paper/FUO2ND37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.05279&json=true","fetch_graph":"https://pith.science/api/pith-number/FUO2ND37UV7N3VL2K2QTQH6ZX5/graph.json","fetch_events":"https://pith.science/api/pith-number/FUO2ND37UV7N3VL2K2QTQH6ZX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUO2ND37UV7N3VL2K2QTQH6ZX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUO2ND37UV7N3VL2K2QTQH6ZX5/action/storage_attestation","attest_author":"https://pith.science/pith/FUO2ND37UV7N3VL2K2QTQH6ZX5/action/author_attestation","sign_citation":"https://pith.science/pith/FUO2ND37UV7N3VL2K2QTQH6ZX5/action/citation_signature","submit_replication":"https://pith.science/pith/FUO2ND37UV7N3VL2K2QTQH6ZX5/action/replication_record"}},"created_at":"2026-05-18T01:25:11.700058+00:00","updated_at":"2026-05-18T01:25:11.700058+00:00"}