{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7DGRHJJ6R2BC2LE5GTHKZATKKQ","short_pith_number":"pith:7DGRHJJ6","schema_version":"1.0","canonical_sha256":"f8cd13a53e8e822d2c9d34ceac826a540ab1ac85089a1217ce55415dc0025d88","source":{"kind":"arxiv","id":"1309.5130","version":1},"attestation_state":"computed","paper":{"title":"A Comparison of Well-Quasi Orders on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.PL","authors_text":"Denmark), Torben {\\AE}. Mogensen (DIKU, University of Copenhagen","submitted_at":"2013-09-20T01:43:16Z","abstract_excerpt":"Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation.\n  We compare eight well-quasi orders on how discriminative they are and their computational complexity.  The studied well-quasi orders comprise two very simple examples, two examples from literature on supercompilation and four new proposed by the author.\n  We also discuss combining several well-quasi orders to get well-quasi orders of higher discriminative power.  This adds 19 more well-quasi orders to the list."},"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":"1309.5130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-09-20T01:43:16Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"3ef146e6fa45b46d19bce5c5c81541d6568eb14002ab998836cc23155ce0189d","abstract_canon_sha256":"a073a20b1534f18d070588721b3288adff939aac8d2f9f0e2af230d989b663f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:47.634384Z","signature_b64":"KVqg5LcUuALpOOYGMEb3Q81ugp9XiND0T/iwl94Lpq9r4M9s3WcdJdhRlcrs0T2L5zNpTWqrAKfPexGYAhUBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8cd13a53e8e822d2c9d34ceac826a540ab1ac85089a1217ce55415dc0025d88","last_reissued_at":"2026-05-18T03:12:47.633734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:47.633734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison of Well-Quasi Orders on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.PL","authors_text":"Denmark), Torben {\\AE}. Mogensen (DIKU, University of Copenhagen","submitted_at":"2013-09-20T01:43:16Z","abstract_excerpt":"Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation.\n  We compare eight well-quasi orders on how discriminative they are and their computational complexity.  The studied well-quasi orders comprise two very simple examples, two examples from literature on supercompilation and four new proposed by the author.\n  We also discuss combining several well-quasi orders to get well-quasi orders of higher discriminative power.  This adds 19 more well-quasi orders to the list."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5130","kind":"arxiv","version":1},"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":"1309.5130","created_at":"2026-05-18T03:12:47.633874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5130v1","created_at":"2026-05-18T03:12:47.633874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5130","created_at":"2026-05-18T03:12:47.633874+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DGRHJJ6R2BC","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DGRHJJ6R2BC2LE5","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DGRHJJ6","created_at":"2026-05-18T12:27:36.564083+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/7DGRHJJ6R2BC2LE5GTHKZATKKQ","json":"https://pith.science/pith/7DGRHJJ6R2BC2LE5GTHKZATKKQ.json","graph_json":"https://pith.science/api/pith-number/7DGRHJJ6R2BC2LE5GTHKZATKKQ/graph.json","events_json":"https://pith.science/api/pith-number/7DGRHJJ6R2BC2LE5GTHKZATKKQ/events.json","paper":"https://pith.science/paper/7DGRHJJ6"},"agent_actions":{"view_html":"https://pith.science/pith/7DGRHJJ6R2BC2LE5GTHKZATKKQ","download_json":"https://pith.science/pith/7DGRHJJ6R2BC2LE5GTHKZATKKQ.json","view_paper":"https://pith.science/paper/7DGRHJJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5130&json=true","fetch_graph":"https://pith.science/api/pith-number/7DGRHJJ6R2BC2LE5GTHKZATKKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7DGRHJJ6R2BC2LE5GTHKZATKKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DGRHJJ6R2BC2LE5GTHKZATKKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DGRHJJ6R2BC2LE5GTHKZATKKQ/action/storage_attestation","attest_author":"https://pith.science/pith/7DGRHJJ6R2BC2LE5GTHKZATKKQ/action/author_attestation","sign_citation":"https://pith.science/pith/7DGRHJJ6R2BC2LE5GTHKZATKKQ/action/citation_signature","submit_replication":"https://pith.science/pith/7DGRHJJ6R2BC2LE5GTHKZATKKQ/action/replication_record"}},"created_at":"2026-05-18T03:12:47.633874+00:00","updated_at":"2026-05-18T03:12:47.633874+00:00"}