{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NZFV44W3T3ODYT66ONKLTIAY3B","short_pith_number":"pith:NZFV44W3","canonical_record":{"source":{"id":"2310.01004","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-10-02T09:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"cfdb21401e56ac498610f4e0ad7e52ccbb417bc903b9f6826f380d13195f9efa","abstract_canon_sha256":"e772dada000b91a305cbd2bab91fb2f572a76a39bb9efb7b849ae1795569050d"},"schema_version":"1.0"},"canonical_sha256":"6e4b5e72db9edc3c4fde7354b9a018d854ef9556eb099db4a78e52ce995f9765","source":{"kind":"arxiv","id":"2310.01004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01004","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01004v1","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01004","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"pith_short_12","alias_value":"NZFV44W3T3OD","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"pith_short_16","alias_value":"NZFV44W3T3ODYT66","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"pith_short_8","alias_value":"NZFV44W3","created_at":"2026-07-05T06:56:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NZFV44W3T3ODYT66ONKLTIAY3B","target":"record","payload":{"canonical_record":{"source":{"id":"2310.01004","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-10-02T09:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"cfdb21401e56ac498610f4e0ad7e52ccbb417bc903b9f6826f380d13195f9efa","abstract_canon_sha256":"e772dada000b91a305cbd2bab91fb2f572a76a39bb9efb7b849ae1795569050d"},"schema_version":"1.0"},"canonical_sha256":"6e4b5e72db9edc3c4fde7354b9a018d854ef9556eb099db4a78e52ce995f9765","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:13.182844Z","signature_b64":"3rZe7qY2zjLR0x7bZEMR3mHVeknc6Jgwl+PvCyaOW4nI2dpGJtamZlAx9AGcUOqTAeEkz6Cyxfj3baJM7WleDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e4b5e72db9edc3c4fde7354b9a018d854ef9556eb099db4a78e52ce995f9765","last_reissued_at":"2026-07-05T06:56:13.182428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:13.182428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.01004","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-07-05T06:56:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VeVDCS11DEYnNo9Gl0VZlz5TlmCvJ210Z5R1SYcG9AR1Li1HPCgIEKK5EdJhjDUN5UVNz1J8NsLB4c9fef2uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T14:49:32.265636Z"},"content_sha256":"16737faa494e4696cdb0a617e672d36fa4ec7226f4998c900ab436d063f7206f","schema_version":"1.0","event_id":"sha256:16737faa494e4696cdb0a617e672d36fa4ec7226f4998c900ab436d063f7206f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NZFV44W3T3ODYT66ONKLTIAY3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Recursive Arrival Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Thomas Webster (University of Edinburgh)","submitted_at":"2023-10-02T09:01:14Z","abstract_excerpt":"We study an extension of the Arrival problem, called Recursive Arrival, inspired by Recursive State Machines, which allows for a family of switching graphs that can call each other in a recursive way. We study the computational complexity of deciding whether a Recursive Arrival instance terminates at  a given target vertex.  We show this problem is contained in NP \\cap coNP, and we show that a search version of the problem lies in UEOPL, and hence in EOPL = PLS \\cap PPAD. Furthermore, we show P-hardness of the Recursive Arrival decision problem.  By contrast, the current best-known hardness re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01004","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.01004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:56:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9CluDOc/3Wdih2tx04uU9JE0A3Juy29b4uGIOMFS7xnSVSFWZRO675N6jyH8hW1z+xttARkY8rEAyuM6F+GCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T14:49:32.267157Z"},"content_sha256":"e30ccb034a724acb916e3214cb104c4c703b8e8c79862f75f87986de5287cee4","schema_version":"1.0","event_id":"sha256:e30ccb034a724acb916e3214cb104c4c703b8e8c79862f75f87986de5287cee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZFV44W3T3ODYT66ONKLTIAY3B/bundle.json","state_url":"https://pith.science/pith/NZFV44W3T3ODYT66ONKLTIAY3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZFV44W3T3ODYT66ONKLTIAY3B/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-08-21T14:49:32Z","links":{"resolver":"https://pith.science/pith/NZFV44W3T3ODYT66ONKLTIAY3B","bundle":"https://pith.science/pith/NZFV44W3T3ODYT66ONKLTIAY3B/bundle.json","state":"https://pith.science/pith/NZFV44W3T3ODYT66ONKLTIAY3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZFV44W3T3ODYT66ONKLTIAY3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NZFV44W3T3ODYT66ONKLTIAY3B","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":"e772dada000b91a305cbd2bab91fb2f572a76a39bb9efb7b849ae1795569050d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-10-02T09:01:14Z","title_canon_sha256":"cfdb21401e56ac498610f4e0ad7e52ccbb417bc903b9f6826f380d13195f9efa"},"schema_version":"1.0","source":{"id":"2310.01004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01004","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01004v1","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01004","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"pith_short_12","alias_value":"NZFV44W3T3OD","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"pith_short_16","alias_value":"NZFV44W3T3ODYT66","created_at":"2026-07-05T06:56:13Z"},{"alias_kind":"pith_short_8","alias_value":"NZFV44W3","created_at":"2026-07-05T06:56:13Z"}],"graph_snapshots":[{"event_id":"sha256:e30ccb034a724acb916e3214cb104c4c703b8e8c79862f75f87986de5287cee4","target":"graph","created_at":"2026-07-05T06:56:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.01004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study an extension of the Arrival problem, called Recursive Arrival, inspired by Recursive State Machines, which allows for a family of switching graphs that can call each other in a recursive way. We study the computational complexity of deciding whether a Recursive Arrival instance terminates at  a given target vertex.  We show this problem is contained in NP \\cap coNP, and we show that a search version of the problem lies in UEOPL, and hence in EOPL = PLS \\cap PPAD. Furthermore, we show P-hardness of the Recursive Arrival decision problem.  By contrast, the current best-known hardness re","authors_text":"Thomas Webster (University of Edinburgh)","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-10-02T09:01:14Z","title":"The Recursive Arrival Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01004","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:16737faa494e4696cdb0a617e672d36fa4ec7226f4998c900ab436d063f7206f","target":"record","created_at":"2026-07-05T06:56:13Z","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":"e772dada000b91a305cbd2bab91fb2f572a76a39bb9efb7b849ae1795569050d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-10-02T09:01:14Z","title_canon_sha256":"cfdb21401e56ac498610f4e0ad7e52ccbb417bc903b9f6826f380d13195f9efa"},"schema_version":"1.0","source":{"id":"2310.01004","kind":"arxiv","version":1}},"canonical_sha256":"6e4b5e72db9edc3c4fde7354b9a018d854ef9556eb099db4a78e52ce995f9765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e4b5e72db9edc3c4fde7354b9a018d854ef9556eb099db4a78e52ce995f9765","first_computed_at":"2026-07-05T06:56:13.182428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:56:13.182428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3rZe7qY2zjLR0x7bZEMR3mHVeknc6Jgwl+PvCyaOW4nI2dpGJtamZlAx9AGcUOqTAeEkz6Cyxfj3baJM7WleDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:56:13.182844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.01004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16737faa494e4696cdb0a617e672d36fa4ec7226f4998c900ab436d063f7206f","sha256:e30ccb034a724acb916e3214cb104c4c703b8e8c79862f75f87986de5287cee4"],"state_sha256":"39d34b91e1b6eedba418f90fa0be096c1ce45fdc5bde5f5e35a7f85c48701e97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"477uiDUlzZFySXXk+Jx4FqVsFSC0HLeQfPbdypDWhWT8rjhLbpWmHwYThWc8sV8FFoPFVYtN4CJ6Zn75z9NtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T14:49:32.271729Z","bundle_sha256":"e1372b02d70363558636d5a14b106be066af4d12fa77a131587e6f87c03724c6"}}