{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:4YUTYXZFGYPPA5ZDREQBPWMOXP","short_pith_number":"pith:4YUTYXZF","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"},"canonical_sha256":"e6293c5f25361ef07723892017d98ebbc1c9ce1ca36dbd79a9d5dd927215c67d","source":{"kind":"arxiv","id":"cs/0508123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508123","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508123v1","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508123","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"pith_short_12","alias_value":"4YUTYXZFGYPP","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"4YUTYXZFGYPPA5ZD","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"4YUTYXZF","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:4YUTYXZFGYPPA5ZDREQBPWMOXP","target":"record","payload":{"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"},"canonical_sha256":"e6293c5f25361ef07723892017d98ebbc1c9ce1ca36dbd79a9d5dd927215c67d","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"},"source_kind":"arxiv","source_id":"cs/0508123","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zNXM8iCsyBE5tRnQqvufqKrqBxigPOriMEHMyYFCoMIJAGO+LT3+OSn8IYd/gRqcQP5XCHnsKI7GpEAo6InCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:28:23.985468Z"},"content_sha256":"15ed868fc93be1a63a9e9742d0bc9fd5aba747b2b3d13f581266a3eb3ffeaf7f","schema_version":"1.0","event_id":"sha256:15ed868fc93be1a63a9e9742d0bc9fd5aba747b2b3d13f581266a3eb3ffeaf7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:4YUTYXZFGYPPA5ZDREQBPWMOXP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+uBfIcDQ1RuI+eaxzvQawCOY8wH7/W7pHAwhgV7Oul2x5bymObDjhZvn1s03dW418pMhYxof65uZMYGDY1GcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:28:23.985843Z"},"content_sha256":"7f97dbb0cb9b31c02366986db2f622bcb00b7953b829e055066b658afbf56cf7","schema_version":"1.0","event_id":"sha256:7f97dbb0cb9b31c02366986db2f622bcb00b7953b829e055066b658afbf56cf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/bundle.json","state_url":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T17:28:23Z","links":{"resolver":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP","bundle":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/bundle.json","state":"https://pith.science/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YUTYXZFGYPPA5ZDREQBPWMOXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:4YUTYXZFGYPPA5ZDREQBPWMOXP","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":"16347124d432635eeffd3ba88d78a510ebf69e452765b5af53c65736ca1a72d9","cross_cats_sorted":["cs.LO","cs.SE"],"license":"","primary_cat":"cs.PL","submitted_at":"2005-08-28T22:25:22Z","title_canon_sha256":"851225d9db97082a837a371557b14cc06aaaf86ead7948dc54f1d91492efadf7"},"schema_version":"1.0","source":{"id":"cs/0508123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508123","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508123v1","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508123","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"pith_short_12","alias_value":"4YUTYXZFGYPP","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"4YUTYXZFGYPPA5ZD","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"4YUTYXZF","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:7f97dbb0cb9b31c02366986db2f622bcb00b7953b829e055066b658afbf56cf7","target":"graph","created_at":"2026-05-18T03:33:48Z","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":"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","authors_text":"Bruno Marnette, Martin Rinard, Viktor Kuncak","cross_cats":["cs.LO","cs.SE"],"headline":"","license":"","primary_cat":"cs.PL","submitted_at":"2005-08-28T22:25:22Z","title":"On Algorithms and Complexity for Sets with Cardinality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508123","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:15ed868fc93be1a63a9e9742d0bc9fd5aba747b2b3d13f581266a3eb3ffeaf7f","target":"record","created_at":"2026-05-18T03:33:48Z","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":"16347124d432635eeffd3ba88d78a510ebf69e452765b5af53c65736ca1a72d9","cross_cats_sorted":["cs.LO","cs.SE"],"license":"","primary_cat":"cs.PL","submitted_at":"2005-08-28T22:25:22Z","title_canon_sha256":"851225d9db97082a837a371557b14cc06aaaf86ead7948dc54f1d91492efadf7"},"schema_version":"1.0","source":{"id":"cs/0508123","kind":"arxiv","version":1}},"canonical_sha256":"e6293c5f25361ef07723892017d98ebbc1c9ce1ca36dbd79a9d5dd927215c67d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6293c5f25361ef07723892017d98ebbc1c9ce1ca36dbd79a9d5dd927215c67d","first_computed_at":"2026-05-18T03:33:48.348739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:48.348739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pp3OhpweZghPzbLinNf02WfZciQ1AD3fe8fVuEV5Nx6SDwZZMrmG80i03cn+rAxMACJgXOnrfzR0odD37naDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:48.349661Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0508123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15ed868fc93be1a63a9e9742d0bc9fd5aba747b2b3d13f581266a3eb3ffeaf7f","sha256:7f97dbb0cb9b31c02366986db2f622bcb00b7953b829e055066b658afbf56cf7"],"state_sha256":"3875150adf1fc92ae2a6ce832a067e204ec54fd28ac3352ca0902307c0b28d32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KomA5AZ7o6ukoudvK7IXtsZSnP/gJIYg0CWmj3OSmbEsVDhotWm2tkxDReEJ7eyiFFT6qJLO6V3uW8jSZFTLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:28:23.987839Z","bundle_sha256":"c4e508f1b2b9bd4d5d6453138f373c6df152236ba5cb78b73506e5781d2eadaf"}}