{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PNW3TJOYZ5TOTLXXSLLG2M4GCN","short_pith_number":"pith:PNW3TJOY","canonical_record":{"source":{"id":"1411.7192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"32e36f21be633617371314306cbbf86f775a4f52234590f99b6e46fb24fd3622","abstract_canon_sha256":"5fc9a652387d89e0898fd2b73a3a6c4c04b3afe2488da50dd6a7b3f2cc37bb18"},"schema_version":"1.0"},"canonical_sha256":"7b6db9a5d8cf66e9aef792d66d33861348ce74d42f221c9b10edbf97f4cb1d08","source":{"kind":"arxiv","id":"1411.7192","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7192","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7192v1","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7192","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"PNW3TJOYZ5TO","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PNW3TJOYZ5TOTLXX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PNW3TJOY","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PNW3TJOYZ5TOTLXXSLLG2M4GCN","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"32e36f21be633617371314306cbbf86f775a4f52234590f99b6e46fb24fd3622","abstract_canon_sha256":"5fc9a652387d89e0898fd2b73a3a6c4c04b3afe2488da50dd6a7b3f2cc37bb18"},"schema_version":"1.0"},"canonical_sha256":"7b6db9a5d8cf66e9aef792d66d33861348ce74d42f221c9b10edbf97f4cb1d08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:45.104431Z","signature_b64":"Pf9M76/3iFcchTgAiLLx36CizOR3gXUDRa5aiRVSSMF06xj/vnL7o3oYtAThyAcLXdB3k1fHTJt70AKJioA8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b6db9a5d8cf66e9aef792d66d33861348ce74d42f221c9b10edbf97f4cb1d08","last_reissued_at":"2026-05-18T02:32:45.103833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:45.103833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7192","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-18T02:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aEsEBqUIt/H5rS3vpdqgB2YEdDb5UlAC17d9rwjYwtcPUUd/0dHRc6Koh445xpSrno0TyCzmmRkJPIJQ68qIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:32:22.136381Z"},"content_sha256":"924c8b198c78767d05fe0a79ec085cf19a60f630f76256449e8f53c31aec2c9e","schema_version":"1.0","event_id":"sha256:924c8b198c78767d05fe0a79ec085cf19a60f630f76256449e8f53c31aec2c9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PNW3TJOYZ5TOTLXXSLLG2M4GCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Outerplanar and planar oriented cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ayan Nandy, Eric Sopena, Sagnik Sen","submitted_at":"2014-11-26T11:43:57Z","abstract_excerpt":"The clique number of an undirected graph $G$ is the maximum order of a complete subgraph of $G$ and is a well-known lower bound for the chromatic number of $G$. Every proper $k$-coloring of $G$ may be viewed as a homomorphism (an edge-preserving vertex mapping) of $G$ to the complete graph of order $k$. By considering homomorphisms of oriented graphs (digraphs without cycles of length at most 2), we get a natural notion of (oriented) colorings and oriented chromatic number of oriented graphs. An oriented clique is then an oriented graph whose number of vertices and oriented chromatic number co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7192","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-18T02:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAAGRFKnawLQioL0DA5l5bRiUd+1ZmcBhw1/x+D2Ojav2aJSK7w5l922iGvZsmBYXVtM+c+t/NheBCT4of5zBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:32:22.136732Z"},"content_sha256":"6f8620622f351174b81c1bc1fe114aff8491f093dc9fb88adcdf535bd90ec982","schema_version":"1.0","event_id":"sha256:6f8620622f351174b81c1bc1fe114aff8491f093dc9fb88adcdf535bd90ec982"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNW3TJOYZ5TOTLXXSLLG2M4GCN/bundle.json","state_url":"https://pith.science/pith/PNW3TJOYZ5TOTLXXSLLG2M4GCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNW3TJOYZ5TOTLXXSLLG2M4GCN/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-03T07:32:22Z","links":{"resolver":"https://pith.science/pith/PNW3TJOYZ5TOTLXXSLLG2M4GCN","bundle":"https://pith.science/pith/PNW3TJOYZ5TOTLXXSLLG2M4GCN/bundle.json","state":"https://pith.science/pith/PNW3TJOYZ5TOTLXXSLLG2M4GCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNW3TJOYZ5TOTLXXSLLG2M4GCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PNW3TJOYZ5TOTLXXSLLG2M4GCN","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":"5fc9a652387d89e0898fd2b73a3a6c4c04b3afe2488da50dd6a7b3f2cc37bb18","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:57Z","title_canon_sha256":"32e36f21be633617371314306cbbf86f775a4f52234590f99b6e46fb24fd3622"},"schema_version":"1.0","source":{"id":"1411.7192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7192","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7192v1","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7192","created_at":"2026-05-18T02:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"PNW3TJOYZ5TO","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PNW3TJOYZ5TOTLXX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PNW3TJOY","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:6f8620622f351174b81c1bc1fe114aff8491f093dc9fb88adcdf535bd90ec982","target":"graph","created_at":"2026-05-18T02:32:45Z","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":"The clique number of an undirected graph $G$ is the maximum order of a complete subgraph of $G$ and is a well-known lower bound for the chromatic number of $G$. Every proper $k$-coloring of $G$ may be viewed as a homomorphism (an edge-preserving vertex mapping) of $G$ to the complete graph of order $k$. By considering homomorphisms of oriented graphs (digraphs without cycles of length at most 2), we get a natural notion of (oriented) colorings and oriented chromatic number of oriented graphs. An oriented clique is then an oriented graph whose number of vertices and oriented chromatic number co","authors_text":"Ayan Nandy, Eric Sopena, Sagnik Sen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:57Z","title":"Outerplanar and planar oriented cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7192","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:924c8b198c78767d05fe0a79ec085cf19a60f630f76256449e8f53c31aec2c9e","target":"record","created_at":"2026-05-18T02:32:45Z","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":"5fc9a652387d89e0898fd2b73a3a6c4c04b3afe2488da50dd6a7b3f2cc37bb18","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:57Z","title_canon_sha256":"32e36f21be633617371314306cbbf86f775a4f52234590f99b6e46fb24fd3622"},"schema_version":"1.0","source":{"id":"1411.7192","kind":"arxiv","version":1}},"canonical_sha256":"7b6db9a5d8cf66e9aef792d66d33861348ce74d42f221c9b10edbf97f4cb1d08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b6db9a5d8cf66e9aef792d66d33861348ce74d42f221c9b10edbf97f4cb1d08","first_computed_at":"2026-05-18T02:32:45.103833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:45.103833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pf9M76/3iFcchTgAiLLx36CizOR3gXUDRa5aiRVSSMF06xj/vnL7o3oYtAThyAcLXdB3k1fHTJt70AKJioA8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:45.104431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:924c8b198c78767d05fe0a79ec085cf19a60f630f76256449e8f53c31aec2c9e","sha256:6f8620622f351174b81c1bc1fe114aff8491f093dc9fb88adcdf535bd90ec982"],"state_sha256":"24fdf09221f97ac78d12a7caaeafbc51113512ec9c59a1f01bc71a0f8cd0a599"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SaBNvL1u5HsrrMHW/lmSw1XLMPxbkBL+JoUXk+Ire+9fXksUKYjByNJTdBt1JDYTIoySNeFDRyO0tRvNV8QtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:32:22.138672Z","bundle_sha256":"dc558ba2303a7c1c42dcbdb171482cf263052399f4645f59243fd95d361bea07"}}