{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PY4OFJ2WGL2K4M4P3JWGUHODE3","short_pith_number":"pith:PY4OFJ2W","canonical_record":{"source":{"id":"1401.3887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:15:30Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fb74555358cc2e7990872f8ec9e9da79fc0e674eace7e03bdf09fd9e995aff68","abstract_canon_sha256":"8d0146dd2a352e0f1737c12997689fff1b47d0334d55d693aa8cf31fd77823c7"},"schema_version":"1.0"},"canonical_sha256":"7e38e2a75632f4ae338fda6c6a1dc326e35bdc7651d74754884c1878a09508c0","source":{"kind":"arxiv","id":"1401.3887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3887","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3887v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3887","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"PY4OFJ2WGL2K","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PY4OFJ2WGL2K4M4P","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PY4OFJ2W","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PY4OFJ2WGL2K4M4P3JWGUHODE3","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:15:30Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fb74555358cc2e7990872f8ec9e9da79fc0e674eace7e03bdf09fd9e995aff68","abstract_canon_sha256":"8d0146dd2a352e0f1737c12997689fff1b47d0334d55d693aa8cf31fd77823c7"},"schema_version":"1.0"},"canonical_sha256":"7e38e2a75632f4ae338fda6c6a1dc326e35bdc7651d74754884c1878a09508c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.240156Z","signature_b64":"AOhuRyXvfdTe88XrHFRnuCHgAng8AZBIL5fZ+JK2H46F6TvbKJ0vKUaG0hJehb2Dw/dtesDCXV/e6SNy3D2DBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e38e2a75632f4ae338fda6c6a1dc326e35bdc7651d74754884c1878a09508c0","last_reissued_at":"2026-05-18T03:02:06.239708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.239708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3887","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:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SrJekYBuIIJZCodEYhjgUEbDjObtU6S9zzf5K5Rm04HwnKzDx9XRTK2L03IU0d1AqBZI2OKfO1/ha4vjf6/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:44:26.628237Z"},"content_sha256":"cf54b05321f34e01fb05ee0f71a79db6ca1a427bd9a8fb4eba833d387f6dbf21","schema_version":"1.0","event_id":"sha256:cf54b05321f34e01fb05ee0f71a79db6ca1a427bd9a8fb4eba833d387f6dbf21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PY4OFJ2WGL2K4M4P3JWGUHODE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Integer Bound Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"George Katsirelos, Lucas Bordeaux, Moshe Y. Vardi, Nina Narodytska","submitted_at":"2014-01-16T05:15:30Z","abstract_excerpt":"Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a search procedure (\"branch and prune\") and used at every node of the search tree to narrow down the search space, so it is critical that it be fast. The procedure invokes constraint propagators until a common fixpoint is reached, but the known algorithms for this have a pseudo-polynomial worst-case time complexity: they are fast indeed when the variables have a small numerical range, but they have the well-known problem of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3887","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:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnEPw6YXB+0b8K+9JgcjLJAUtRe7Umjx+g6VeJnAKBaqVX6G/V0JAcgRa4SuCJFZILxSgrWQimnBWk1giunvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:44:26.628619Z"},"content_sha256":"4871dbd2bf7fc2ce50c7a836af7731975e5717c89b10985a30ff1769aabeabdd","schema_version":"1.0","event_id":"sha256:4871dbd2bf7fc2ce50c7a836af7731975e5717c89b10985a30ff1769aabeabdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PY4OFJ2WGL2K4M4P3JWGUHODE3/bundle.json","state_url":"https://pith.science/pith/PY4OFJ2WGL2K4M4P3JWGUHODE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PY4OFJ2WGL2K4M4P3JWGUHODE3/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-05-30T18:44:26Z","links":{"resolver":"https://pith.science/pith/PY4OFJ2WGL2K4M4P3JWGUHODE3","bundle":"https://pith.science/pith/PY4OFJ2WGL2K4M4P3JWGUHODE3/bundle.json","state":"https://pith.science/pith/PY4OFJ2WGL2K4M4P3JWGUHODE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PY4OFJ2WGL2K4M4P3JWGUHODE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PY4OFJ2WGL2K4M4P3JWGUHODE3","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":"8d0146dd2a352e0f1737c12997689fff1b47d0334d55d693aa8cf31fd77823c7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:15:30Z","title_canon_sha256":"fb74555358cc2e7990872f8ec9e9da79fc0e674eace7e03bdf09fd9e995aff68"},"schema_version":"1.0","source":{"id":"1401.3887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3887","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3887v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3887","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"PY4OFJ2WGL2K","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PY4OFJ2WGL2K4M4P","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PY4OFJ2W","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:4871dbd2bf7fc2ce50c7a836af7731975e5717c89b10985a30ff1769aabeabdd","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a search procedure (\"branch and prune\") and used at every node of the search tree to narrow down the search space, so it is critical that it be fast. The procedure invokes constraint propagators until a common fixpoint is reached, but the known algorithms for this have a pseudo-polynomial worst-case time complexity: they are fast indeed when the variables have a small numerical range, but they have the well-known problem of","authors_text":"George Katsirelos, Lucas Bordeaux, Moshe Y. Vardi, Nina Narodytska","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:15:30Z","title":"The Complexity of Integer Bound Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3887","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:cf54b05321f34e01fb05ee0f71a79db6ca1a427bd9a8fb4eba833d387f6dbf21","target":"record","created_at":"2026-05-18T03:02:06Z","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":"8d0146dd2a352e0f1737c12997689fff1b47d0334d55d693aa8cf31fd77823c7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:15:30Z","title_canon_sha256":"fb74555358cc2e7990872f8ec9e9da79fc0e674eace7e03bdf09fd9e995aff68"},"schema_version":"1.0","source":{"id":"1401.3887","kind":"arxiv","version":1}},"canonical_sha256":"7e38e2a75632f4ae338fda6c6a1dc326e35bdc7651d74754884c1878a09508c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e38e2a75632f4ae338fda6c6a1dc326e35bdc7651d74754884c1878a09508c0","first_computed_at":"2026-05-18T03:02:06.239708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.239708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AOhuRyXvfdTe88XrHFRnuCHgAng8AZBIL5fZ+JK2H46F6TvbKJ0vKUaG0hJehb2Dw/dtesDCXV/e6SNy3D2DBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.240156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf54b05321f34e01fb05ee0f71a79db6ca1a427bd9a8fb4eba833d387f6dbf21","sha256:4871dbd2bf7fc2ce50c7a836af7731975e5717c89b10985a30ff1769aabeabdd"],"state_sha256":"13cabbbd4292ad21f06ec199cc4e92128591f1dc721a0470da769aa6f8b37b26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BAowwSn8Pd+SXq7Rooq66fGSMeK+GRdKS0yT1GO8jN8ig/jl/sBv9qO0qCEgRo3zUIG0itl8qhI5h/8y3418BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:44:26.631714Z","bundle_sha256":"1efa7bcc410709f96970c0535b77120c4d6ce3e0e339d6b521acc921c7edd7e2"}}