{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4F4EZ5MOX7U7MDHL7JA3LW3BQY","short_pith_number":"pith:4F4EZ5MO","schema_version":"1.0","canonical_sha256":"e1784cf58ebfe9f60cebfa41b5db61863b89c52587a983b38c1bf55cd8804c39","source":{"kind":"arxiv","id":"1703.02654","version":1},"attestation_state":"computed","paper":{"title":"The strong convexity spectra of grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-Cruz, Gabriela Araujo-Pardo, Juan Jos\\'e Montellano-Ballesteros","submitted_at":"2017-03-08T00:59:01Z","abstract_excerpt":"Let $D$ be a connected oriented graph. A set $S \\subseteq V(D)$ is convex in $D$ if, for every pair of vertices $x, y \\in S$, the vertex set of every $xy$-geodesic, ($xy$ shortest directed path) and every $yx$-geodesic in $D$ is contained in $S$. The convexity number, ${\\rm con}(D)$, of a non-trivial oriented graph, $D$, is the maximum cardinality of a proper convex set of $D$. The strong convexity spectrum of the graph $G$, $S_{SC} (G)$, is the set $\\{{ \\rm con}(D) \\colon\\ D {\\rm \\ is \\ a \\ strong \\ orientation \\ of \\ } G \\}$. In this paper we prove that the problem of determining the convexi"},"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":"1703.02654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T00:59:01Z","cross_cats_sorted":[],"title_canon_sha256":"84d468650f9315f9458c791b1e4427b99e96c658ce4cc611703f78752b010484","abstract_canon_sha256":"068a1d8b18645e6415996275e28cf222dd7231ba5549adb2dc62febe342bc1d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:05.936258Z","signature_b64":"9qIDWApnpW+0i24gKCQ0Yw9P1HeGXV9SBZR2B9RP+81pmZoMcCXjzmi3PYCRQuPQUH8OoMgzHkfcZd5pHmTdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1784cf58ebfe9f60cebfa41b5db61863b89c52587a983b38c1bf55cd8804c39","last_reissued_at":"2026-05-18T00:49:05.935737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:05.935737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The strong convexity spectra of grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-Cruz, Gabriela Araujo-Pardo, Juan Jos\\'e Montellano-Ballesteros","submitted_at":"2017-03-08T00:59:01Z","abstract_excerpt":"Let $D$ be a connected oriented graph. A set $S \\subseteq V(D)$ is convex in $D$ if, for every pair of vertices $x, y \\in S$, the vertex set of every $xy$-geodesic, ($xy$ shortest directed path) and every $yx$-geodesic in $D$ is contained in $S$. The convexity number, ${\\rm con}(D)$, of a non-trivial oriented graph, $D$, is the maximum cardinality of a proper convex set of $D$. The strong convexity spectrum of the graph $G$, $S_{SC} (G)$, is the set $\\{{ \\rm con}(D) \\colon\\ D {\\rm \\ is \\ a \\ strong \\ orientation \\ of \\ } G \\}$. In this paper we prove that the problem of determining the convexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02654","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":""},"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":"1703.02654","created_at":"2026-05-18T00:49:05.935815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02654v1","created_at":"2026-05-18T00:49:05.935815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02654","created_at":"2026-05-18T00:49:05.935815+00:00"},{"alias_kind":"pith_short_12","alias_value":"4F4EZ5MOX7U7","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4F4EZ5MOX7U7MDHL","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4F4EZ5MO","created_at":"2026-05-18T12:30:58.224056+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/4F4EZ5MOX7U7MDHL7JA3LW3BQY","json":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY.json","graph_json":"https://pith.science/api/pith-number/4F4EZ5MOX7U7MDHL7JA3LW3BQY/graph.json","events_json":"https://pith.science/api/pith-number/4F4EZ5MOX7U7MDHL7JA3LW3BQY/events.json","paper":"https://pith.science/paper/4F4EZ5MO"},"agent_actions":{"view_html":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY","download_json":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY.json","view_paper":"https://pith.science/paper/4F4EZ5MO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02654&json=true","fetch_graph":"https://pith.science/api/pith-number/4F4EZ5MOX7U7MDHL7JA3LW3BQY/graph.json","fetch_events":"https://pith.science/api/pith-number/4F4EZ5MOX7U7MDHL7JA3LW3BQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/action/storage_attestation","attest_author":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/action/author_attestation","sign_citation":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/action/citation_signature","submit_replication":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/action/replication_record"}},"created_at":"2026-05-18T00:49:05.935815+00:00","updated_at":"2026-05-18T00:49:05.935815+00:00"}