{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GADGLDIRWPCSJVELV2GTI4CLBE","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":"4ca8043c7cc39a5fb9b6de6a893f3d28d1a7f739e12124b43c77c764be4d2b14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-06T17:33:39Z","title_canon_sha256":"9f6259df1486a70aad6adaf1a58bd819096b865b54c33b34cfb9c4e1686294e5"},"schema_version":"1.0","source":{"id":"2008.02781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02781","created_at":"2026-07-05T01:25:19Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02781v1","created_at":"2026-07-05T01:25:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02781","created_at":"2026-07-05T01:25:19Z"},{"alias_kind":"pith_short_12","alias_value":"GADGLDIRWPCS","created_at":"2026-07-05T01:25:19Z"},{"alias_kind":"pith_short_16","alias_value":"GADGLDIRWPCSJVEL","created_at":"2026-07-05T01:25:19Z"},{"alias_kind":"pith_short_8","alias_value":"GADGLDIR","created_at":"2026-07-05T01:25:19Z"}],"graph_snapshots":[{"event_id":"sha256:57a60c4a86d21955f40e54701c33b459c04b50f7832b7f934b9453cb8d46a7a7","target":"graph","created_at":"2026-07-05T01:25:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.02781/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a finite set $V$, a convexity $\\mathscr{C}$, is a collection of subsets of $V$ that contains both the empty set and the set $V$ and is closed under intersections. The elements of $\\mathscr{C}$ are called convex sets. The digital convexity, originally proposed as a tool for processing digital images, is defined as follows: a subset $S\\subseteq V(G)$ is digitally convex if, for every $v\\in V(G)$, we have $N[v]\\subseteq N[S]$ implies $v\\in S$. The number of cyclic binary strings with blocks of length at least $k$ is expressed as a linear recurrence relation for $k\\geq 2$. A bijection is est","authors_text":"Christina M. Mynhardt, MacKenzie Carr, Ortrud R. Oellermann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-06T17:33:39Z","title":"Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02781","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:77d6f14f6d3b4467118efaa92679b5515555b32536215090b961c8b0c6f7affb","target":"record","created_at":"2026-07-05T01:25:19Z","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":"4ca8043c7cc39a5fb9b6de6a893f3d28d1a7f739e12124b43c77c764be4d2b14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-06T17:33:39Z","title_canon_sha256":"9f6259df1486a70aad6adaf1a58bd819096b865b54c33b34cfb9c4e1686294e5"},"schema_version":"1.0","source":{"id":"2008.02781","kind":"arxiv","version":1}},"canonical_sha256":"3006658d11b3c524d48bae8d34704b091c627e01dfec0afa8f40c0bea0721de3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3006658d11b3c524d48bae8d34704b091c627e01dfec0afa8f40c0bea0721de3","first_computed_at":"2026-07-05T01:25:19.353213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:19.353213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2FYHh6JFmMQIc25qOJnLWYPSKnN4+PdHj+CFdAXbz0Qi+xvyKhYwRoo7XWk5FB0u/OBEsFvxZ78gZdR8T+APDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:19.353609Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.02781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77d6f14f6d3b4467118efaa92679b5515555b32536215090b961c8b0c6f7affb","sha256:57a60c4a86d21955f40e54701c33b459c04b50f7832b7f934b9453cb8d46a7a7"],"state_sha256":"c86a5e562ba5bc979908db9ffc3c3a76fc078286b0252ea13b68456b0134a513"}