{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5O4TWCYXDYTF2VN5IYOYZID4D4","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":"2939551b52f24b61d744615129320b1cd00462b401b091762aad6840071c7f4c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-30T20:51:54Z","title_canon_sha256":"792a3838de34af8f6f292c861a311b3bf24060516a60e50013db4cf450c52c42"},"schema_version":"1.0","source":{"id":"1905.00099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00099","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00099v1","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00099","created_at":"2026-05-17T23:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"5O4TWCYXDYTF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5O4TWCYXDYTF2VN5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5O4TWCYX","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:1d24a8077c525d8aa136f73045ccb615db50576bbd8965e3a4ececd770db4a1c","target":"graph","created_at":"2026-05-17T23:47:15Z","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":"Jamison and Sprague defined a graph $G$ to be a $k$-threshold graph with thresholds $\\theta_1 , \\ldots, \\theta_k$ (strictly increasing) if one can assign real numbers $(r_v)_{v \\in V(G)}$, called ranks, such that for every pair of vertices $v,w$, we have $vw \\in E(G)$ if and only if the inequality $\\theta_i \\leq r_v + r_w$ holds for an odd number of indices $i$. When $k=1$ or $k=2$, the precise choice of thresholds $\\theta_1, \\ldots, \\theta_k$ does not matter, as a suitable transformation of the ranks transforms a representation with one choice of thresholds into a representation with any othe","authors_text":"Gregory J. Puleo","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-30T20:51:54Z","title":"Some results on multithreshold graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00099","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:5b12e2f1734ce5c0c617d1f772312534526c99ae2a1d26fa4392d3ce80a674a8","target":"record","created_at":"2026-05-17T23:47:15Z","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":"2939551b52f24b61d744615129320b1cd00462b401b091762aad6840071c7f4c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-30T20:51:54Z","title_canon_sha256":"792a3838de34af8f6f292c861a311b3bf24060516a60e50013db4cf450c52c42"},"schema_version":"1.0","source":{"id":"1905.00099","kind":"arxiv","version":1}},"canonical_sha256":"ebb93b0b171e265d55bd461d8ca07c1f2e2f5424c1cb8f45c804fef7c1721457","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebb93b0b171e265d55bd461d8ca07c1f2e2f5424c1cb8f45c804fef7c1721457","first_computed_at":"2026-05-17T23:47:15.215400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:15.215400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KRKOYZKw7aQE5Lm2ipiygJSaEP2kfYteuPaYRsIH+cMvIgLp8HAsiI6omzc9G1aS82hF5lf8oKsROW96ck+fDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:15.215911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b12e2f1734ce5c0c617d1f772312534526c99ae2a1d26fa4392d3ce80a674a8","sha256:1d24a8077c525d8aa136f73045ccb615db50576bbd8965e3a4ececd770db4a1c"],"state_sha256":"68f68ef660517a53cf2025fb2df14f2b1923d46856b71a504a3672bddd149db1"}