{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PW7IV2VS4IA2AZXXARTLF5JM47","short_pith_number":"pith:PW7IV2VS","schema_version":"1.0","canonical_sha256":"7dbe8aeab2e201a066f70466b2f52ce7fc52d7a2ad4a6ed028ef679a0cb67834","source":{"kind":"arxiv","id":"1208.5129","version":2},"attestation_state":"computed","paper":{"title":"Piecewise testable tree languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Howard Straubing (Boston College), Luc Segoufin (INRIA), Miko{\\l}aj Boja\\'nczyk (University of Warsaw)","submitted_at":"2012-08-25T12:09:02Z","abstract_excerpt":"This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Sigma_1 sentences if and only if its syntactic monoid is J-trivial."},"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":"1208.5129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-08-25T12:09:02Z","cross_cats_sorted":[],"title_canon_sha256":"9783c3a286d603d63c785219b4f7b9e068a7eae3328bb972c8328275d1ed184a","abstract_canon_sha256":"245cb12b34d58ac1fabe9297256180d4a3427145a8f718b759d83eb0c07c7d51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:38.583702Z","signature_b64":"3/Mv+3OZucN/wo+iiHfb8tWqfl5oCYLL2ixUP3DPr9f2diUPfxKh5DpydoNgFvlkoU0B0xLLH9fhprsId8IzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dbe8aeab2e201a066f70466b2f52ce7fc52d7a2ad4a6ed028ef679a0cb67834","last_reissued_at":"2026-05-18T01:37:38.583094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:38.583094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Piecewise testable tree languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Howard Straubing (Boston College), Luc Segoufin (INRIA), Miko{\\l}aj Boja\\'nczyk (University of Warsaw)","submitted_at":"2012-08-25T12:09:02Z","abstract_excerpt":"This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Sigma_1 sentences if and only if its syntactic monoid is J-trivial."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5129","kind":"arxiv","version":2},"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":"1208.5129","created_at":"2026-05-18T01:37:38.583175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5129v2","created_at":"2026-05-18T01:37:38.583175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5129","created_at":"2026-05-18T01:37:38.583175+00:00"},{"alias_kind":"pith_short_12","alias_value":"PW7IV2VS4IA2","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PW7IV2VS4IA2AZXX","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PW7IV2VS","created_at":"2026-05-18T12:27:18.751474+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/PW7IV2VS4IA2AZXXARTLF5JM47","json":"https://pith.science/pith/PW7IV2VS4IA2AZXXARTLF5JM47.json","graph_json":"https://pith.science/api/pith-number/PW7IV2VS4IA2AZXXARTLF5JM47/graph.json","events_json":"https://pith.science/api/pith-number/PW7IV2VS4IA2AZXXARTLF5JM47/events.json","paper":"https://pith.science/paper/PW7IV2VS"},"agent_actions":{"view_html":"https://pith.science/pith/PW7IV2VS4IA2AZXXARTLF5JM47","download_json":"https://pith.science/pith/PW7IV2VS4IA2AZXXARTLF5JM47.json","view_paper":"https://pith.science/paper/PW7IV2VS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5129&json=true","fetch_graph":"https://pith.science/api/pith-number/PW7IV2VS4IA2AZXXARTLF5JM47/graph.json","fetch_events":"https://pith.science/api/pith-number/PW7IV2VS4IA2AZXXARTLF5JM47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PW7IV2VS4IA2AZXXARTLF5JM47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PW7IV2VS4IA2AZXXARTLF5JM47/action/storage_attestation","attest_author":"https://pith.science/pith/PW7IV2VS4IA2AZXXARTLF5JM47/action/author_attestation","sign_citation":"https://pith.science/pith/PW7IV2VS4IA2AZXXARTLF5JM47/action/citation_signature","submit_replication":"https://pith.science/pith/PW7IV2VS4IA2AZXXARTLF5JM47/action/replication_record"}},"created_at":"2026-05-18T01:37:38.583175+00:00","updated_at":"2026-05-18T01:37:38.583175+00:00"}