{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GADGLDIRWPCSJVELV2GTI4CLBE","short_pith_number":"pith:GADGLDIR","schema_version":"1.0","canonical_sha256":"3006658d11b3c524d48bae8d34704b091c627e01dfec0afa8f40c0bea0721de3","source":{"kind":"arxiv","id":"2008.02781","version":1},"attestation_state":"computed","paper":{"title":"Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina M. Mynhardt, MacKenzie Carr, Ortrud R. Oellermann","submitted_at":"2020-08-06T17:33:39Z","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"},"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":"2008.02781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-06T17:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"9f6259df1486a70aad6adaf1a58bd819096b865b54c33b34cfb9c4e1686294e5","abstract_canon_sha256":"4ca8043c7cc39a5fb9b6de6a893f3d28d1a7f739e12124b43c77c764be4d2b14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:19.353609Z","signature_b64":"2FYHh6JFmMQIc25qOJnLWYPSKnN4+PdHj+CFdAXbz0Qi+xvyKhYwRoo7XWk5FB0u/OBEsFvxZ78gZdR8T+APDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3006658d11b3c524d48bae8d34704b091c627e01dfec0afa8f40c0bea0721de3","last_reissued_at":"2026-07-05T01:25:19.353213Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:19.353213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina M. Mynhardt, MacKenzie Carr, Ortrud R. Oellermann","submitted_at":"2020-08-06T17:33:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02781","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.02781/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.02781","created_at":"2026-07-05T01:25:19.353267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.02781v1","created_at":"2026-07-05T01:25:19.353267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02781","created_at":"2026-07-05T01:25:19.353267+00:00"},{"alias_kind":"pith_short_12","alias_value":"GADGLDIRWPCS","created_at":"2026-07-05T01:25:19.353267+00:00"},{"alias_kind":"pith_short_16","alias_value":"GADGLDIRWPCSJVEL","created_at":"2026-07-05T01:25:19.353267+00:00"},{"alias_kind":"pith_short_8","alias_value":"GADGLDIR","created_at":"2026-07-05T01:25:19.353267+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/GADGLDIRWPCSJVELV2GTI4CLBE","json":"https://pith.science/pith/GADGLDIRWPCSJVELV2GTI4CLBE.json","graph_json":"https://pith.science/api/pith-number/GADGLDIRWPCSJVELV2GTI4CLBE/graph.json","events_json":"https://pith.science/api/pith-number/GADGLDIRWPCSJVELV2GTI4CLBE/events.json","paper":"https://pith.science/paper/GADGLDIR"},"agent_actions":{"view_html":"https://pith.science/pith/GADGLDIRWPCSJVELV2GTI4CLBE","download_json":"https://pith.science/pith/GADGLDIRWPCSJVELV2GTI4CLBE.json","view_paper":"https://pith.science/paper/GADGLDIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.02781&json=true","fetch_graph":"https://pith.science/api/pith-number/GADGLDIRWPCSJVELV2GTI4CLBE/graph.json","fetch_events":"https://pith.science/api/pith-number/GADGLDIRWPCSJVELV2GTI4CLBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GADGLDIRWPCSJVELV2GTI4CLBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GADGLDIRWPCSJVELV2GTI4CLBE/action/storage_attestation","attest_author":"https://pith.science/pith/GADGLDIRWPCSJVELV2GTI4CLBE/action/author_attestation","sign_citation":"https://pith.science/pith/GADGLDIRWPCSJVELV2GTI4CLBE/action/citation_signature","submit_replication":"https://pith.science/pith/GADGLDIRWPCSJVELV2GTI4CLBE/action/replication_record"}},"created_at":"2026-07-05T01:25:19.353267+00:00","updated_at":"2026-07-05T01:25:19.353267+00:00"}