{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:464O5LLISMQWEC6DAHFOXFL3VD","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":"fb202a154b8fdad622b7d6d59647ac20c0027b0abf45b6762ae62687fa55c8a3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-02T01:10:39Z","title_canon_sha256":"845141a4b48fc41c20008ec092e5bb2e653b5d037633493908c2d1fbd097ef38"},"schema_version":"1.0","source":{"id":"1906.00321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00321","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00321v1","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00321","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"464O5LLISMQW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"464O5LLISMQWEC6D","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"464O5LLI","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:1e509b0119b50db86030572d9a147cff95b9094e8277cb0523ddf1e8ae049270","target":"graph","created_at":"2026-05-17T23:44:27Z","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":"In 1969, Alan Tucker characterized proper circular-arc graphs as those graphs whose augmented adjacency matrices have the circularly compatible ones property. Moreover, he also found a polynomial-time algorithm for deciding whether any given augmented adjacency matrix has the circularly compatible ones property. These results allowed him to devise the first polynomial-time recognition algorithm for proper circular-arc graphs. However, as Tucker himself remarks, he did not solve the problems of finding a structure theorem and an efficient recognition algorithm for the circularly compatible ones","authors_text":"Mart\\'in D. Safe","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-02T01:10:39Z","title":"Circularly compatible ones, $D$-circularity, and proper circular-arc bigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00321","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:1d96eb7b080ede14673d64cceb681bc1dfa42aac6f2da158f6e029485cc6788f","target":"record","created_at":"2026-05-17T23:44:27Z","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":"fb202a154b8fdad622b7d6d59647ac20c0027b0abf45b6762ae62687fa55c8a3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-02T01:10:39Z","title_canon_sha256":"845141a4b48fc41c20008ec092e5bb2e653b5d037633493908c2d1fbd097ef38"},"schema_version":"1.0","source":{"id":"1906.00321","kind":"arxiv","version":1}},"canonical_sha256":"e7b8eead689321620bc301caeb957ba8cae4408017f00c2f74272dc73d27d4a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7b8eead689321620bc301caeb957ba8cae4408017f00c2f74272dc73d27d4a2","first_computed_at":"2026-05-17T23:44:27.445187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:27.445187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pYDF2mWh5flIF1EKbSbu0ZHBA6tk28kCfTDHVq8eG9bvOXWZCs7VZLa5uOsFdIV/NNOxh23ewBagPsx8RU3iBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:27.445838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d96eb7b080ede14673d64cceb681bc1dfa42aac6f2da158f6e029485cc6788f","sha256:1e509b0119b50db86030572d9a147cff95b9094e8277cb0523ddf1e8ae049270"],"state_sha256":"4506842fcec8c145cffd8d1c9ffb52dd9c5b8b5e054e773f81b99aa950043f83"}