{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4F4EZ5MOX7U7MDHL7JA3LW3BQY","short_pith_number":"pith:4F4EZ5MO","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"},"canonical_sha256":"e1784cf58ebfe9f60cebfa41b5db61863b89c52587a983b38c1bf55cd8804c39","source":{"kind":"arxiv","id":"1703.02654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02654","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02654v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02654","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"4F4EZ5MOX7U7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4F4EZ5MOX7U7MDHL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4F4EZ5MO","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4F4EZ5MOX7U7MDHL7JA3LW3BQY","target":"record","payload":{"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"},"canonical_sha256":"e1784cf58ebfe9f60cebfa41b5db61863b89c52587a983b38c1bf55cd8804c39","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"},"source_kind":"arxiv","source_id":"1703.02654","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LB39mJWtbYsRafJ+6rP9PhP+tKcuS6mWhbpPIn4waBOgw2P0puEzjS/jH3jzVvPHGwSIA4nBSRgbrleLeWEjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:18:17.196047Z"},"content_sha256":"1a2c14aacd6fb0e3602c4dc5dda0bfcfb171531fd6445154dd54750420ad9a82","schema_version":"1.0","event_id":"sha256:1a2c14aacd6fb0e3602c4dc5dda0bfcfb171531fd6445154dd54750420ad9a82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4F4EZ5MOX7U7MDHL7JA3LW3BQY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"st15XI4VDbtv0WPTelh9gn9ysYZuEpV23k6vjWF+JfUmn8o1FNCUCjkaPgMY8dCv9SdrvBou0zICkqYlqy5EDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:18:17.196689Z"},"content_sha256":"1aa74b792614b3b923dbc17c3460ed11d1024804ba679192127337112fb28df3","schema_version":"1.0","event_id":"sha256:1aa74b792614b3b923dbc17c3460ed11d1024804ba679192127337112fb28df3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/bundle.json","state_url":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T08:18:17Z","links":{"resolver":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY","bundle":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/bundle.json","state":"https://pith.science/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4F4EZ5MOX7U7MDHL7JA3LW3BQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4F4EZ5MOX7U7MDHL7JA3LW3BQY","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":"068a1d8b18645e6415996275e28cf222dd7231ba5549adb2dc62febe342bc1d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T00:59:01Z","title_canon_sha256":"84d468650f9315f9458c791b1e4427b99e96c658ce4cc611703f78752b010484"},"schema_version":"1.0","source":{"id":"1703.02654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02654","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02654v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02654","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"4F4EZ5MOX7U7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4F4EZ5MOX7U7MDHL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4F4EZ5MO","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:1aa74b792614b3b923dbc17c3460ed11d1024804ba679192127337112fb28df3","target":"graph","created_at":"2026-05-18T00:49:05Z","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 $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","authors_text":"C\\'esar Hern\\'andez-Cruz, Gabriela Araujo-Pardo, Juan Jos\\'e Montellano-Ballesteros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T00:59:01Z","title":"The strong convexity spectra of grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02654","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:1a2c14aacd6fb0e3602c4dc5dda0bfcfb171531fd6445154dd54750420ad9a82","target":"record","created_at":"2026-05-18T00:49:05Z","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":"068a1d8b18645e6415996275e28cf222dd7231ba5549adb2dc62febe342bc1d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T00:59:01Z","title_canon_sha256":"84d468650f9315f9458c791b1e4427b99e96c658ce4cc611703f78752b010484"},"schema_version":"1.0","source":{"id":"1703.02654","kind":"arxiv","version":1}},"canonical_sha256":"e1784cf58ebfe9f60cebfa41b5db61863b89c52587a983b38c1bf55cd8804c39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1784cf58ebfe9f60cebfa41b5db61863b89c52587a983b38c1bf55cd8804c39","first_computed_at":"2026-05-18T00:49:05.935737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:05.935737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9qIDWApnpW+0i24gKCQ0Yw9P1HeGXV9SBZR2B9RP+81pmZoMcCXjzmi3PYCRQuPQUH8OoMgzHkfcZd5pHmTdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:05.936258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a2c14aacd6fb0e3602c4dc5dda0bfcfb171531fd6445154dd54750420ad9a82","sha256:1aa74b792614b3b923dbc17c3460ed11d1024804ba679192127337112fb28df3"],"state_sha256":"318a7c68ad4eaa9b860e93ecc6d87bc84c876e32b445f11ecbed5113d89a6e8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IxowJqkVEd5GvsFB/oWy/fm4jbOxAEfbZFNLoD220T89nGIEl8nIymyz9PUhac0a03s3ZmY42pL5q7DkM51Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:18:17.200695Z","bundle_sha256":"ecb6ba8b13bc8a5105e6cfc6871c90a03e1d1d994747e566b7e42f58eff8f558"}}