{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:4YUTYXZFGYPPA5ZDREQBPWMOXP","short_pith_number":"pith:4YUTYXZF","schema_version":"1.0","canonical_sha256":"e6293c5f25361ef07723892017d98ebbc1c9ce1ca36dbd79a9d5dd927215c67d","source":{"kind":"arxiv","id":"cs/0508123","version":1},"attestation_state":"computed","paper":{"title":"On Algorithms and Complexity for Sets with Cardinality Constraints","license":"","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Bruno Marnette, Martin Rinard, Viktor Kuncak","submitted_at":"2005-08-28T22:25:22Z","abstract_excerpt":"Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate properties: relationships between the typestates of objects can be expressed as subset and disjointness relations on sets, and elements of sets can be represented as sets of cardinality one. Motivated by these applications, this paper presents new algorithms and new complexity results for constraints on sets and their cardinalities. We study several classes o"},"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/0508123","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2005-08-28T22:25:22Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"851225d9db97082a837a371557b14cc06aaaf86ead7948dc54f1d91492efadf7","abstract_canon_sha256":"16347124d432635eeffd3ba88d78a510ebf69e452765b5af53c65736ca1a72d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:48.349661Z","signature_b64":"Pp3OhpweZghPzbLinNf02WfZciQ1AD3fe8fVuEV5Nx6SDwZZMrmG80i03cn+rAxMACJgXOnrfzR0odD37naDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6293c5f25361ef07723892017d98ebbc1c9ce1ca36dbd79a9d5dd927215c67d","last_reissued_at":"2026-05-18T03:33:48.348739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:48.348739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Algorithms and Complexity for Sets with Cardinality Constraints","license":"","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Bruno Marnette, Martin Rinard, Viktor Kuncak","submitted_at":"2005-08-28T22:25:22Z","abstract_excerpt":"Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate properties: relationships between the typestates of objects can be expressed as subset and disjointness relations on sets, and elements of sets can be represented as sets of cardinality one. Motivated by these applications, this paper presents new algorithms and new complexity results for constraints on sets and their cardinalities. We study several classes o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508123","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":"cs/0508123","created_at":"2026-05-18T03:33:48.348870+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0508123v1","created_at":"2026-05-18T03:33:48.348870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508123","created_at":"2026-05-18T03:33:48.348870+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YUTYXZFGYPP","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YUTYXZFGYPPA5ZD","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YUTYXZF","created_at":"2026-05-18T12:25:52.687210+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/4YUTYXZFGYPPA5ZDREQBPWMOXP","json":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP.json","graph_json":"https://pith.science/api/pith-number/4YUTYXZFGYPPA5ZDREQBPWMOXP/graph.json","events_json":"https://pith.science/api/pith-number/4YUTYXZFGYPPA5ZDREQBPWMOXP/events.json","paper":"https://pith.science/paper/4YUTYXZF"},"agent_actions":{"view_html":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP","download_json":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP.json","view_paper":"https://pith.science/paper/4YUTYXZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0508123&json=true","fetch_graph":"https://pith.science/api/pith-number/4YUTYXZFGYPPA5ZDREQBPWMOXP/graph.json","fetch_events":"https://pith.science/api/pith-number/4YUTYXZFGYPPA5ZDREQBPWMOXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/action/storage_attestation","attest_author":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/action/author_attestation","sign_citation":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/action/citation_signature","submit_replication":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/action/replication_record"}},"created_at":"2026-05-18T03:33:48.348870+00:00","updated_at":"2026-05-18T03:33:48.348870+00:00"}