{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Q4XXEA6AIZUAOK6L5AR4QJQ5SG","short_pith_number":"pith:Q4XXEA6A","canonical_record":{"source":{"id":"1210.4289","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-16T08:16:23Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"13dfcea7b0a74c2b19f276250a30d59b92038984c40616711a8037762985e2cd","abstract_canon_sha256":"a727637b68e3849d4a72be9eaa0f7b317d526a217e3897124fc4ca1a3c88a82e"},"schema_version":"1.0"},"canonical_sha256":"872f7203c04668072bcbe823c8261d91a45c469ae67a194e774b676be3ffa9e1","source":{"kind":"arxiv","id":"1210.4289","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4289","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4289v3","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4289","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"Q4XXEA6AIZUA","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"Q4XXEA6AIZUAOK6L","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"Q4XXEA6A","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Q4XXEA6AIZUAOK6L5AR4QJQ5SG","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4289","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-16T08:16:23Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"13dfcea7b0a74c2b19f276250a30d59b92038984c40616711a8037762985e2cd","abstract_canon_sha256":"a727637b68e3849d4a72be9eaa0f7b317d526a217e3897124fc4ca1a3c88a82e"},"schema_version":"1.0"},"canonical_sha256":"872f7203c04668072bcbe823c8261d91a45c469ae67a194e774b676be3ffa9e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:34.853244Z","signature_b64":"wi++MW4/5Q1xLLVWOPURObgbBHzZOyB8JaBrO10ElnkH6BWi0j284+FH/18BQiPRZPsqIupq1LMkzl6kjZgpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"872f7203c04668072bcbe823c8261d91a45c469ae67a194e774b676be3ffa9e1","last_reissued_at":"2026-05-18T01:01:34.852769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:34.852769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4289","source_version":3,"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-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gfmlnCsf10qSUBC/d710J5cCO2oihlxPERUCxzR4Qf2TO/SaS5ycpabPXMnkCqMznjANm9s7WC9nVcWFA50Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:22:31.914245Z"},"content_sha256":"31e765f7c61ac0acb087b95fb5072361b2364244ec1e6eb770f587ff7859cdcc","schema_version":"1.0","event_id":"sha256:31e765f7c61ac0acb087b95fb5072361b2364244ec1e6eb770f587ff7859cdcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Q4XXEA6AIZUAOK6L5AR4QJQ5SG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Underapproximation of Procedure Summaries for Integer Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.PL","authors_text":"Filip Konecny, Pierre Ganty, Radu Iosif","submitted_at":"2012-10-16T08:16:23Z","abstract_excerpt":"We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approach is that the non-recursive program we compute may capture unboundedly many behaviors of the original recursive program for which stack usage cannot be bounded. Moreover, we identify a class of recursive programs on which our method terminates and returns the precise summary relations without underapproximation. Doing so, we generalize a similar result for non-recursive programs to the recursive case. Finally, we pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4289","kind":"arxiv","version":3},"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-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zGgNyywAzULSS43fkeWwvZQALG/ycomWTq5+CNek+zI7O5w/YSmEML3e75cwa1okH58zxp1qA9tIBBPEddcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T00:22:31.914618Z"},"content_sha256":"2b32c4f436dcc1ec524b531195229061fc045e86c5873453867aaf2179a795a7","schema_version":"1.0","event_id":"sha256:2b32c4f436dcc1ec524b531195229061fc045e86c5873453867aaf2179a795a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4XXEA6AIZUAOK6L5AR4QJQ5SG/bundle.json","state_url":"https://pith.science/pith/Q4XXEA6AIZUAOK6L5AR4QJQ5SG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4XXEA6AIZUAOK6L5AR4QJQ5SG/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-07-02T00:22:31Z","links":{"resolver":"https://pith.science/pith/Q4XXEA6AIZUAOK6L5AR4QJQ5SG","bundle":"https://pith.science/pith/Q4XXEA6AIZUAOK6L5AR4QJQ5SG/bundle.json","state":"https://pith.science/pith/Q4XXEA6AIZUAOK6L5AR4QJQ5SG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4XXEA6AIZUAOK6L5AR4QJQ5SG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Q4XXEA6AIZUAOK6L5AR4QJQ5SG","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":"a727637b68e3849d4a72be9eaa0f7b317d526a217e3897124fc4ca1a3c88a82e","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-16T08:16:23Z","title_canon_sha256":"13dfcea7b0a74c2b19f276250a30d59b92038984c40616711a8037762985e2cd"},"schema_version":"1.0","source":{"id":"1210.4289","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4289","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4289v3","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4289","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"Q4XXEA6AIZUA","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"Q4XXEA6AIZUAOK6L","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"Q4XXEA6A","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:2b32c4f436dcc1ec524b531195229061fc045e86c5873453867aaf2179a795a7","target":"graph","created_at":"2026-05-18T01:01:34Z","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":"We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approach is that the non-recursive program we compute may capture unboundedly many behaviors of the original recursive program for which stack usage cannot be bounded. Moreover, we identify a class of recursive programs on which our method terminates and returns the precise summary relations without underapproximation. Doing so, we generalize a similar result for non-recursive programs to the recursive case. Finally, we pre","authors_text":"Filip Konecny, Pierre Ganty, Radu Iosif","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-16T08:16:23Z","title":"Underapproximation of Procedure Summaries for Integer Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4289","kind":"arxiv","version":3},"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:31e765f7c61ac0acb087b95fb5072361b2364244ec1e6eb770f587ff7859cdcc","target":"record","created_at":"2026-05-18T01:01:34Z","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":"a727637b68e3849d4a72be9eaa0f7b317d526a217e3897124fc4ca1a3c88a82e","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-16T08:16:23Z","title_canon_sha256":"13dfcea7b0a74c2b19f276250a30d59b92038984c40616711a8037762985e2cd"},"schema_version":"1.0","source":{"id":"1210.4289","kind":"arxiv","version":3}},"canonical_sha256":"872f7203c04668072bcbe823c8261d91a45c469ae67a194e774b676be3ffa9e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"872f7203c04668072bcbe823c8261d91a45c469ae67a194e774b676be3ffa9e1","first_computed_at":"2026-05-18T01:01:34.852769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:34.852769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wi++MW4/5Q1xLLVWOPURObgbBHzZOyB8JaBrO10ElnkH6BWi0j284+FH/18BQiPRZPsqIupq1LMkzl6kjZgpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:34.853244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4289","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31e765f7c61ac0acb087b95fb5072361b2364244ec1e6eb770f587ff7859cdcc","sha256:2b32c4f436dcc1ec524b531195229061fc045e86c5873453867aaf2179a795a7"],"state_sha256":"34ac3f342d80b7543f933c5679b3d14dc10c0722c2b2547e4ad1e76df7753c40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLw1UBjkoILXrJg6QItVKig/lFUgwbgMt4m7z5YZ8r6javOAMEtWrs3Aw63Pq/Tp2auOU2m/vG0GnjhSCEIiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T00:22:31.916792Z","bundle_sha256":"369eda1c44c8774c3cc0cd731210139def775e43a0adcf4e012a22f0c85df0bd"}}