{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4SAX2HQDNOSVXBZYR6WW6SUJ6B","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":"c9394323d8ff79cefe1b491abc715d2faff09ad8663e30fc5f556ef29882156e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-11T10:51:33Z","title_canon_sha256":"25464b6ee8152700029c4d671ea75d32ef9d2a7bb0a2bfe7c5f917eafb965e83"},"schema_version":"1.0","source":{"id":"1802.03719","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03719","created_at":"2026-05-18T00:07:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03719v2","created_at":"2026-05-18T00:07:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03719","created_at":"2026-05-18T00:07:10Z"},{"alias_kind":"pith_short_12","alias_value":"4SAX2HQDNOSV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4SAX2HQDNOSVXBZY","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4SAX2HQD","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:06d8110de08c210a3188af53cca5b9af3ef835d3e19ddd4ae1ce1c053f906d0c","target":"graph","created_at":"2026-05-18T00:07:10Z","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 $\\Delta =\\{ \\delta_1,\\delta_2,...,\\delta_m \\} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{\\Delta }(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks subgraph copies of $\\delta_i$ with the variable $u_i$. We prove that this is always algebraic, through an explicit combinatorial decomposition depending on $\\Delta $. The decomposition also gives a defining system for $D_{\\Delta }(z,\\mathbf{0})$, which encodes polygon dissections that restrict these patterns as subgraphs. In this way, we are able to extract","authors_text":"Vasiliki Velona","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-11T10:51:33Z","title":"Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03719","kind":"arxiv","version":2},"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:f29ae85946a2f6426fdad7a1d8e4cbde0c83b90cb881d36ece719795bed20aa7","target":"record","created_at":"2026-05-18T00:07:10Z","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":"c9394323d8ff79cefe1b491abc715d2faff09ad8663e30fc5f556ef29882156e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-11T10:51:33Z","title_canon_sha256":"25464b6ee8152700029c4d671ea75d32ef9d2a7bb0a2bfe7c5f917eafb965e83"},"schema_version":"1.0","source":{"id":"1802.03719","kind":"arxiv","version":2}},"canonical_sha256":"e4817d1e036ba55b87388fad6f4a89f04ec101820770d60fac89959bf227756d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4817d1e036ba55b87388fad6f4a89f04ec101820770d60fac89959bf227756d","first_computed_at":"2026-05-18T00:07:10.751150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:10.751150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QHG+9gOE2HFHrUKWPzqGMiyel+zi9ktpF9LoypEzmzdT+lVmG2Zi9/ZgzuvFC/F22ursc41rbgb+VCnBiEQ+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:10.751711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03719","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f29ae85946a2f6426fdad7a1d8e4cbde0c83b90cb881d36ece719795bed20aa7","sha256:06d8110de08c210a3188af53cca5b9af3ef835d3e19ddd4ae1ce1c053f906d0c"],"state_sha256":"549fdee01730f22108c42fd3f043ebf37b377786246c81712531a181065c88ce"}