{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:GYXDBRXVQS64QIKVWU6MR66F24","short_pith_number":"pith:GYXDBRXV","canonical_record":{"source":{"id":"cs/0609039","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-09-08T07:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"c385f58c5d264cce0b411af92265110ac0e8da700521f6fad3ec760387227278","abstract_canon_sha256":"3384f4d9bca61e9c85f731e33d17b2e98c1243f9251878a345afaf883032561b"},"schema_version":"1.0"},"canonical_sha256":"362e30c6f584bdc82155b53cc8fbc5d71953a91d1e944a46c966523200f5e4fe","source":{"kind":"arxiv","id":"cs/0609039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0609039","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0609039v2","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0609039","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"GYXDBRXVQS64","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"GYXDBRXVQS64QIKV","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"GYXDBRXV","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:GYXDBRXVQS64QIKVWU6MR66F24","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0609039","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-09-08T07:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"c385f58c5d264cce0b411af92265110ac0e8da700521f6fad3ec760387227278","abstract_canon_sha256":"3384f4d9bca61e9c85f731e33d17b2e98c1243f9251878a345afaf883032561b"},"schema_version":"1.0"},"canonical_sha256":"362e30c6f584bdc82155b53cc8fbc5d71953a91d1e944a46c966523200f5e4fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:54.502230Z","signature_b64":"BkqXNviK8MIQkW/zXGpOIvt6iepl2CmZjluG7nrZyK2/mgKcwpL/9It3a6qAetnO553tQJJ+rA34k/mG4Hd0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"362e30c6f584bdc82155b53cc8fbc5d71953a91d1e944a46c966523200f5e4fe","last_reissued_at":"2026-05-18T01:08:54.501707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:54.501707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0609039","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-18T01:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPfWFL7lqR+0ZnUKb8UznlpCidZVUGiVH7euinp9fgVz15sy4tKRHbAtVJG0Wo5M94tDYHPiIbZSy8TnnftbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:09:34.983541Z"},"content_sha256":"6bb970e21b08452d1f322d327a1ab2a28ccc9f95399b29f4ac535b181c0b6331","schema_version":"1.0","event_id":"sha256:6bb970e21b08452d1f322d327a1ab2a28ccc9f95399b29f4ac535b181c0b6331"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:GYXDBRXVQS64QIKVWU6MR66F24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Higher-Order Termination: from Kruskal to Computability","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Albert Rubio, Fr\\'ed\\'eric Blanqui (INRIA Lorraine - LORIA), Jean-Pierre Jouannaud (LIX)","submitted_at":"2006-09-08T07:48:08Z","abstract_excerpt":"Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination). In computer science, termination has always been an important issue for showing programs correct. In the early days of logic, strong normalization was usually shown by assigning ordinals to expressions in such a way that eliminating a cut would yield an expression with a smaller ordinal. In the early days of verification, computer scientists used similar ideas, interpreting the arguments of a program call"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0609039","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-18T01:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrsrKC1sYj3zMJZoPJXPhlckSi4O9YbwSxWPlpLzH2H+zghWvF3RNn5JwDeQGc58BKGxFTeJRIe6Klup4CJkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:09:34.984188Z"},"content_sha256":"7bfc590e3489827359eb01213c4acace02a7b6cb817a453893da1b635c22819e","schema_version":"1.0","event_id":"sha256:7bfc590e3489827359eb01213c4acace02a7b6cb817a453893da1b635c22819e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYXDBRXVQS64QIKVWU6MR66F24/bundle.json","state_url":"https://pith.science/pith/GYXDBRXVQS64QIKVWU6MR66F24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYXDBRXVQS64QIKVWU6MR66F24/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-06T18:09:34Z","links":{"resolver":"https://pith.science/pith/GYXDBRXVQS64QIKVWU6MR66F24","bundle":"https://pith.science/pith/GYXDBRXVQS64QIKVWU6MR66F24/bundle.json","state":"https://pith.science/pith/GYXDBRXVQS64QIKVWU6MR66F24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYXDBRXVQS64QIKVWU6MR66F24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:GYXDBRXVQS64QIKVWU6MR66F24","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":"3384f4d9bca61e9c85f731e33d17b2e98c1243f9251878a345afaf883032561b","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-09-08T07:48:08Z","title_canon_sha256":"c385f58c5d264cce0b411af92265110ac0e8da700521f6fad3ec760387227278"},"schema_version":"1.0","source":{"id":"cs/0609039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0609039","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0609039v2","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0609039","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"GYXDBRXVQS64","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"GYXDBRXVQS64QIKV","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"GYXDBRXV","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:7bfc590e3489827359eb01213c4acace02a7b6cb817a453893da1b635c22819e","target":"graph","created_at":"2026-05-18T01:08:54Z","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":"Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination). In computer science, termination has always been an important issue for showing programs correct. In the early days of logic, strong normalization was usually shown by assigning ordinals to expressions in such a way that eliminating a cut would yield an expression with a smaller ordinal. In the early days of verification, computer scientists used similar ideas, interpreting the arguments of a program call","authors_text":"Albert Rubio, Fr\\'ed\\'eric Blanqui (INRIA Lorraine - LORIA), Jean-Pierre Jouannaud (LIX)","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2006-09-08T07:48:08Z","title":"Higher-Order Termination: from Kruskal to Computability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0609039","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:6bb970e21b08452d1f322d327a1ab2a28ccc9f95399b29f4ac535b181c0b6331","target":"record","created_at":"2026-05-18T01:08:54Z","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":"3384f4d9bca61e9c85f731e33d17b2e98c1243f9251878a345afaf883032561b","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-09-08T07:48:08Z","title_canon_sha256":"c385f58c5d264cce0b411af92265110ac0e8da700521f6fad3ec760387227278"},"schema_version":"1.0","source":{"id":"cs/0609039","kind":"arxiv","version":2}},"canonical_sha256":"362e30c6f584bdc82155b53cc8fbc5d71953a91d1e944a46c966523200f5e4fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"362e30c6f584bdc82155b53cc8fbc5d71953a91d1e944a46c966523200f5e4fe","first_computed_at":"2026-05-18T01:08:54.501707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:54.501707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BkqXNviK8MIQkW/zXGpOIvt6iepl2CmZjluG7nrZyK2/mgKcwpL/9It3a6qAetnO553tQJJ+rA34k/mG4Hd0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:54.502230Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0609039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bb970e21b08452d1f322d327a1ab2a28ccc9f95399b29f4ac535b181c0b6331","sha256:7bfc590e3489827359eb01213c4acace02a7b6cb817a453893da1b635c22819e"],"state_sha256":"439fdbb93ffcdb961787743367a3a1bbebc43c278d1dcb579c1131870d40d58c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/3z91HPq3a8vCunst2MEEcAU4O1p1mKtXPdybtJ5hBAQzPTvh5G995S3BNMKnSz/N+VsD0smd8nKzwsv+vnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:09:34.988527Z","bundle_sha256":"400c7c909148ff2ea96b2580c3bb62beba436384197799e0c307d9d1883a5179"}}