{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZPPICSBD35A25XZN427VLQQGNB","short_pith_number":"pith:ZPPICSBD","schema_version":"1.0","canonical_sha256":"cbde814823df41aedf2de6bf55c206685c25360984b581f5082368566a7f1c5c","source":{"kind":"arxiv","id":"1412.3729","version":1},"attestation_state":"computed","paper":{"title":"Non-termination of Dalvik bytecode via compilation to CLP","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Etienne Payet, Fred Mesnard","submitted_at":"2014-12-10T12:20:13Z","abstract_excerpt":"We present a set of rules for compiling a Dalvik bytecode program into a logic program with array constraints. Non-termination of the resulting program entails that of the original one, hence the techniques we have presented before for proving non-termination of constraint logic programs can be used for proving non-termination of Dalvik programs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.3729","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.PL","submitted_at":"2014-12-10T12:20:13Z","cross_cats_sorted":[],"title_canon_sha256":"01e9fa1406932cf3c72d41dc7ba15e76715856217e3f6e56260e23123684eb8b","abstract_canon_sha256":"52a82003e568e5e024a375a22090ee2cc2c817bd01f828f81e0748e55db6f50d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:30.451222Z","signature_b64":"ZtbcQi1THkXN6iXONO2EHXdEUg5GcleoXt4LMP7vRgG71VZnfgJsoHe6xT7jiEVWyTc4CBqULBT3dNHpn4CkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbde814823df41aedf2de6bf55c206685c25360984b581f5082368566a7f1c5c","last_reissued_at":"2026-05-18T02:31:30.450839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:30.450839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-termination of Dalvik bytecode via compilation to CLP","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Etienne Payet, Fred Mesnard","submitted_at":"2014-12-10T12:20:13Z","abstract_excerpt":"We present a set of rules for compiling a Dalvik bytecode program into a logic program with array constraints. Non-termination of the resulting program entails that of the original one, hence the techniques we have presented before for proving non-termination of constraint logic programs can be used for proving non-termination of Dalvik programs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3729","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.3729","created_at":"2026-05-18T02:31:30.450906+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3729v1","created_at":"2026-05-18T02:31:30.450906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3729","created_at":"2026-05-18T02:31:30.450906+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPPICSBD35A2","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPPICSBD35A25XZN","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPPICSBD","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB","json":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB.json","graph_json":"https://pith.science/api/pith-number/ZPPICSBD35A25XZN427VLQQGNB/graph.json","events_json":"https://pith.science/api/pith-number/ZPPICSBD35A25XZN427VLQQGNB/events.json","paper":"https://pith.science/paper/ZPPICSBD"},"agent_actions":{"view_html":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB","download_json":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB.json","view_paper":"https://pith.science/paper/ZPPICSBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3729&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPPICSBD35A25XZN427VLQQGNB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPPICSBD35A25XZN427VLQQGNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB/action/storage_attestation","attest_author":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB/action/author_attestation","sign_citation":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB/action/citation_signature","submit_replication":"https://pith.science/pith/ZPPICSBD35A25XZN427VLQQGNB/action/replication_record"}},"created_at":"2026-05-18T02:31:30.450906+00:00","updated_at":"2026-05-18T02:31:30.450906+00:00"}