{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:F52U4HB2DVRE4WGHBPWJC7N7IF","short_pith_number":"pith:F52U4HB2","canonical_record":{"source":{"id":"1210.2620","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-09T14:51:25Z","cross_cats_sorted":[],"title_canon_sha256":"979e1c8fbed24f1402173a7b6de3660c359eb86ae3679c3c62528d7e1ad12708","abstract_canon_sha256":"d184b065522711f5a6df61d8afbee557fd3a37d897b9984a7b6e98d10e308b25"},"schema_version":"1.0"},"canonical_sha256":"2f754e1c3a1d624e58c70bec917dbf414f8d0c60b3cd779d7f7f1e52ad702045","source":{"kind":"arxiv","id":"1210.2620","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2620","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2620v3","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2620","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"pith_short_12","alias_value":"F52U4HB2DVRE","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F52U4HB2DVRE4WGH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F52U4HB2","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:F52U4HB2DVRE4WGHBPWJC7N7IF","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2620","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-09T14:51:25Z","cross_cats_sorted":[],"title_canon_sha256":"979e1c8fbed24f1402173a7b6de3660c359eb86ae3679c3c62528d7e1ad12708","abstract_canon_sha256":"d184b065522711f5a6df61d8afbee557fd3a37d897b9984a7b6e98d10e308b25"},"schema_version":"1.0"},"canonical_sha256":"2f754e1c3a1d624e58c70bec917dbf414f8d0c60b3cd779d7f7f1e52ad702045","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:38.429907Z","signature_b64":"jOp+5P8XNKZvX9M3FvKmGdQoqmpjw74kWfvOsP/GVV5fM5dLGaFta1KZyIc+Rj1jgzH9XMYnOPOEoBhfiK6OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f754e1c3a1d624e58c70bec917dbf414f8d0c60b3cd779d7f7f1e52ad702045","last_reissued_at":"2026-05-18T01:37:38.429215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:38.429215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2620","source_version":3,"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-18T01:37:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HazTQeM5cYtv+Ul/sfzEnaXB+sKOckdIRTWzvJKIlWgz0wA/EJcYA0OS8tydfR34kP10lxZ1oUdKcB5V6wdrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:58:19.364828Z"},"content_sha256":"ebc8bca3ef8dce2722fa4d5ec63afb717eb46bde8f81560f68ef0f4af6b62e8e","schema_version":"1.0","event_id":"sha256:ebc8bca3ef8dce2722fa4d5ec63afb717eb46bde8f81560f68ef0f4af6b62e8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:F52U4HB2DVRE4WGHBPWJC7N7IF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Am\\'elie Gheerbrant (School of Informatics, Balder ten Cate (Santa Cruz Department of Computer Science, University of California), University of Edinburgh)","submitted_at":"2012-10-09T14:51:25Z","abstract_excerpt":"We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present axiomatizations of the monadic second-order logic (MSO), monadic transitive closure logic (FO(TC1)) and monadic least fixed-point logic (FO(LFP1)) theories of this class of structures. These logics can express important properties such as reachability. Using model-theoretic techniques, we show by a uniform argument that these axiomatizations are complete, i.e., eac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2620","kind":"arxiv","version":3},"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-18T01:37:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4hKSKuNRSYfhQ8QJ3g2L58JdNaMuTtWNf2yu6Rv4OFfDN7ud6UECYPvy9zwsBT9IJWsLnPMnXbZsutXFTNmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:58:19.365209Z"},"content_sha256":"213e24d6e40d36e1d6cba94ec20f1cb90429a96e26a069a3e97fdfb1c2c12906","schema_version":"1.0","event_id":"sha256:213e24d6e40d36e1d6cba94ec20f1cb90429a96e26a069a3e97fdfb1c2c12906"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F52U4HB2DVRE4WGHBPWJC7N7IF/bundle.json","state_url":"https://pith.science/pith/F52U4HB2DVRE4WGHBPWJC7N7IF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F52U4HB2DVRE4WGHBPWJC7N7IF/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-06-11T04:58:19Z","links":{"resolver":"https://pith.science/pith/F52U4HB2DVRE4WGHBPWJC7N7IF","bundle":"https://pith.science/pith/F52U4HB2DVRE4WGHBPWJC7N7IF/bundle.json","state":"https://pith.science/pith/F52U4HB2DVRE4WGHBPWJC7N7IF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F52U4HB2DVRE4WGHBPWJC7N7IF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F52U4HB2DVRE4WGHBPWJC7N7IF","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":"d184b065522711f5a6df61d8afbee557fd3a37d897b9984a7b6e98d10e308b25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-09T14:51:25Z","title_canon_sha256":"979e1c8fbed24f1402173a7b6de3660c359eb86ae3679c3c62528d7e1ad12708"},"schema_version":"1.0","source":{"id":"1210.2620","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2620","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2620v3","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2620","created_at":"2026-05-18T01:37:38Z"},{"alias_kind":"pith_short_12","alias_value":"F52U4HB2DVRE","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F52U4HB2DVRE4WGH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F52U4HB2","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:213e24d6e40d36e1d6cba94ec20f1cb90429a96e26a069a3e97fdfb1c2c12906","target":"graph","created_at":"2026-05-18T01:37:38Z","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":"We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present axiomatizations of the monadic second-order logic (MSO), monadic transitive closure logic (FO(TC1)) and monadic least fixed-point logic (FO(LFP1)) theories of this class of structures. These logics can express important properties such as reachability. Using model-theoretic techniques, we show by a uniform argument that these axiomatizations are complete, i.e., eac","authors_text":"Am\\'elie Gheerbrant (School of Informatics, Balder ten Cate (Santa Cruz Department of Computer Science, University of California), University of Edinburgh)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-09T14:51:25Z","title":"Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2620","kind":"arxiv","version":3},"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:ebc8bca3ef8dce2722fa4d5ec63afb717eb46bde8f81560f68ef0f4af6b62e8e","target":"record","created_at":"2026-05-18T01:37:38Z","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":"d184b065522711f5a6df61d8afbee557fd3a37d897b9984a7b6e98d10e308b25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-10-09T14:51:25Z","title_canon_sha256":"979e1c8fbed24f1402173a7b6de3660c359eb86ae3679c3c62528d7e1ad12708"},"schema_version":"1.0","source":{"id":"1210.2620","kind":"arxiv","version":3}},"canonical_sha256":"2f754e1c3a1d624e58c70bec917dbf414f8d0c60b3cd779d7f7f1e52ad702045","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f754e1c3a1d624e58c70bec917dbf414f8d0c60b3cd779d7f7f1e52ad702045","first_computed_at":"2026-05-18T01:37:38.429215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:38.429215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jOp+5P8XNKZvX9M3FvKmGdQoqmpjw74kWfvOsP/GVV5fM5dLGaFta1KZyIc+Rj1jgzH9XMYnOPOEoBhfiK6OCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:38.429907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2620","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebc8bca3ef8dce2722fa4d5ec63afb717eb46bde8f81560f68ef0f4af6b62e8e","sha256:213e24d6e40d36e1d6cba94ec20f1cb90429a96e26a069a3e97fdfb1c2c12906"],"state_sha256":"41b0bfba02676565cf79bf88621a2dc742808eefa7403cb0e2e81df15cdbad75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzuT1cfrkTvUxjZYRsXGFSXH+tMgbw6ElQ/46w8m3/hb4jtWd94KET9llDqIxQi4lTWN/MT9FPmaa1Qm4s6KBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:58:19.368957Z","bundle_sha256":"65ef3a154d38cf103bb1b2a18d72534f7a8ae0e1c17f64dee881ba38d2f7342a"}}