{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UNSWJN4BZPL2LWZMEBPCLJ5D3S","short_pith_number":"pith:UNSWJN4B","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"},"canonical_sha256":"a36564b781cbd7a5db2c205e25a7a3dca1d1dba57ae913f732e2ab2cbf8423f4","source":{"kind":"arxiv","id":"1211.5259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5259","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5259v1","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5259","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"UNSWJN4BZPL2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UNSWJN4BZPL2LWZM","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UNSWJN4B","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UNSWJN4BZPL2LWZMEBPCLJ5D3S","target":"record","payload":{"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"},"canonical_sha256":"a36564b781cbd7a5db2c205e25a7a3dca1d1dba57ae913f732e2ab2cbf8423f4","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"},"source_kind":"arxiv","source_id":"1211.5259","source_version":1,"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-18T03:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rp+mqBOls3PzsOv86hcDw/B2XbcRV4fYmTsZ5lV+0mK404qxi7GvfImKXyTtGnJgSR3k7t+5ilMOj3uSKoW6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:17:12.770310Z"},"content_sha256":"9910b5467cb70caee9a67f89e64a4205623c8c879f577d234c169d9eaea6ec74","schema_version":"1.0","event_id":"sha256:9910b5467cb70caee9a67f89e64a4205623c8c879f577d234c169d9eaea6ec74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UNSWJN4BZPL2LWZMEBPCLJ5D3S","target":"graph","payload":{"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"},"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-18T03:15:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DJ+yaxVL1w4S1piXZPXh8yZvAYn6mmieSn9DiLNv6A1jU1LBzbfJLEFSydWr1LJg5L9ZMYPTMHx1qL7M74sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:17:12.770677Z"},"content_sha256":"1a4da3d8a1a1388360963d55df849de3754c17f65ea73468efca139a397df24b","schema_version":"1.0","event_id":"sha256:1a4da3d8a1a1388360963d55df849de3754c17f65ea73468efca139a397df24b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/bundle.json","state_url":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/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-26T21:17:12Z","links":{"resolver":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S","bundle":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/bundle.json","state":"https://pith.science/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNSWJN4BZPL2LWZMEBPCLJ5D3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UNSWJN4BZPL2LWZMEBPCLJ5D3S","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":"fb8f46b04c8d17ff362d0304c9a917e077d9126a47e7e50aed0fc189af4362d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-22T11:14:32Z","title_canon_sha256":"f7db4bea4a7b76b15c4d953934d2a0a533044fe76da1f19e23dd52b9a684dd35"},"schema_version":"1.0","source":{"id":"1211.5259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5259","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5259v1","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5259","created_at":"2026-05-18T03:15:20Z"},{"alias_kind":"pith_short_12","alias_value":"UNSWJN4BZPL2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UNSWJN4BZPL2LWZM","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UNSWJN4B","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:1a4da3d8a1a1388360963d55df849de3754c17f65ea73468efca139a397df24b","target":"graph","created_at":"2026-05-18T03:15:20Z","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":"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.","authors_text":"Prateek Karandikar, Sylvain Schmitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-22T11:14:32Z","title":"The Parametric Ordinal-Recursive Complexity of Post Embedding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5259","kind":"arxiv","version":1},"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:9910b5467cb70caee9a67f89e64a4205623c8c879f577d234c169d9eaea6ec74","target":"record","created_at":"2026-05-18T03:15:20Z","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":"fb8f46b04c8d17ff362d0304c9a917e077d9126a47e7e50aed0fc189af4362d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-22T11:14:32Z","title_canon_sha256":"f7db4bea4a7b76b15c4d953934d2a0a533044fe76da1f19e23dd52b9a684dd35"},"schema_version":"1.0","source":{"id":"1211.5259","kind":"arxiv","version":1}},"canonical_sha256":"a36564b781cbd7a5db2c205e25a7a3dca1d1dba57ae913f732e2ab2cbf8423f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a36564b781cbd7a5db2c205e25a7a3dca1d1dba57ae913f732e2ab2cbf8423f4","first_computed_at":"2026-05-18T03:15:20.915272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:20.915272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"II9Ci4+g0Yr24o+KAM6f4ASYUFGiFQdIFZEsR86aV8JAsqTQtN/f/1dOcx5C6mbWkr2XmElJkLTVQEBiTCIjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:20.916228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9910b5467cb70caee9a67f89e64a4205623c8c879f577d234c169d9eaea6ec74","sha256:1a4da3d8a1a1388360963d55df849de3754c17f65ea73468efca139a397df24b"],"state_sha256":"ac91986494a6ace32217602d199d544bbbeaca92b486099c354f7d24148cde91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3OxqgRofYkUji2ue7o4KwxemdoHuonbtBMlU8E2t7Xhg1g9o6Hrxwlc2pQ+TO87y9igubADrrWn2JxZkZgwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:17:12.772739Z","bundle_sha256":"db1136b3e027ef6053c76135556308b916f59e4854323d8ca29a9ca5afdae617"}}