{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UNSWJN4BZPL2LWZMEBPCLJ5D3S","short_pith_number":"pith:UNSWJN4B","schema_version":"1.0","canonical_sha256":"a36564b781cbd7a5db2c205e25a7a3dca1d1dba57ae913f732e2ab2cbf8423f4","source":{"kind":"arxiv","id":"1211.5259","version":1},"attestation_state":"computed","paper":{"title":"The Parametric Ordinal-Recursive Complexity of Post Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Prateek Karandikar, Sylvain Schmitz","submitted_at":"2012-11-22T11:14:32Z","abstract_excerpt":"Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet."},"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":"1211.5259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-22T11:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"f7db4bea4a7b76b15c4d953934d2a0a533044fe76da1f19e23dd52b9a684dd35","abstract_canon_sha256":"fb8f46b04c8d17ff362d0304c9a917e077d9126a47e7e50aed0fc189af4362d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:20.916228Z","signature_b64":"II9Ci4+g0Yr24o+KAM6f4ASYUFGiFQdIFZEsR86aV8JAsqTQtN/f/1dOcx5C6mbWkr2XmElJkLTVQEBiTCIjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a36564b781cbd7a5db2c205e25a7a3dca1d1dba57ae913f732e2ab2cbf8423f4","last_reissued_at":"2026-05-18T03:15:20.915272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:20.915272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parametric Ordinal-Recursive Complexity of Post Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Prateek Karandikar, Sylvain Schmitz","submitted_at":"2012-11-22T11:14:32Z","abstract_excerpt":"Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5259","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":"1211.5259","created_at":"2026-05-18T03:15:20.915453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5259v1","created_at":"2026-05-18T03:15:20.915453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5259","created_at":"2026-05-18T03:15:20.915453+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNSWJN4BZPL2","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNSWJN4BZPL2LWZM","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNSWJN4B","created_at":"2026-05-18T12:27:23.164592+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/UNSWJN4BZPL2LWZMEBPCLJ5D3S","json":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S.json","graph_json":"https://pith.science/api/pith-number/UNSWJN4BZPL2LWZMEBPCLJ5D3S/graph.json","events_json":"https://pith.science/api/pith-number/UNSWJN4BZPL2LWZMEBPCLJ5D3S/events.json","paper":"https://pith.science/paper/UNSWJN4B"},"agent_actions":{"view_html":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S","download_json":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S.json","view_paper":"https://pith.science/paper/UNSWJN4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5259&json=true","fetch_graph":"https://pith.science/api/pith-number/UNSWJN4BZPL2LWZMEBPCLJ5D3S/graph.json","fetch_events":"https://pith.science/api/pith-number/UNSWJN4BZPL2LWZMEBPCLJ5D3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/action/storage_attestation","attest_author":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/action/author_attestation","sign_citation":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/action/citation_signature","submit_replication":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/action/replication_record"}},"created_at":"2026-05-18T03:15:20.915453+00:00","updated_at":"2026-05-18T03:15:20.915453+00:00"}