{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5O4TWCYXDYTF2VN5IYOYZID4D4","short_pith_number":"pith:5O4TWCYX","schema_version":"1.0","canonical_sha256":"ebb93b0b171e265d55bd461d8ca07c1f2e2f5424c1cb8f45c804fef7c1721457","source":{"kind":"arxiv","id":"1905.00099","version":1},"attestation_state":"computed","paper":{"title":"Some results on multithreshold graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2019-04-30T20:51:54Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.00099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-30T20:51:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"792a3838de34af8f6f292c861a311b3bf24060516a60e50013db4cf450c52c42","abstract_canon_sha256":"2939551b52f24b61d744615129320b1cd00462b401b091762aad6840071c7f4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:15.215911Z","signature_b64":"KRKOYZKw7aQE5Lm2ipiygJSaEP2kfYteuPaYRsIH+cMvIgLp8HAsiI6omzc9G1aS82hF5lf8oKsROW96ck+fDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb93b0b171e265d55bd461d8ca07c1f2e2f5424c1cb8f45c804fef7c1721457","last_reissued_at":"2026-05-17T23:47:15.215400Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:15.215400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some results on multithreshold graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2019-04-30T20:51:54Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00099","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.00099","created_at":"2026-05-17T23:47:15.215477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00099v1","created_at":"2026-05-17T23:47:15.215477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00099","created_at":"2026-05-17T23:47:15.215477+00:00"},{"alias_kind":"pith_short_12","alias_value":"5O4TWCYXDYTF","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5O4TWCYXDYTF2VN5","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5O4TWCYX","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4","json":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4.json","graph_json":"https://pith.science/api/pith-number/5O4TWCYXDYTF2VN5IYOYZID4D4/graph.json","events_json":"https://pith.science/api/pith-number/5O4TWCYXDYTF2VN5IYOYZID4D4/events.json","paper":"https://pith.science/paper/5O4TWCYX"},"agent_actions":{"view_html":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4","download_json":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4.json","view_paper":"https://pith.science/paper/5O4TWCYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00099&json=true","fetch_graph":"https://pith.science/api/pith-number/5O4TWCYXDYTF2VN5IYOYZID4D4/graph.json","fetch_events":"https://pith.science/api/pith-number/5O4TWCYXDYTF2VN5IYOYZID4D4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4/action/storage_attestation","attest_author":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4/action/author_attestation","sign_citation":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4/action/citation_signature","submit_replication":"https://pith.science/pith/5O4TWCYXDYTF2VN5IYOYZID4D4/action/replication_record"}},"created_at":"2026-05-17T23:47:15.215477+00:00","updated_at":"2026-05-17T23:47:15.215477+00:00"}