{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MKNVBIWXIEVXG5BGCYATEO3QYN","short_pith_number":"pith:MKNVBIWX","canonical_record":{"source":{"id":"1007.2989","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-18T11:14:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5fd394c0c20cada6a3b7ca82165b939fa5db5fa84ab4185763d4c4160d935130","abstract_canon_sha256":"1ba3803befb4b5b7abc611416adcdfa889345ebb6f2b1a202f9b8e71098f8805"},"schema_version":"1.0"},"canonical_sha256":"629b50a2d7412b7374261601323b70c36462294c6fdf10c1b035097b204ebf26","source":{"kind":"arxiv","id":"1007.2989","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2989","created_at":"2026-05-18T04:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2989v3","created_at":"2026-05-18T04:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2989","created_at":"2026-05-18T04:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"MKNVBIWXIEVX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MKNVBIWXIEVXG5BG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MKNVBIWX","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MKNVBIWXIEVXG5BGCYATEO3QYN","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2989","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-18T11:14:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5fd394c0c20cada6a3b7ca82165b939fa5db5fa84ab4185763d4c4160d935130","abstract_canon_sha256":"1ba3803befb4b5b7abc611416adcdfa889345ebb6f2b1a202f9b8e71098f8805"},"schema_version":"1.0"},"canonical_sha256":"629b50a2d7412b7374261601323b70c36462294c6fdf10c1b035097b204ebf26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:25.095337Z","signature_b64":"RsdNBgNdvISa9JhctnMX78wiJFsocOVvzSk3UsSXXAljX1JWcfcnaABKM7o7xp5lZw1gekT/NAkv9xwfW2lKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"629b50a2d7412b7374261601323b70c36462294c6fdf10c1b035097b204ebf26","last_reissued_at":"2026-05-18T04:17:25.094842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:25.094842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2989","source_version":3,"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-18T04:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mu7IhKPSWYakjdXTiBu0Vw+AhH3hpzRcJRCP9fn05VbalQoLBLQp2gKReA67whwIZDPuI5Jsqf4/VjMGtC/rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:35:50.254125Z"},"content_sha256":"11b8131a73a117a907982992a5d3bf2a8147c85147800a54cb9bc0539fe0beb4","schema_version":"1.0","event_id":"sha256:11b8131a73a117a907982992a5d3bf2a8147c85147800a54cb9bc0539fe0beb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MKNVBIWXIEVXG5BGCYATEO3QYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Diego Figueira, Philippe Schnoebelen, Santiago Figueira, Sylvain Schmitz","submitted_at":"2010-07-18T11:14:16Z","abstract_excerpt":"Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such termination proofs, and the existing literature is not very helpful in these matters.\n  We propose a new analysis of the length of bad sequences over (N^k,\\leq) and explain how one may derive complexity upper bounds from termination proofs. Our upper bounds improve earlier results and are essentially tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2989","kind":"arxiv","version":3},"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-18T04:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1L6/NflBa4m/paOcGxD4Y7NJDVDHilFBWwarUKphWybrjMEUD6y0hU1cRkMhVYShMdRybleWkVEL53xYWqsbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:35:50.254536Z"},"content_sha256":"2ef9b0d192fe1ef7f9ebd03d92de830a6aedebf8d3c3c88a9f5218c46e610966","schema_version":"1.0","event_id":"sha256:2ef9b0d192fe1ef7f9ebd03d92de830a6aedebf8d3c3c88a9f5218c46e610966"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKNVBIWXIEVXG5BGCYATEO3QYN/bundle.json","state_url":"https://pith.science/pith/MKNVBIWXIEVXG5BGCYATEO3QYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKNVBIWXIEVXG5BGCYATEO3QYN/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-05-25T19:35:50Z","links":{"resolver":"https://pith.science/pith/MKNVBIWXIEVXG5BGCYATEO3QYN","bundle":"https://pith.science/pith/MKNVBIWXIEVXG5BGCYATEO3QYN/bundle.json","state":"https://pith.science/pith/MKNVBIWXIEVXG5BGCYATEO3QYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKNVBIWXIEVXG5BGCYATEO3QYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MKNVBIWXIEVXG5BGCYATEO3QYN","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":"1ba3803befb4b5b7abc611416adcdfa889345ebb6f2b1a202f9b8e71098f8805","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-18T11:14:16Z","title_canon_sha256":"5fd394c0c20cada6a3b7ca82165b939fa5db5fa84ab4185763d4c4160d935130"},"schema_version":"1.0","source":{"id":"1007.2989","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2989","created_at":"2026-05-18T04:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2989v3","created_at":"2026-05-18T04:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2989","created_at":"2026-05-18T04:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"MKNVBIWXIEVX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MKNVBIWXIEVXG5BG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MKNVBIWX","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:2ef9b0d192fe1ef7f9ebd03d92de830a6aedebf8d3c3c88a9f5218c46e610966","target":"graph","created_at":"2026-05-18T04:17:25Z","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":"Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such termination proofs, and the existing literature is not very helpful in these matters.\n  We propose a new analysis of the length of bad sequences over (N^k,\\leq) and explain how one may derive complexity upper bounds from termination proofs. Our upper bounds improve earlier results and are essentially tight.","authors_text":"Diego Figueira, Philippe Schnoebelen, Santiago Figueira, Sylvain Schmitz","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-18T11:14:16Z","title":"Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2989","kind":"arxiv","version":3},"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:11b8131a73a117a907982992a5d3bf2a8147c85147800a54cb9bc0539fe0beb4","target":"record","created_at":"2026-05-18T04:17:25Z","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":"1ba3803befb4b5b7abc611416adcdfa889345ebb6f2b1a202f9b8e71098f8805","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-18T11:14:16Z","title_canon_sha256":"5fd394c0c20cada6a3b7ca82165b939fa5db5fa84ab4185763d4c4160d935130"},"schema_version":"1.0","source":{"id":"1007.2989","kind":"arxiv","version":3}},"canonical_sha256":"629b50a2d7412b7374261601323b70c36462294c6fdf10c1b035097b204ebf26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"629b50a2d7412b7374261601323b70c36462294c6fdf10c1b035097b204ebf26","first_computed_at":"2026-05-18T04:17:25.094842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:25.094842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RsdNBgNdvISa9JhctnMX78wiJFsocOVvzSk3UsSXXAljX1JWcfcnaABKM7o7xp5lZw1gekT/NAkv9xwfW2lKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:25.095337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2989","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11b8131a73a117a907982992a5d3bf2a8147c85147800a54cb9bc0539fe0beb4","sha256:2ef9b0d192fe1ef7f9ebd03d92de830a6aedebf8d3c3c88a9f5218c46e610966"],"state_sha256":"37651961c209fdf4aec829604d5339f2fc8d674a26b6ec261f41e766c9410cb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UWkJt8r/Eqt/Kc3lRb/viHiZq9LA8JLOPPg87v9pryh1HxH6oeZ03qy1Vm8xmOBpN4/jUasjjmXFDyxIha+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:35:50.258161Z","bundle_sha256":"ca7202d814724f7fc76f09ae7cdea3413a501dc6bbff26501645842e2dcf8c53"}}