{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:I4Y7XGXBS2XQ7BM3BXKUP6I7TD","short_pith_number":"pith:I4Y7XGXB","schema_version":"1.0","canonical_sha256":"4731fb9ae196af0f859b0dd547f91f98f66a03ff8d165475eceb027776297eef","source":{"kind":"arxiv","id":"1403.7916","version":3},"attestation_state":"computed","paper":{"title":"A Study on Ornated Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Sudev Naduvath, Vivian Mukungunugwa","submitted_at":"2014-03-31T09:02:56Z","abstract_excerpt":"In this paper, we introduce the notion of a finite non-simple directed graph, called an ornated graph and initiate a study on ornated graphs. An ornated graph is a directed graph on $n$ vertices, denoted by $O_n(s_l)$, whose vertices are consecutively labeled clockwise on the circumference of a circle and constructed from an ordered string $s_l$ joining them in such a way that for an odd indexed entry $a_t$ of the string, a tail $v_i$ has clockwise heads $v_j$ if and only if $(i+a_t) \\ge j$ and for an even indexed entry $a_s$ of the string a tail $v_i$ has anticlockwise heads $v_j$ if and only"},"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":"1403.7916","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-31T09:02:56Z","cross_cats_sorted":[],"title_canon_sha256":"571164f34ca582a3c51f57cf5e2d9c89e73491c563fb3778308b70d37083ff6d","abstract_canon_sha256":"00a1c492bd7780e6dfd331b01efb615bd1188a9b84e5b4b2a0a1c4c13f1e6096"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:59.086089Z","signature_b64":"KZFLJTeBddf4Dxq32Zj/t6fn/2cn6qzaDxr7qHleb2mx4Q2MEyU9zepZKmlo0f/3hS+357tjwwxhLQO8AXXoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4731fb9ae196af0f859b0dd547f91f98f66a03ff8d165475eceb027776297eef","last_reissued_at":"2026-05-18T02:00:59.085581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:59.085581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Study on Ornated Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johan Kok, Sudev Naduvath, Vivian Mukungunugwa","submitted_at":"2014-03-31T09:02:56Z","abstract_excerpt":"In this paper, we introduce the notion of a finite non-simple directed graph, called an ornated graph and initiate a study on ornated graphs. An ornated graph is a directed graph on $n$ vertices, denoted by $O_n(s_l)$, whose vertices are consecutively labeled clockwise on the circumference of a circle and constructed from an ordered string $s_l$ joining them in such a way that for an odd indexed entry $a_t$ of the string, a tail $v_i$ has clockwise heads $v_j$ if and only if $(i+a_t) \\ge j$ and for an even indexed entry $a_s$ of the string a tail $v_i$ has anticlockwise heads $v_j$ if and only"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7916","kind":"arxiv","version":3},"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":"1403.7916","created_at":"2026-05-18T02:00:59.085665+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7916v3","created_at":"2026-05-18T02:00:59.085665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7916","created_at":"2026-05-18T02:00:59.085665+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4Y7XGXBS2XQ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4Y7XGXBS2XQ7BM3","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4Y7XGXB","created_at":"2026-05-18T12:28:33.132498+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/I4Y7XGXBS2XQ7BM3BXKUP6I7TD","json":"https://pith.science/pith/I4Y7XGXBS2XQ7BM3BXKUP6I7TD.json","graph_json":"https://pith.science/api/pith-number/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/graph.json","events_json":"https://pith.science/api/pith-number/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/events.json","paper":"https://pith.science/paper/I4Y7XGXB"},"agent_actions":{"view_html":"https://pith.science/pith/I4Y7XGXBS2XQ7BM3BXKUP6I7TD","download_json":"https://pith.science/pith/I4Y7XGXBS2XQ7BM3BXKUP6I7TD.json","view_paper":"https://pith.science/paper/I4Y7XGXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7916&json=true","fetch_graph":"https://pith.science/api/pith-number/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/graph.json","fetch_events":"https://pith.science/api/pith-number/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/action/storage_attestation","attest_author":"https://pith.science/pith/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/action/author_attestation","sign_citation":"https://pith.science/pith/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/action/citation_signature","submit_replication":"https://pith.science/pith/I4Y7XGXBS2XQ7BM3BXKUP6I7TD/action/replication_record"}},"created_at":"2026-05-18T02:00:59.085665+00:00","updated_at":"2026-05-18T02:00:59.085665+00:00"}