{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P2ATWY7VQZIZCYEN4JSEMV4KNS","short_pith_number":"pith:P2ATWY7V","canonical_record":{"source":{"id":"1810.05590","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T16:05:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d9a5ae85da5d3729c4032ddd244afd14790eed6081f75e879d43e4f59d68052e","abstract_canon_sha256":"dcf6e30a73833ee9ec1081a4a17aecda81c8beaf3a3b175d2cfd1e6c5a614e7d"},"schema_version":"1.0"},"canonical_sha256":"7e813b63f5865191608de26446578a6cb365eb8ef2a235abe511cf5d179eae36","source":{"kind":"arxiv","id":"1810.05590","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05590","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05590v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05590","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"P2ATWY7VQZIZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2ATWY7VQZIZCYEN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2ATWY7V","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P2ATWY7VQZIZCYEN4JSEMV4KNS","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05590","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T16:05:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d9a5ae85da5d3729c4032ddd244afd14790eed6081f75e879d43e4f59d68052e","abstract_canon_sha256":"dcf6e30a73833ee9ec1081a4a17aecda81c8beaf3a3b175d2cfd1e6c5a614e7d"},"schema_version":"1.0"},"canonical_sha256":"7e813b63f5865191608de26446578a6cb365eb8ef2a235abe511cf5d179eae36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:46.513450Z","signature_b64":"TdtiujfaJDb4hs5MeJOrwsiksU+PY+KXW4jOOL8KoRuIVphhVmSLPDl9x/H18JRZfBCC8OROFV4ikotR4rG/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e813b63f5865191608de26446578a6cb365eb8ef2a235abe511cf5d179eae36","last_reissued_at":"2026-05-17T23:57:46.512867Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:46.512867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05590","source_version":2,"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-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOJifANnbEzB2XOKWBiA5L2MrxEVEXlfBTnMa9WzXnM+gvIFcVm/q2c69jWFuNRqIjQJierSRoA3OM1/XadBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:49:43.694238Z"},"content_sha256":"b21cd2d7422a3656e62587707de0e256285c52836a66baa4ff5ad7d6378d8401","schema_version":"1.0","event_id":"sha256:b21cd2d7422a3656e62587707de0e256285c52836a66baa4ff5ad7d6378d8401"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P2ATWY7VQZIZCYEN4JSEMV4KNS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chromatic Polynomials of Oriented Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christopher Duffy, Danielle Cox","submitted_at":"2018-10-12T16:05:56Z","abstract_excerpt":"The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying simple graph, closing an open problem posed by Sopena. We find that such oriented graphs can be both identified and constructed in polynomial time as they are exactly the family of quasi-transitive oriented co-interval graphs. We study the analytic properties of this polynomial and show that there exist oriented graphs which have chromatic polynomials have r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05590","kind":"arxiv","version":2},"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-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqPrbRITuULzqvekM2HBifq3GbH/9HBucymU8Eh2m9k/YqlvInm1xOsghpN4UiYBIAeGU6tDergIUMU9pLsfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:49:43.694603Z"},"content_sha256":"ccbbed82e6254ef1b5990079a765f0b7a5d00b1e3f2bb746772da92093903272","schema_version":"1.0","event_id":"sha256:ccbbed82e6254ef1b5990079a765f0b7a5d00b1e3f2bb746772da92093903272"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2ATWY7VQZIZCYEN4JSEMV4KNS/bundle.json","state_url":"https://pith.science/pith/P2ATWY7VQZIZCYEN4JSEMV4KNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2ATWY7VQZIZCYEN4JSEMV4KNS/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-24T01:49:43Z","links":{"resolver":"https://pith.science/pith/P2ATWY7VQZIZCYEN4JSEMV4KNS","bundle":"https://pith.science/pith/P2ATWY7VQZIZCYEN4JSEMV4KNS/bundle.json","state":"https://pith.science/pith/P2ATWY7VQZIZCYEN4JSEMV4KNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2ATWY7VQZIZCYEN4JSEMV4KNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P2ATWY7VQZIZCYEN4JSEMV4KNS","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":"dcf6e30a73833ee9ec1081a4a17aecda81c8beaf3a3b175d2cfd1e6c5a614e7d","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T16:05:56Z","title_canon_sha256":"d9a5ae85da5d3729c4032ddd244afd14790eed6081f75e879d43e4f59d68052e"},"schema_version":"1.0","source":{"id":"1810.05590","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05590","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05590v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05590","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"P2ATWY7VQZIZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P2ATWY7VQZIZCYEN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P2ATWY7V","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:ccbbed82e6254ef1b5990079a765f0b7a5d00b1e3f2bb746772da92093903272","target":"graph","created_at":"2026-05-17T23:57:46Z","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 oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying simple graph, closing an open problem posed by Sopena. We find that such oriented graphs can be both identified and constructed in polynomial time as they are exactly the family of quasi-transitive oriented co-interval graphs. We study the analytic properties of this polynomial and show that there exist oriented graphs which have chromatic polynomials have r","authors_text":"Christopher Duffy, Danielle Cox","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T16:05:56Z","title":"Chromatic Polynomials of Oriented Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05590","kind":"arxiv","version":2},"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:b21cd2d7422a3656e62587707de0e256285c52836a66baa4ff5ad7d6378d8401","target":"record","created_at":"2026-05-17T23:57:46Z","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":"dcf6e30a73833ee9ec1081a4a17aecda81c8beaf3a3b175d2cfd1e6c5a614e7d","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T16:05:56Z","title_canon_sha256":"d9a5ae85da5d3729c4032ddd244afd14790eed6081f75e879d43e4f59d68052e"},"schema_version":"1.0","source":{"id":"1810.05590","kind":"arxiv","version":2}},"canonical_sha256":"7e813b63f5865191608de26446578a6cb365eb8ef2a235abe511cf5d179eae36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e813b63f5865191608de26446578a6cb365eb8ef2a235abe511cf5d179eae36","first_computed_at":"2026-05-17T23:57:46.512867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:46.512867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TdtiujfaJDb4hs5MeJOrwsiksU+PY+KXW4jOOL8KoRuIVphhVmSLPDl9x/H18JRZfBCC8OROFV4ikotR4rG/AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:46.513450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05590","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b21cd2d7422a3656e62587707de0e256285c52836a66baa4ff5ad7d6378d8401","sha256:ccbbed82e6254ef1b5990079a765f0b7a5d00b1e3f2bb746772da92093903272"],"state_sha256":"c74341e736e8f753edcf342e7b0306170dfdc23389f2172259924be24a9996e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"831tilT/bEtqdNoCRIv1NZnY8ds0wMlDhpEh3YkdyuNC/pUBUkuz7/NGfmoJmtS/YbC7AYlhHxrRdp+iNS7ZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:49:43.696799Z","bundle_sha256":"cf9df4fda74d72fb1bf3eed57a218628cdc82cc4f80241afabb0dbb9edfc7256"}}