{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3G5MQXUWYCCGN7A6QGWBB5RCAD","short_pith_number":"pith:3G5MQXUW","schema_version":"1.0","canonical_sha256":"d9bac85e96c08466fc1e81ac10f62200c1cf235f1296efdda8b0f130c2bf70a2","source":{"kind":"arxiv","id":"1904.10703","version":1},"attestation_state":"computed","paper":{"title":"The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Jean Goubault-Larrecq, K. Narayan Kumar, Philippe Schnoebelen, Prateek Karandikar, Simon Halfon","submitted_at":"2019-04-24T09:06:15Z","abstract_excerpt":"Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these sets. These algorithms can be built in a generic or parameterized way, in parallel with the way complex WQOs are obtained by combining or modifying simpler WQOs."},"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":"1904.10703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-24T09:06:15Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"e0e5f606c05c0302f6d74f506ef8b0cce930510616b102abb0534519ced80e79","abstract_canon_sha256":"fb20850749a5d652c6d450b5d96fc575d5b33fffb2b41b5ac821543788be5cd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:50.270009Z","signature_b64":"Tjkc5fx+ZE6zwG8FyFKwrGV1ZwVvbECVo1I0TnB09p/UtbHeVp9PGZPMTbvUg9bsDSLVnu/YZJwsV5M1ah4ABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9bac85e96c08466fc1e81ac10f62200c1cf235f1296efdda8b0f130c2bf70a2","last_reissued_at":"2026-05-17T23:47:50.269558Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:50.269558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Jean Goubault-Larrecq, K. Narayan Kumar, Philippe Schnoebelen, Prateek Karandikar, Simon Halfon","submitted_at":"2019-04-24T09:06:15Z","abstract_excerpt":"Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these sets. These algorithms can be built in a generic or parameterized way, in parallel with the way complex WQOs are obtained by combining or modifying simpler WQOs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10703","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":"1904.10703","created_at":"2026-05-17T23:47:50.269631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10703v1","created_at":"2026-05-17T23:47:50.269631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10703","created_at":"2026-05-17T23:47:50.269631+00:00"},{"alias_kind":"pith_short_12","alias_value":"3G5MQXUWYCCG","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3G5MQXUWYCCGN7A6","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3G5MQXUW","created_at":"2026-05-18T12:33:07.085635+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/3G5MQXUWYCCGN7A6QGWBB5RCAD","json":"https://pith.science/pith/3G5MQXUWYCCGN7A6QGWBB5RCAD.json","graph_json":"https://pith.science/api/pith-number/3G5MQXUWYCCGN7A6QGWBB5RCAD/graph.json","events_json":"https://pith.science/api/pith-number/3G5MQXUWYCCGN7A6QGWBB5RCAD/events.json","paper":"https://pith.science/paper/3G5MQXUW"},"agent_actions":{"view_html":"https://pith.science/pith/3G5MQXUWYCCGN7A6QGWBB5RCAD","download_json":"https://pith.science/pith/3G5MQXUWYCCGN7A6QGWBB5RCAD.json","view_paper":"https://pith.science/paper/3G5MQXUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10703&json=true","fetch_graph":"https://pith.science/api/pith-number/3G5MQXUWYCCGN7A6QGWBB5RCAD/graph.json","fetch_events":"https://pith.science/api/pith-number/3G5MQXUWYCCGN7A6QGWBB5RCAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3G5MQXUWYCCGN7A6QGWBB5RCAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3G5MQXUWYCCGN7A6QGWBB5RCAD/action/storage_attestation","attest_author":"https://pith.science/pith/3G5MQXUWYCCGN7A6QGWBB5RCAD/action/author_attestation","sign_citation":"https://pith.science/pith/3G5MQXUWYCCGN7A6QGWBB5RCAD/action/citation_signature","submit_replication":"https://pith.science/pith/3G5MQXUWYCCGN7A6QGWBB5RCAD/action/replication_record"}},"created_at":"2026-05-17T23:47:50.269631+00:00","updated_at":"2026-05-17T23:47:50.269631+00:00"}