{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JAIKUHWYN3I4Z3BTSMRAWSJBIC","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":"66f6b50f0ed499c0334aeb6a62224618ada0488304fa3d6ccdcccf6277c3bb7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-15T18:48:54Z","title_canon_sha256":"a24467a9843a3edb0ca3f9d82dde1265b70fbcf32e5b8183e2b24fbcc7f5f4ce"},"schema_version":"1.0","source":{"id":"1604.04598","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04598","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04598v2","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04598","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"pith_short_12","alias_value":"JAIKUHWYN3I4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"JAIKUHWYN3I4Z3BT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"JAIKUHWY","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:d872cf237657e9ce9578e22512d0bed5619fadd146f5ace9125b4df2308aeafb","target":"graph","created_at":"2026-05-18T01:16:38Z","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":"A graph $G$ is said to be $1$-perfectly orientable if it has an orientation such that for every vertex $v\\in V(G)$, the out-neighborhood of $v$ in $D$ is a clique in $G$. In $1982$, Skrien posed the problem of characterizing the class of $1$-perfectly orientable graphs. This graph class forms a common generalization of the classes of chordal and circular arc graphs; however, while polynomially recognizable via a reduction to $2$-SAT, no structural characterization of this intriguing class of graphs is known. Based on a reduction of the study of $1$-perfectly orientable graphs to the biconnecte","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Martin Milani\\v{c}, Tatiana Romina Hartinger, Tim Kos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-15T18:48:54Z","title":"$1$-perfectly orientable $K_4$-minor-free and outerplanar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04598","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:192e703eff09b276778cc19605211711fce1c3dd112fb167b0932e2c68b7693e","target":"record","created_at":"2026-05-18T01:16:38Z","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":"66f6b50f0ed499c0334aeb6a62224618ada0488304fa3d6ccdcccf6277c3bb7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-15T18:48:54Z","title_canon_sha256":"a24467a9843a3edb0ca3f9d82dde1265b70fbcf32e5b8183e2b24fbcc7f5f4ce"},"schema_version":"1.0","source":{"id":"1604.04598","kind":"arxiv","version":2}},"canonical_sha256":"4810aa1ed86ed1ccec3393220b4921408465737e0ff413778fd489ed8a37bd92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4810aa1ed86ed1ccec3393220b4921408465737e0ff413778fd489ed8a37bd92","first_computed_at":"2026-05-18T01:16:38.769873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:38.769873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wmk1Achnfhow2+kkJGU+1LeXaR7wTdaGnga5zbCG4DMcB1G8dFdF7yEHKeLNVkzp378+23hrVmbKyT8Td8dFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:38.770558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04598","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:192e703eff09b276778cc19605211711fce1c3dd112fb167b0932e2c68b7693e","sha256:d872cf237657e9ce9578e22512d0bed5619fadd146f5ace9125b4df2308aeafb"],"state_sha256":"765846cdc8af133ba1aa2f1fa0a2841a8eee2a717381df21f73258ed361b5120"}