{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:VV5NQBJ4D5VN3UF3NHKU4QWW73","short_pith_number":"pith:VV5NQBJ4","schema_version":"1.0","canonical_sha256":"ad7ad8053c1f6addd0bb69d54e42d6fee637ab7e394dcbb680e06f16a662851d","source":{"kind":"arxiv","id":"0910.3085","version":2},"attestation_state":"computed","paper":{"title":"Guarded Second-Order Logic, Spanning Trees, and Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Achim Blumensath","submitted_at":"2009-10-16T11:32:13Z","abstract_excerpt":"According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the first part of the present paper we extend this result to hypergraphs of arbitrary cardinality. In the second part, we present a generalisation dealing with methods to encode sets of vertices by single vertices."},"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":"0910.3085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-10-16T11:32:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0129ab1c73991261715b1ca7b70c25e70b550494ae83f4f706d1162a1de5d6cb","abstract_canon_sha256":"b31af039575c6930a0471778d57ebb8a083e181c1f805801938f81f65b43ebfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.273388Z","signature_b64":"G6ArNbZOtQueB81Ik97gpF9sycXCRUKFvwfHswJ+fNJTedAXRtPUTcGLwJ14EWZ8joSiNmjQN2KoT1g6DqxDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad7ad8053c1f6addd0bb69d54e42d6fee637ab7e394dcbb680e06f16a662851d","last_reissued_at":"2026-05-18T01:37:40.272801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.272801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guarded Second-Order Logic, Spanning Trees, and Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Achim Blumensath","submitted_at":"2009-10-16T11:32:13Z","abstract_excerpt":"According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the first part of the present paper we extend this result to hypergraphs of arbitrary cardinality. In the second part, we present a generalisation dealing with methods to encode sets of vertices by single vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3085","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":"0910.3085","created_at":"2026-05-18T01:37:40.272903+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.3085v2","created_at":"2026-05-18T01:37:40.272903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3085","created_at":"2026-05-18T01:37:40.272903+00:00"},{"alias_kind":"pith_short_12","alias_value":"VV5NQBJ4D5VN","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"VV5NQBJ4D5VN3UF3","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"VV5NQBJ4","created_at":"2026-05-18T12:26:02.257875+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/VV5NQBJ4D5VN3UF3NHKU4QWW73","json":"https://pith.science/pith/VV5NQBJ4D5VN3UF3NHKU4QWW73.json","graph_json":"https://pith.science/api/pith-number/VV5NQBJ4D5VN3UF3NHKU4QWW73/graph.json","events_json":"https://pith.science/api/pith-number/VV5NQBJ4D5VN3UF3NHKU4QWW73/events.json","paper":"https://pith.science/paper/VV5NQBJ4"},"agent_actions":{"view_html":"https://pith.science/pith/VV5NQBJ4D5VN3UF3NHKU4QWW73","download_json":"https://pith.science/pith/VV5NQBJ4D5VN3UF3NHKU4QWW73.json","view_paper":"https://pith.science/paper/VV5NQBJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.3085&json=true","fetch_graph":"https://pith.science/api/pith-number/VV5NQBJ4D5VN3UF3NHKU4QWW73/graph.json","fetch_events":"https://pith.science/api/pith-number/VV5NQBJ4D5VN3UF3NHKU4QWW73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VV5NQBJ4D5VN3UF3NHKU4QWW73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VV5NQBJ4D5VN3UF3NHKU4QWW73/action/storage_attestation","attest_author":"https://pith.science/pith/VV5NQBJ4D5VN3UF3NHKU4QWW73/action/author_attestation","sign_citation":"https://pith.science/pith/VV5NQBJ4D5VN3UF3NHKU4QWW73/action/citation_signature","submit_replication":"https://pith.science/pith/VV5NQBJ4D5VN3UF3NHKU4QWW73/action/replication_record"}},"created_at":"2026-05-18T01:37:40.272903+00:00","updated_at":"2026-05-18T01:37:40.272903+00:00"}