{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7WZ22ETFWG3MHHMHULW5WKSY2W","short_pith_number":"pith:7WZ22ETF","canonical_record":{"source":{"id":"1806.07127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T09:41:57Z","cross_cats_sorted":[],"title_canon_sha256":"5c6fe1dee0e5d3be14a3ab093c32fd5605f6e8f160532e2c5ab8c5e180937c3e","abstract_canon_sha256":"53a432c121b2c32c0c91849ddf0a9277f57e19806d6358bbf28756006a69ae8a"},"schema_version":"1.0"},"canonical_sha256":"fdb3ad1265b1b6c39d87a2eddb2a58d5979f06df237148d8401a5dc45d0a8c3d","source":{"kind":"arxiv","id":"1806.07127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07127","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07127v1","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07127","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"7WZ22ETFWG3M","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7WZ22ETFWG3MHHMH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7WZ22ETF","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7WZ22ETFWG3MHHMHULW5WKSY2W","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T09:41:57Z","cross_cats_sorted":[],"title_canon_sha256":"5c6fe1dee0e5d3be14a3ab093c32fd5605f6e8f160532e2c5ab8c5e180937c3e","abstract_canon_sha256":"53a432c121b2c32c0c91849ddf0a9277f57e19806d6358bbf28756006a69ae8a"},"schema_version":"1.0"},"canonical_sha256":"fdb3ad1265b1b6c39d87a2eddb2a58d5979f06df237148d8401a5dc45d0a8c3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:51.787615Z","signature_b64":"BugUME5fejzRdvR0kqbOOurCgQSMyfrKambmxR9PUmTRzkyhK2ryKGA4z8qMki6xZIukBDow6bOOKo3v8R/6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdb3ad1265b1b6c39d87a2eddb2a58d5979f06df237148d8401a5dc45d0a8c3d","last_reissued_at":"2026-05-18T00:12:51.786865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:51.786865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07127","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-18T00:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vnliQtFt+Gq8KLw+xbxZPJYK7sNkPlJDEd8l2bpgioErcNqcZBMZxtqbk6Ek8qsCdkycks07BRJNsRvZDdvgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:14:26.181135Z"},"content_sha256":"80b934560c6f96c8014efb5600cfd4b5509baa58750dab4bc5b88b5261bb245e","schema_version":"1.0","event_id":"sha256:80b934560c6f96c8014efb5600cfd4b5509baa58750dab4bc5b88b5261bb245e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7WZ22ETFWG3MHHMHULW5WKSY2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Flavio Ferrarotti, Jos\\'e Mar\\'ia Turull-Torres, Klaus-Dieter Schewe, Sen\\'en Gonz\\'alez","submitted_at":"2018-06-19T09:41:57Z","abstract_excerpt":"Let $\\mathrm{SO}^{\\mathit{plog}}$ denote the restriction of second-order logic, where second-order quantification ranges over relations of size at most poly-logarithmic in the size of the structure. In this article we investigate the problem, which Turing machine complexity class is captured by Boolean queries over ordered relational structures that can be expressed in this logic. For this we define a hierarchy of fragments $\\Sigma^{\\mathit{plog}}_m$ (and $\\Pi^{\\mathit{plog}}_m$) defined by formulae with alternating blocks of existential and universal second-order quantifiers in quantifier-pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07127","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-18T00:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iC09FzCB0xXf9WNHEiUu1raDJDn4/SfZgLnP6CBxHXjMqmMlTM7Qw0bC/zWJuGjrGoxnN5oX048p3hBG0ONkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:14:26.181841Z"},"content_sha256":"5516cc11b957d2ae0a178a5021707a584d7eb8727a3c5e43e9bbf1e2169d8b51","schema_version":"1.0","event_id":"sha256:5516cc11b957d2ae0a178a5021707a584d7eb8727a3c5e43e9bbf1e2169d8b51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WZ22ETFWG3MHHMHULW5WKSY2W/bundle.json","state_url":"https://pith.science/pith/7WZ22ETFWG3MHHMHULW5WKSY2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WZ22ETFWG3MHHMHULW5WKSY2W/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-25T04:14:26Z","links":{"resolver":"https://pith.science/pith/7WZ22ETFWG3MHHMHULW5WKSY2W","bundle":"https://pith.science/pith/7WZ22ETFWG3MHHMHULW5WKSY2W/bundle.json","state":"https://pith.science/pith/7WZ22ETFWG3MHHMHULW5WKSY2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WZ22ETFWG3MHHMHULW5WKSY2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7WZ22ETFWG3MHHMHULW5WKSY2W","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":"53a432c121b2c32c0c91849ddf0a9277f57e19806d6358bbf28756006a69ae8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T09:41:57Z","title_canon_sha256":"5c6fe1dee0e5d3be14a3ab093c32fd5605f6e8f160532e2c5ab8c5e180937c3e"},"schema_version":"1.0","source":{"id":"1806.07127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07127","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07127v1","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07127","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"7WZ22ETFWG3M","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7WZ22ETFWG3MHHMH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7WZ22ETF","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:5516cc11b957d2ae0a178a5021707a584d7eb8727a3c5e43e9bbf1e2169d8b51","target":"graph","created_at":"2026-05-18T00:12:51Z","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":"Let $\\mathrm{SO}^{\\mathit{plog}}$ denote the restriction of second-order logic, where second-order quantification ranges over relations of size at most poly-logarithmic in the size of the structure. In this article we investigate the problem, which Turing machine complexity class is captured by Boolean queries over ordered relational structures that can be expressed in this logic. For this we define a hierarchy of fragments $\\Sigma^{\\mathit{plog}}_m$ (and $\\Pi^{\\mathit{plog}}_m$) defined by formulae with alternating blocks of existential and universal second-order quantifiers in quantifier-pre","authors_text":"Flavio Ferrarotti, Jos\\'e Mar\\'ia Turull-Torres, Klaus-Dieter Schewe, Sen\\'en Gonz\\'alez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T09:41:57Z","title":"The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07127","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:80b934560c6f96c8014efb5600cfd4b5509baa58750dab4bc5b88b5261bb245e","target":"record","created_at":"2026-05-18T00:12:51Z","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":"53a432c121b2c32c0c91849ddf0a9277f57e19806d6358bbf28756006a69ae8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-19T09:41:57Z","title_canon_sha256":"5c6fe1dee0e5d3be14a3ab093c32fd5605f6e8f160532e2c5ab8c5e180937c3e"},"schema_version":"1.0","source":{"id":"1806.07127","kind":"arxiv","version":1}},"canonical_sha256":"fdb3ad1265b1b6c39d87a2eddb2a58d5979f06df237148d8401a5dc45d0a8c3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdb3ad1265b1b6c39d87a2eddb2a58d5979f06df237148d8401a5dc45d0a8c3d","first_computed_at":"2026-05-18T00:12:51.786865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:51.786865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BugUME5fejzRdvR0kqbOOurCgQSMyfrKambmxR9PUmTRzkyhK2ryKGA4z8qMki6xZIukBDow6bOOKo3v8R/6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:51.787615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80b934560c6f96c8014efb5600cfd4b5509baa58750dab4bc5b88b5261bb245e","sha256:5516cc11b957d2ae0a178a5021707a584d7eb8727a3c5e43e9bbf1e2169d8b51"],"state_sha256":"dd63aafe1efef8f23118cfc21d9651edf55368deb52e82d3562bf22b0f5732c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGFqKR/c4zUy/AZbA/zWY242kGfvvaGcMj4qMoSNf9tUGlLUnEKy7jqc0cs8t96Gxx7F/W9diApI6CGOwT9UDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:14:26.185389Z","bundle_sha256":"f435c613b64a7a70b05cb68968535ebc2736947302e674c00a96a3fba858aa9b"}}