{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FVN6AUJDABJGPMXA75YIMMF7KH","short_pith_number":"pith:FVN6AUJD","canonical_record":{"source":{"id":"1401.5292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-01-21T12:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"2ca3bf92d3f2bad526828c49eaf8d8654a69a17d3cb2411e2f829b69c70fd0d8","abstract_canon_sha256":"cd2cf04d7126d2cc3c727d8e91fc0c61235b4796d8aed6b3b39d5ec9974b753b"},"schema_version":"1.0"},"canonical_sha256":"2d5be05123005267b2e0ff708630bf51c4863fb334060d7e9d4988856a635877","source":{"kind":"arxiv","id":"1401.5292","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5292","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5292v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5292","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"FVN6AUJDABJG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FVN6AUJDABJGPMXA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FVN6AUJD","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FVN6AUJDABJGPMXA75YIMMF7KH","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-01-21T12:35:09Z","cross_cats_sorted":[],"title_canon_sha256":"2ca3bf92d3f2bad526828c49eaf8d8654a69a17d3cb2411e2f829b69c70fd0d8","abstract_canon_sha256":"cd2cf04d7126d2cc3c727d8e91fc0c61235b4796d8aed6b3b39d5ec9974b753b"},"schema_version":"1.0"},"canonical_sha256":"2d5be05123005267b2e0ff708630bf51c4863fb334060d7e9d4988856a635877","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.232381Z","signature_b64":"WKr96g842wAJbvCIjjWQlMjlNMuKjaype8H1n9uzMpJJpZALjvYK9SB8nH8Grjwl/mqc6LKwmHiNMl7QHYw9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d5be05123005267b2e0ff708630bf51c4863fb334060d7e9d4988856a635877","last_reissued_at":"2026-05-18T03:01:34.231482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.231482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5292","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: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":"YWXtq5ALP8/drR0QUTun6kv9sVNpE6B764kVhKnFIBX/JhRu+6zVMD0bFTtBa65yooXljeMbbFxWdogjJFLFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:57:58.371512Z"},"content_sha256":"c086dbc837c7b8c1b4478b4595ccbe54823eb2969e1863b25af7223020f09bcd","schema_version":"1.0","event_id":"sha256:c086dbc837c7b8c1b4478b4595ccbe54823eb2969e1863b25af7223020f09bcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FVN6AUJDABJGPMXA75YIMMF7KH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Termination Analysis of Java Bytecode","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"\\'Etienne Payet, Fausto Spoto, Fred Mesnard","submitted_at":"2014-01-21T12:35:09Z","abstract_excerpt":"We introduce a fully automated static analysis that takes a sequential Java bytecode program P as input and attempts to prove that there exists an infinite execution of P. The technique consists in compiling P into a constraint logic program P_CLP and in proving non-termination of P_CLP; when P consists of instructions that are exactly compiled into constraints, the non-termination of P_CLP entails that of P. Our approach can handle method calls; to the best of our knowledge, it is the first static approach for Java bytecode able to prove the existence of infinite recursions. We have implement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5292","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: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":"jdPWBb2M1GfahkduoKqczrpoyC7hcferC8xaGQwMz0ykV7nXo/P6tsQ2oqXuhUaiqgMpOiWb+G+tZqMkDMhWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:57:58.372166Z"},"content_sha256":"ad60d660983506c7c11113532e8219d526ac67f4c0dee63406741cebd4bcd516","schema_version":"1.0","event_id":"sha256:ad60d660983506c7c11113532e8219d526ac67f4c0dee63406741cebd4bcd516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVN6AUJDABJGPMXA75YIMMF7KH/bundle.json","state_url":"https://pith.science/pith/FVN6AUJDABJGPMXA75YIMMF7KH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVN6AUJDABJGPMXA75YIMMF7KH/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-31T09:57:58Z","links":{"resolver":"https://pith.science/pith/FVN6AUJDABJGPMXA75YIMMF7KH","bundle":"https://pith.science/pith/FVN6AUJDABJGPMXA75YIMMF7KH/bundle.json","state":"https://pith.science/pith/FVN6AUJDABJGPMXA75YIMMF7KH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVN6AUJDABJGPMXA75YIMMF7KH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FVN6AUJDABJGPMXA75YIMMF7KH","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":"cd2cf04d7126d2cc3c727d8e91fc0c61235b4796d8aed6b3b39d5ec9974b753b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-01-21T12:35:09Z","title_canon_sha256":"2ca3bf92d3f2bad526828c49eaf8d8654a69a17d3cb2411e2f829b69c70fd0d8"},"schema_version":"1.0","source":{"id":"1401.5292","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5292","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5292v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5292","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"FVN6AUJDABJG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FVN6AUJDABJGPMXA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FVN6AUJD","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:ad60d660983506c7c11113532e8219d526ac67f4c0dee63406741cebd4bcd516","target":"graph","created_at":"2026-05-18T03: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 introduce a fully automated static analysis that takes a sequential Java bytecode program P as input and attempts to prove that there exists an infinite execution of P. The technique consists in compiling P into a constraint logic program P_CLP and in proving non-termination of P_CLP; when P consists of instructions that are exactly compiled into constraints, the non-termination of P_CLP entails that of P. Our approach can handle method calls; to the best of our knowledge, it is the first static approach for Java bytecode able to prove the existence of infinite recursions. We have implement","authors_text":"\\'Etienne Payet, Fausto Spoto, Fred Mesnard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-01-21T12:35:09Z","title":"Non-Termination Analysis of Java Bytecode"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5292","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:c086dbc837c7b8c1b4478b4595ccbe54823eb2969e1863b25af7223020f09bcd","target":"record","created_at":"2026-05-18T03: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":"cd2cf04d7126d2cc3c727d8e91fc0c61235b4796d8aed6b3b39d5ec9974b753b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-01-21T12:35:09Z","title_canon_sha256":"2ca3bf92d3f2bad526828c49eaf8d8654a69a17d3cb2411e2f829b69c70fd0d8"},"schema_version":"1.0","source":{"id":"1401.5292","kind":"arxiv","version":1}},"canonical_sha256":"2d5be05123005267b2e0ff708630bf51c4863fb334060d7e9d4988856a635877","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d5be05123005267b2e0ff708630bf51c4863fb334060d7e9d4988856a635877","first_computed_at":"2026-05-18T03:01:34.231482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:34.231482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WKr96g842wAJbvCIjjWQlMjlNMuKjaype8H1n9uzMpJJpZALjvYK9SB8nH8Grjwl/mqc6LKwmHiNMl7QHYw9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:34.232381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5292","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c086dbc837c7b8c1b4478b4595ccbe54823eb2969e1863b25af7223020f09bcd","sha256:ad60d660983506c7c11113532e8219d526ac67f4c0dee63406741cebd4bcd516"],"state_sha256":"a6ee3b832f0ef8f9ce91281175985b37db958d7f461e5e116549b3f6e5b82f70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"teeA5PDZh9b5rLLhON7pygj4lvnwuK0h4sNRqlI982uy+AcMwIwR6jNSLeazKqIiBljNano8K3dVtnFU8q52Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:57:58.375780Z","bundle_sha256":"d1953ac0b7fa3f6bb1d217da53ad649691aa8a36cec760fb27897c60f2663781"}}