{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:TND4DY4CZZKTBSWZHU3AUD7LM6","short_pith_number":"pith:TND4DY4C","canonical_record":{"source":{"id":"0706.2293","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2007-06-15T13:39:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"c17194753c268292df3059cf87728fba65a1294cdbe6bead2520d7938110502a","abstract_canon_sha256":"baef07916cd4c8dbe74cf703501f9e6fac75691258c17ea055f5ec60b14d2e81"},"schema_version":"1.0"},"canonical_sha256":"9b47c1e382ce5530cad93d360a0feb678b3001f70d2c740150401b45e300b5c6","source":{"kind":"arxiv","id":"0706.2293","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.2293","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"0706.2293v1","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.2293","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"TND4DY4CZZKT","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"TND4DY4CZZKTBSWZ","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"TND4DY4C","created_at":"2026-07-04T15:02:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:TND4DY4CZZKTBSWZHU3AUD7LM6","target":"record","payload":{"canonical_record":{"source":{"id":"0706.2293","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.PL","submitted_at":"2007-06-15T13:39:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"c17194753c268292df3059cf87728fba65a1294cdbe6bead2520d7938110502a","abstract_canon_sha256":"baef07916cd4c8dbe74cf703501f9e6fac75691258c17ea055f5ec60b14d2e81"},"schema_version":"1.0"},"canonical_sha256":"9b47c1e382ce5530cad93d360a0feb678b3001f70d2c740150401b45e300b5c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:16.043616Z","signature_b64":"5zgi0Py/EQ47g/sPEWEfMLZPZ5WjMjvrCLnDmlRsIKSOQWKbHk+VK9yubg7OdgE8uERDoCWrCghoBbYOh9E2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b47c1e382ce5530cad93d360a0feb678b3001f70d2c740150401b45e300b5c6","last_reissued_at":"2026-07-04T15:02:16.043249Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:16.043249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0706.2293","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-07-04T15:02:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZj+QvJOqr+wgGnvdL3YrtBDrixYhKJrNJ4REGoHYoxZFwwT3yquTk4ZcSMal/AAUo+wQFhnlSB1bjVMGNDSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:27:01.913505Z"},"content_sha256":"33b8c8b50bbf5216e5a609c35a7143e08e64301c9c39067bab1cf5ee2e3bba71","schema_version":"1.0","event_id":"sha256:33b8c8b50bbf5216e5a609c35a7143e08e64301c9c39067bab1cf5ee2e3bba71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:TND4DY4CZZKTBSWZHU3AUD7LM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource control of object-oriented programs","license":"","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Jean-Yves Marion, Romain Pechoux","submitted_at":"2007-06-15T13:39:12Z","abstract_excerpt":"A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Sup-interpretations have shown their interest to deal with the complexity of first order functional programs. For instance, they allow to characterize all the functions bitwise computable in Alogtime. This paper is an attempt to adapt the framework of sup-interpretations to a fragment of oriented-object programs, including distinct encodings of numbers through the use of constructor symbols, loop and while constructs and non recursive methods with side effects. We give a cr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.2293","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0706.2293/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:02:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XmxyLURYeyZB+5NL4xP2ye6+gXlBpXXQMbu9v50EIsVsPcWYoi6EXN5YysxPR5FpYqh/BIlGivDhdi1FEXk2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:27:01.914002Z"},"content_sha256":"394d4c7b468dd68e882a44156f34d2cf4f534c9f666ae70f139ef24ca3c38fa2","schema_version":"1.0","event_id":"sha256:394d4c7b468dd68e882a44156f34d2cf4f534c9f666ae70f139ef24ca3c38fa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TND4DY4CZZKTBSWZHU3AUD7LM6/bundle.json","state_url":"https://pith.science/pith/TND4DY4CZZKTBSWZHU3AUD7LM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TND4DY4CZZKTBSWZHU3AUD7LM6/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-08-11T15:27:01Z","links":{"resolver":"https://pith.science/pith/TND4DY4CZZKTBSWZHU3AUD7LM6","bundle":"https://pith.science/pith/TND4DY4CZZKTBSWZHU3AUD7LM6/bundle.json","state":"https://pith.science/pith/TND4DY4CZZKTBSWZHU3AUD7LM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TND4DY4CZZKTBSWZHU3AUD7LM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:TND4DY4CZZKTBSWZHU3AUD7LM6","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":"baef07916cd4c8dbe74cf703501f9e6fac75691258c17ea055f5ec60b14d2e81","cross_cats_sorted":["cs.LO"],"license":"","primary_cat":"cs.PL","submitted_at":"2007-06-15T13:39:12Z","title_canon_sha256":"c17194753c268292df3059cf87728fba65a1294cdbe6bead2520d7938110502a"},"schema_version":"1.0","source":{"id":"0706.2293","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.2293","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"arxiv_version","alias_value":"0706.2293v1","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.2293","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"pith_short_12","alias_value":"TND4DY4CZZKT","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"pith_short_16","alias_value":"TND4DY4CZZKTBSWZ","created_at":"2026-07-04T15:02:16Z"},{"alias_kind":"pith_short_8","alias_value":"TND4DY4C","created_at":"2026-07-04T15:02:16Z"}],"graph_snapshots":[{"event_id":"sha256:394d4c7b468dd68e882a44156f34d2cf4f534c9f666ae70f139ef24ca3c38fa2","target":"graph","created_at":"2026-07-04T15:02:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0706.2293/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Sup-interpretations have shown their interest to deal with the complexity of first order functional programs. For instance, they allow to characterize all the functions bitwise computable in Alogtime. This paper is an attempt to adapt the framework of sup-interpretations to a fragment of oriented-object programs, including distinct encodings of numbers through the use of constructor symbols, loop and while constructs and non recursive methods with side effects. We give a cr","authors_text":"Jean-Yves Marion, Romain Pechoux","cross_cats":["cs.LO"],"headline":"","license":"","primary_cat":"cs.PL","submitted_at":"2007-06-15T13:39:12Z","title":"Resource control of object-oriented programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.2293","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:33b8c8b50bbf5216e5a609c35a7143e08e64301c9c39067bab1cf5ee2e3bba71","target":"record","created_at":"2026-07-04T15:02:16Z","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":"baef07916cd4c8dbe74cf703501f9e6fac75691258c17ea055f5ec60b14d2e81","cross_cats_sorted":["cs.LO"],"license":"","primary_cat":"cs.PL","submitted_at":"2007-06-15T13:39:12Z","title_canon_sha256":"c17194753c268292df3059cf87728fba65a1294cdbe6bead2520d7938110502a"},"schema_version":"1.0","source":{"id":"0706.2293","kind":"arxiv","version":1}},"canonical_sha256":"9b47c1e382ce5530cad93d360a0feb678b3001f70d2c740150401b45e300b5c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b47c1e382ce5530cad93d360a0feb678b3001f70d2c740150401b45e300b5c6","first_computed_at":"2026-07-04T15:02:16.043249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:16.043249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5zgi0Py/EQ47g/sPEWEfMLZPZ5WjMjvrCLnDmlRsIKSOQWKbHk+VK9yubg7OdgE8uERDoCWrCghoBbYOh9E2Cw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:16.043616Z","signed_message":"canonical_sha256_bytes"},"source_id":"0706.2293","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33b8c8b50bbf5216e5a609c35a7143e08e64301c9c39067bab1cf5ee2e3bba71","sha256:394d4c7b468dd68e882a44156f34d2cf4f534c9f666ae70f139ef24ca3c38fa2"],"state_sha256":"47ef4d60bc0cc6c650ddad6c842f50b35be08f6b186eed221045d604dadad050"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WWXDERQZT1TXwZZBTWIJoa2PSP8HXRPpqM0/MfI4iGdBMC3rdtt6Z2sivqnZszX6HmGVk1CP9vt3yBMjgpeRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T15:27:01.918800Z","bundle_sha256":"fbc763a9479eeb496c7361f329fd16d1962d95a07434b88a080f85db996ae744"}}