{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:TT6GDJWPIIUNRZ2VADMD2BI2P3","short_pith_number":"pith:TT6GDJWP","schema_version":"1.0","canonical_sha256":"9cfc61a6cf4228d8e75500d83d051a7efd5a334b11419fba2d3c314c48e23857","source":{"kind":"arxiv","id":"cs/0502058","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Computing the Size of an Interval","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Christopher M. Homan, Klaus W. Wagner, Lane A. Hemaspaandra, Sven Kosub","submitted_at":"2005-02-13T15:24:30Z","abstract_excerpt":"Given a p-order A over a universe of strings (i.e., a transitive, reflexive, antisymmetric relation such that if (x, y) is an element of A then |x| is polynomially bounded by |y|), an interval size function of A returns, for each string x in the universe, the number of strings in the interval between strings b(x) and t(x) (with respect to A), where b(x) and t(x) are functions that are polynomial-time computable in the length of x.\n  By choosing sets of interval size functions based on feasibility requirements for their underlying p-orders, we obtain new characterizations of complexity classes."},"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":"cs/0502058","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2005-02-13T15:24:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7144dfde9c3837d4a20d0855988af2b9286025f50335089406c2f31c7ebf221e","abstract_canon_sha256":"a83976682d3f0d76d70831899f3c430491b8a135bfc7ac61f921782edd05b0d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:49.189352Z","signature_b64":"v83nNEssy7uHpaHyjRq/pkCXvDAxkd8Xr+IO5ysx+uJsIyXplqi+fNuYcFxMntmI7fwB6zBmcnHp7lJ4muuNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cfc61a6cf4228d8e75500d83d051a7efd5a334b11419fba2d3c314c48e23857","last_reissued_at":"2026-05-18T01:06:49.188714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:49.188714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Computing the Size of an Interval","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Christopher M. Homan, Klaus W. Wagner, Lane A. Hemaspaandra, Sven Kosub","submitted_at":"2005-02-13T15:24:30Z","abstract_excerpt":"Given a p-order A over a universe of strings (i.e., a transitive, reflexive, antisymmetric relation such that if (x, y) is an element of A then |x| is polynomially bounded by |y|), an interval size function of A returns, for each string x in the universe, the number of strings in the interval between strings b(x) and t(x) (with respect to A), where b(x) and t(x) are functions that are polynomial-time computable in the length of x.\n  By choosing sets of interval size functions based on feasibility requirements for their underlying p-orders, we obtain new characterizations of complexity classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0502058","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0502058","created_at":"2026-05-18T01:06:49.188820+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0502058v2","created_at":"2026-05-18T01:06:49.188820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0502058","created_at":"2026-05-18T01:06:49.188820+00:00"},{"alias_kind":"pith_short_12","alias_value":"TT6GDJWPIIUN","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"TT6GDJWPIIUNRZ2V","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"TT6GDJWP","created_at":"2026-05-18T12:25:53.335082+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/TT6GDJWPIIUNRZ2VADMD2BI2P3","json":"https://pith.science/pith/TT6GDJWPIIUNRZ2VADMD2BI2P3.json","graph_json":"https://pith.science/api/pith-number/TT6GDJWPIIUNRZ2VADMD2BI2P3/graph.json","events_json":"https://pith.science/api/pith-number/TT6GDJWPIIUNRZ2VADMD2BI2P3/events.json","paper":"https://pith.science/paper/TT6GDJWP"},"agent_actions":{"view_html":"https://pith.science/pith/TT6GDJWPIIUNRZ2VADMD2BI2P3","download_json":"https://pith.science/pith/TT6GDJWPIIUNRZ2VADMD2BI2P3.json","view_paper":"https://pith.science/paper/TT6GDJWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0502058&json=true","fetch_graph":"https://pith.science/api/pith-number/TT6GDJWPIIUNRZ2VADMD2BI2P3/graph.json","fetch_events":"https://pith.science/api/pith-number/TT6GDJWPIIUNRZ2VADMD2BI2P3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TT6GDJWPIIUNRZ2VADMD2BI2P3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TT6GDJWPIIUNRZ2VADMD2BI2P3/action/storage_attestation","attest_author":"https://pith.science/pith/TT6GDJWPIIUNRZ2VADMD2BI2P3/action/author_attestation","sign_citation":"https://pith.science/pith/TT6GDJWPIIUNRZ2VADMD2BI2P3/action/citation_signature","submit_replication":"https://pith.science/pith/TT6GDJWPIIUNRZ2VADMD2BI2P3/action/replication_record"}},"created_at":"2026-05-18T01:06:49.188820+00:00","updated_at":"2026-05-18T01:06:49.188820+00:00"}