{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SPEIMFUBQJHOMLQM6TDTFP7XJ3","short_pith_number":"pith:SPEIMFUB","canonical_record":{"source":{"id":"1304.5051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T08:42:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1cc630a2bec26be7f122b48d158afd68d43a1530d78463af22a69f6249ecccbd","abstract_canon_sha256":"ad308be288f5edf3acc158cff16f1dc613ad013c12b772fdab47710255069dc1"},"schema_version":"1.0"},"canonical_sha256":"93c8861681824ee62e0cf4c732bff74ed9978400a790ee8e55bf6c96684d535b","source":{"kind":"arxiv","id":"1304.5051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5051","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5051v1","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5051","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"SPEIMFUBQJHO","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SPEIMFUBQJHOMLQM","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SPEIMFUB","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SPEIMFUBQJHOMLQM6TDTFP7XJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T08:42:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1cc630a2bec26be7f122b48d158afd68d43a1530d78463af22a69f6249ecccbd","abstract_canon_sha256":"ad308be288f5edf3acc158cff16f1dc613ad013c12b772fdab47710255069dc1"},"schema_version":"1.0"},"canonical_sha256":"93c8861681824ee62e0cf4c732bff74ed9978400a790ee8e55bf6c96684d535b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:41.956823Z","signature_b64":"cw9cm7SEWiemk85yb3CnVQIUWr0mdM8IHh/i5KdoFN8d7Rjfvv+CVLv43OUdbilrbh/pHx1xd0RSatMzVNOrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93c8861681824ee62e0cf4c732bff74ed9978400a790ee8e55bf6c96684d535b","last_reissued_at":"2026-05-18T03:27:41.955484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:41.955484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5051","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:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWh8NTAhqpkxV8rzhSyMOh9omwq/eGrqXlCAz/NLYXbNms7B9v3S9MyKZvCEmntxdXs99JvPUMk0aBf5GnRSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:00:02.751939Z"},"content_sha256":"a15a9092739a98de2ec03dfebbd557c94a39cc394f52e3d003cd24e43b1b1839","schema_version":"1.0","event_id":"sha256:a15a9092739a98de2ec03dfebbd557c94a39cc394f52e3d003cd24e43b1b1839"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SPEIMFUBQJHOMLQM6TDTFP7XJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint Satisfaction over Generalized Staircase Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Arnab Bhattacharya, Partha Dutta, Shubhadip Mitra","submitted_at":"2013-04-18T08:42:22Z","abstract_excerpt":"One of the key research interests in the area of Constraint Satisfaction Problem (CSP) is to identify tractable classes of constraints and develop efficient solutions for them. In this paper, we introduce generalized staircase (GS) constraints which is an important generalization of one such tractable class found in the literature, namely, staircase constraints. GS constraints are of two kinds, down staircase (DS) and up staircase (US). We first examine several properties of GS constraints, and then show that arc consistency is sufficient to determine a solution to a CSP over DS constraints. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5051","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:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/PFibF9jusIDxeBlrxAuo2QYGsnLB9schn4KmzzOlgfoi3ruZni2F2M80LMySuJbtYnvVuPK76lNe+yezDRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:00:02.752264Z"},"content_sha256":"bfc95e3fa15996d8388cdc8d1f85080c9f8fd85430cf9219225075a87289a61c","schema_version":"1.0","event_id":"sha256:bfc95e3fa15996d8388cdc8d1f85080c9f8fd85430cf9219225075a87289a61c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPEIMFUBQJHOMLQM6TDTFP7XJ3/bundle.json","state_url":"https://pith.science/pith/SPEIMFUBQJHOMLQM6TDTFP7XJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPEIMFUBQJHOMLQM6TDTFP7XJ3/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-02T08:00:02Z","links":{"resolver":"https://pith.science/pith/SPEIMFUBQJHOMLQM6TDTFP7XJ3","bundle":"https://pith.science/pith/SPEIMFUBQJHOMLQM6TDTFP7XJ3/bundle.json","state":"https://pith.science/pith/SPEIMFUBQJHOMLQM6TDTFP7XJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPEIMFUBQJHOMLQM6TDTFP7XJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SPEIMFUBQJHOMLQM6TDTFP7XJ3","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":"ad308be288f5edf3acc158cff16f1dc613ad013c12b772fdab47710255069dc1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T08:42:22Z","title_canon_sha256":"1cc630a2bec26be7f122b48d158afd68d43a1530d78463af22a69f6249ecccbd"},"schema_version":"1.0","source":{"id":"1304.5051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5051","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5051v1","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5051","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"SPEIMFUBQJHO","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SPEIMFUBQJHOMLQM","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SPEIMFUB","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:bfc95e3fa15996d8388cdc8d1f85080c9f8fd85430cf9219225075a87289a61c","target":"graph","created_at":"2026-05-18T03:27:41Z","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":"One of the key research interests in the area of Constraint Satisfaction Problem (CSP) is to identify tractable classes of constraints and develop efficient solutions for them. In this paper, we introduce generalized staircase (GS) constraints which is an important generalization of one such tractable class found in the literature, namely, staircase constraints. GS constraints are of two kinds, down staircase (DS) and up staircase (US). We first examine several properties of GS constraints, and then show that arc consistency is sufficient to determine a solution to a CSP over DS constraints. F","authors_text":"Arnab Bhattacharya, Partha Dutta, Shubhadip Mitra","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T08:42:22Z","title":"Constraint Satisfaction over Generalized Staircase Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5051","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:a15a9092739a98de2ec03dfebbd557c94a39cc394f52e3d003cd24e43b1b1839","target":"record","created_at":"2026-05-18T03:27:41Z","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":"ad308be288f5edf3acc158cff16f1dc613ad013c12b772fdab47710255069dc1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T08:42:22Z","title_canon_sha256":"1cc630a2bec26be7f122b48d158afd68d43a1530d78463af22a69f6249ecccbd"},"schema_version":"1.0","source":{"id":"1304.5051","kind":"arxiv","version":1}},"canonical_sha256":"93c8861681824ee62e0cf4c732bff74ed9978400a790ee8e55bf6c96684d535b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93c8861681824ee62e0cf4c732bff74ed9978400a790ee8e55bf6c96684d535b","first_computed_at":"2026-05-18T03:27:41.955484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:41.955484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cw9cm7SEWiemk85yb3CnVQIUWr0mdM8IHh/i5KdoFN8d7Rjfvv+CVLv43OUdbilrbh/pHx1xd0RSatMzVNOrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:41.956823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a15a9092739a98de2ec03dfebbd557c94a39cc394f52e3d003cd24e43b1b1839","sha256:bfc95e3fa15996d8388cdc8d1f85080c9f8fd85430cf9219225075a87289a61c"],"state_sha256":"2645bae81a78b6aec37298f29d5c678f08028cd3e396c88e81c968cb5878172d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/Li5cmtTE9Syx+h4HW3vTgbi1cVNpoPwHnDWoB5aO+4JD75CxuYjCfTstF+VRnVnl9rKRk1CMhjSl/6q/SIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:00:02.754114Z","bundle_sha256":"78f7cbfdf625f22d91b837f1fabde3a8e85af607001e2553d18536783747420a"}}