{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AFYMCLHZH7E5EVTCCUBKIKBXHG","short_pith_number":"pith:AFYMCLHZ","canonical_record":{"source":{"id":"1503.03325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-03-11T13:34:10Z","cross_cats_sorted":[],"title_canon_sha256":"d655e2f7e13ed4e66e3ef6a67bd86bb1d680fc5899c09caa1cb15afb721ea812","abstract_canon_sha256":"7d78ff7e10988205036199ce116c2e6c19390f3af6218e38bed4cd292c70c1d9"},"schema_version":"1.0"},"canonical_sha256":"0170c12cf93fc9d256621502a42837399b411ce79cd2c4ad57bd53e9aa0aaccb","source":{"kind":"arxiv","id":"1503.03325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03325","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03325v2","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03325","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"AFYMCLHZH7E5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AFYMCLHZH7E5EVTC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AFYMCLHZ","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AFYMCLHZH7E5EVTCCUBKIKBXHG","target":"record","payload":{"canonical_record":{"source":{"id":"1503.03325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-03-11T13:34:10Z","cross_cats_sorted":[],"title_canon_sha256":"d655e2f7e13ed4e66e3ef6a67bd86bb1d680fc5899c09caa1cb15afb721ea812","abstract_canon_sha256":"7d78ff7e10988205036199ce116c2e6c19390f3af6218e38bed4cd292c70c1d9"},"schema_version":"1.0"},"canonical_sha256":"0170c12cf93fc9d256621502a42837399b411ce79cd2c4ad57bd53e9aa0aaccb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:23.935849Z","signature_b64":"5luybs2uK0c86mphaxLgiE36GKC5j2fcRc38Y9Nqt5MBReQJuGl0R06L02EpkZs8TCYK5LoNkxcMrTvcXtEPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0170c12cf93fc9d256621502a42837399b411ce79cd2c4ad57bd53e9aa0aaccb","last_reissued_at":"2026-05-17T23:51:23.935300Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:23.935300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.03325","source_version":2,"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-17T23:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ENLEARWx1JIt4dNq0hBfmeOFfpXbWK7XRr9/Mfqwt3XA2o4/gpcJQjevFzu2BuMM21tDqnV4ldo5ckapqQJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:11:11.331748Z"},"content_sha256":"bbb0eec5ce365424f85eb597b7a01df251ad9bbcda184c75e86f912a04cf9410","schema_version":"1.0","event_id":"sha256:bbb0eec5ce365424f85eb597b7a01df251ad9bbcda184c75e86f912a04cf9410"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AFYMCLHZH7E5EVTCCUBKIKBXHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A bound for Dickson's lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Helmut Schwichtenberg, Josef Berger","submitted_at":"2015-03-11T13:34:10Z","abstract_excerpt":"We consider a special case of Dickson's lemma: for any two functions $f,g$ on the natural numbers there are two numbers $i<j$ such that both $f$ and $g$ weakly increase on them, i.e., $f_i\\le f_j$ and $g_i \\le g_j$. By a combinatorial argument (due to the first author) a simple bound for such $i,j$ is constructed. The combinatorics is based on the finite pigeon hole principle and results in a descent lemma. From the descent lemma one can prove Dickson's lemma, then guess what the bound might be, and verify it by an appropriate proof. We also extract (via realizability) a bound from (a formaliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03325","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"},"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-17T23:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8p0AXfpfagfIelXrxfbOJB8JjVS3rbME2yjIigfPxUDxrelDWnTbMz5JIs4y/uNZl/dDu4SHP476nnz4opQ+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:11:11.332085Z"},"content_sha256":"b31c00e8dd2bf861af057aa525c66133f7ec45624cb84b972365b05942f8741b","schema_version":"1.0","event_id":"sha256:b31c00e8dd2bf861af057aa525c66133f7ec45624cb84b972365b05942f8741b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFYMCLHZH7E5EVTCCUBKIKBXHG/bundle.json","state_url":"https://pith.science/pith/AFYMCLHZH7E5EVTCCUBKIKBXHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFYMCLHZH7E5EVTCCUBKIKBXHG/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-27T08:11:11Z","links":{"resolver":"https://pith.science/pith/AFYMCLHZH7E5EVTCCUBKIKBXHG","bundle":"https://pith.science/pith/AFYMCLHZH7E5EVTCCUBKIKBXHG/bundle.json","state":"https://pith.science/pith/AFYMCLHZH7E5EVTCCUBKIKBXHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFYMCLHZH7E5EVTCCUBKIKBXHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AFYMCLHZH7E5EVTCCUBKIKBXHG","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":"7d78ff7e10988205036199ce116c2e6c19390f3af6218e38bed4cd292c70c1d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-03-11T13:34:10Z","title_canon_sha256":"d655e2f7e13ed4e66e3ef6a67bd86bb1d680fc5899c09caa1cb15afb721ea812"},"schema_version":"1.0","source":{"id":"1503.03325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03325","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03325v2","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03325","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"AFYMCLHZH7E5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AFYMCLHZH7E5EVTC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AFYMCLHZ","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:b31c00e8dd2bf861af057aa525c66133f7ec45624cb84b972365b05942f8741b","target":"graph","created_at":"2026-05-17T23:51:23Z","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 a special case of Dickson's lemma: for any two functions $f,g$ on the natural numbers there are two numbers $i<j$ such that both $f$ and $g$ weakly increase on them, i.e., $f_i\\le f_j$ and $g_i \\le g_j$. By a combinatorial argument (due to the first author) a simple bound for such $i,j$ is constructed. The combinatorics is based on the finite pigeon hole principle and results in a descent lemma. From the descent lemma one can prove Dickson's lemma, then guess what the bound might be, and verify it by an appropriate proof. We also extract (via realizability) a bound from (a formaliz","authors_text":"Helmut Schwichtenberg, Josef Berger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-03-11T13:34:10Z","title":"A bound for Dickson's lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03325","kind":"arxiv","version":2},"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:bbb0eec5ce365424f85eb597b7a01df251ad9bbcda184c75e86f912a04cf9410","target":"record","created_at":"2026-05-17T23:51:23Z","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":"7d78ff7e10988205036199ce116c2e6c19390f3af6218e38bed4cd292c70c1d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-03-11T13:34:10Z","title_canon_sha256":"d655e2f7e13ed4e66e3ef6a67bd86bb1d680fc5899c09caa1cb15afb721ea812"},"schema_version":"1.0","source":{"id":"1503.03325","kind":"arxiv","version":2}},"canonical_sha256":"0170c12cf93fc9d256621502a42837399b411ce79cd2c4ad57bd53e9aa0aaccb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0170c12cf93fc9d256621502a42837399b411ce79cd2c4ad57bd53e9aa0aaccb","first_computed_at":"2026-05-17T23:51:23.935300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:23.935300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5luybs2uK0c86mphaxLgiE36GKC5j2fcRc38Y9Nqt5MBReQJuGl0R06L02EpkZs8TCYK5LoNkxcMrTvcXtEPDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:23.935849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbb0eec5ce365424f85eb597b7a01df251ad9bbcda184c75e86f912a04cf9410","sha256:b31c00e8dd2bf861af057aa525c66133f7ec45624cb84b972365b05942f8741b"],"state_sha256":"3950037849df01c2c99b0632960c9c9e4dd1c86fc1e7da2a127851bb85d4b883"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWYqpkF04EQ6DHLgh9J3HQOUQOs3UhLYFbJUZZL71tFww0E9Eppx025ZE3nPPRqljDalgKyy+mETdxrKlq9CAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:11:11.333923Z","bundle_sha256":"621fb3d27db91388c8805ddb3c2fd5a8794c1cfa7d388648cb86fc17026bed66"}}