{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:R36TAK7MIPKCEGBR4SATHZQPE3","short_pith_number":"pith:R36TAK7M","canonical_record":{"source":{"id":"1202.4281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-20T10:24:52Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"5cdaa1c4ca2e134c46843e3677384ee463b27ab44c3b53902e2507493ff4f17f","abstract_canon_sha256":"fb5d7dc37a467ea619c1fb076728ef464713ec7ce081e6f6ad223fe8fa714392"},"schema_version":"1.0"},"canonical_sha256":"8efd302bec43d4221831e48133e60f26f5eeac90af816420d4f39246e3d2b3b9","source":{"kind":"arxiv","id":"1202.4281","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4281","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4281v2","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4281","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"R36TAK7MIPKC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R36TAK7MIPKCEGBR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R36TAK7M","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:R36TAK7MIPKCEGBR4SATHZQPE3","target":"record","payload":{"canonical_record":{"source":{"id":"1202.4281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-20T10:24:52Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"5cdaa1c4ca2e134c46843e3677384ee463b27ab44c3b53902e2507493ff4f17f","abstract_canon_sha256":"fb5d7dc37a467ea619c1fb076728ef464713ec7ce081e6f6ad223fe8fa714392"},"schema_version":"1.0"},"canonical_sha256":"8efd302bec43d4221831e48133e60f26f5eeac90af816420d4f39246e3d2b3b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:56.364162Z","signature_b64":"F6kKiogc2HMtYCq4/Idi2xPOl3J6lyPQNPz1fygkdKk6sOtuQsWqd6vqAnTwx2KoBLRsuox8DxxFX9Jof4qgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8efd302bec43d4221831e48133e60f26f5eeac90af816420d4f39246e3d2b3b9","last_reissued_at":"2026-05-18T02:52:56.363470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:56.363470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.4281","source_version":2,"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-18T02:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHQZhv92yc5tVQX58kWzRPvaMd8uoA7TnK4ElW2ZCY77YXx4pUvimxLyJRTmGX5vk6Z546GBhuVZ7zZdEttxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:29:50.347926Z"},"content_sha256":"e773a4bd0d0e3c94d54770c1a0994c9e994013762c704054b166ba232ebd184c","schema_version":"1.0","event_id":"sha256:e773a4bd0d0e3c94d54770c1a0994c9e994013762c704054b166ba232ebd184c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:R36TAK7MIPKCEGBR4SATHZQPE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Termination of Monotonicity-Constraint Transition Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Amir M. Ben-Amram, Michael Vainer","submitted_at":"2012-02-20T10:24:52Z","abstract_excerpt":"Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint Transition Systems, a program abstraction where termination is decidable (based on the size-change termination principle). We show that these programs also have a decidable complexity property: one can determine whether the length of all transition sequences can be bounded in terms of the initial state. This is the Bounded Termination problem. Interestingly, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4281","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"},"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-18T02:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HH8eQL6VPUqrnQWjm7XjNgkyKZ+h1bu42eWh/apmbgB74kjPG1eJ/dNmyaNMQlvOrKFoQGE5YL6kzeA0OigLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:29:50.348458Z"},"content_sha256":"4263e847e69f5d7e6857e559f32b4d74f3c43c0d54c7c18d01c093e3b3b4d0ce","schema_version":"1.0","event_id":"sha256:4263e847e69f5d7e6857e559f32b4d74f3c43c0d54c7c18d01c093e3b3b4d0ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R36TAK7MIPKCEGBR4SATHZQPE3/bundle.json","state_url":"https://pith.science/pith/R36TAK7MIPKCEGBR4SATHZQPE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R36TAK7MIPKCEGBR4SATHZQPE3/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-30T01:29:50Z","links":{"resolver":"https://pith.science/pith/R36TAK7MIPKCEGBR4SATHZQPE3","bundle":"https://pith.science/pith/R36TAK7MIPKCEGBR4SATHZQPE3/bundle.json","state":"https://pith.science/pith/R36TAK7MIPKCEGBR4SATHZQPE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R36TAK7MIPKCEGBR4SATHZQPE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:R36TAK7MIPKCEGBR4SATHZQPE3","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":"fb5d7dc37a467ea619c1fb076728ef464713ec7ce081e6f6ad223fe8fa714392","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-20T10:24:52Z","title_canon_sha256":"5cdaa1c4ca2e134c46843e3677384ee463b27ab44c3b53902e2507493ff4f17f"},"schema_version":"1.0","source":{"id":"1202.4281","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4281","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4281v2","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4281","created_at":"2026-05-18T02:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"R36TAK7MIPKC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R36TAK7MIPKCEGBR","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R36TAK7M","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:4263e847e69f5d7e6857e559f32b4d74f3c43c0d54c7c18d01c093e3b3b4d0ce","target":"graph","created_at":"2026-05-18T02:52:56Z","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":"Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint Transition Systems, a program abstraction where termination is decidable (based on the size-change termination principle). We show that these programs also have a decidable complexity property: one can determine whether the length of all transition sequences can be bounded in terms of the initial state. This is the Bounded Termination problem. Interestingly, ","authors_text":"Amir M. Ben-Amram, Michael Vainer","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-20T10:24:52Z","title":"Bounded Termination of Monotonicity-Constraint Transition Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4281","kind":"arxiv","version":2},"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:e773a4bd0d0e3c94d54770c1a0994c9e994013762c704054b166ba232ebd184c","target":"record","created_at":"2026-05-18T02:52:56Z","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":"fb5d7dc37a467ea619c1fb076728ef464713ec7ce081e6f6ad223fe8fa714392","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-20T10:24:52Z","title_canon_sha256":"5cdaa1c4ca2e134c46843e3677384ee463b27ab44c3b53902e2507493ff4f17f"},"schema_version":"1.0","source":{"id":"1202.4281","kind":"arxiv","version":2}},"canonical_sha256":"8efd302bec43d4221831e48133e60f26f5eeac90af816420d4f39246e3d2b3b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8efd302bec43d4221831e48133e60f26f5eeac90af816420d4f39246e3d2b3b9","first_computed_at":"2026-05-18T02:52:56.363470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:56.363470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F6kKiogc2HMtYCq4/Idi2xPOl3J6lyPQNPz1fygkdKk6sOtuQsWqd6vqAnTwx2KoBLRsuox8DxxFX9Jof4qgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:56.364162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4281","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e773a4bd0d0e3c94d54770c1a0994c9e994013762c704054b166ba232ebd184c","sha256:4263e847e69f5d7e6857e559f32b4d74f3c43c0d54c7c18d01c093e3b3b4d0ce"],"state_sha256":"1bbd2918c0b35e529c87de07f7a215eb5b24c056e5eab9c83a4c7ad3fd9b78a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7T8JnvMS4MHThhetitXNSox5rB666ElhbSp687jnve51QDlGG8tJz6EuH/cNPPknd6h6vQ1XcWo7T5IDONFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:29:50.352102Z","bundle_sha256":"d7e29f86d61d6278752ad8592dd29146363b78f5cd00247bcf4da966456e58ed"}}