{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Q5I5P46V7EK44FXZ5N4CZMYMIM","short_pith_number":"pith:Q5I5P46V","schema_version":"1.0","canonical_sha256":"8751d7f3d5f915ce16f9eb782cb30c4318336c189893c1a5e4596231dafd1c6d","source":{"kind":"arxiv","id":"1306.6526","version":4},"attestation_state":"computed","paper":{"title":"Inference of Field-Sensitive Reachability and Cyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Damiano Zanardini, Samir Genaim","submitted_at":"2013-06-27T14:48:27Z","abstract_excerpt":"In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the structure pointed to by x.fld, and allows bounding the number of iterations of a loop which traverses the data structure on fld. In general, proving termination needs acyclicity, unless program-specific or non-automated reasoning is performed. However, recent work could prove that certain loops terminate even without inferring acyclicity, because they traver"},"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":"1306.6526","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-06-27T14:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"861fbb80f46d87fda4c4145394bb5de78880218cc8ad20c333820d212ad2ade9","abstract_canon_sha256":"044083a5c33b8ee1c42df8114d65971847547bd7ede4c948f5960ec33cc18b6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:42.266066Z","signature_b64":"Jfyu72A5KRbCC2ILrDQQLMdQn7XcmDp0T9J4aP1wy7hUv99AsxT5aznXwppV1UeCEj0kIKJPEOQd5Z9CVcF9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8751d7f3d5f915ce16f9eb782cb30c4318336c189893c1a5e4596231dafd1c6d","last_reissued_at":"2026-05-18T02:51:42.265458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:42.265458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference of Field-Sensitive Reachability and Cyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Damiano Zanardini, Samir Genaim","submitted_at":"2013-06-27T14:48:27Z","abstract_excerpt":"In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the structure pointed to by x.fld, and allows bounding the number of iterations of a loop which traverses the data structure on fld. In general, proving termination needs acyclicity, unless program-specific or non-automated reasoning is performed. However, recent work could prove that certain loops terminate even without inferring acyclicity, because they traver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6526","kind":"arxiv","version":4},"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":"1306.6526","created_at":"2026-05-18T02:51:42.265548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6526v4","created_at":"2026-05-18T02:51:42.265548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6526","created_at":"2026-05-18T02:51:42.265548+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5I5P46V7EK4","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5I5P46V7EK44FXZ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5I5P46V","created_at":"2026-05-18T12:27:57.521954+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/Q5I5P46V7EK44FXZ5N4CZMYMIM","json":"https://pith.science/pith/Q5I5P46V7EK44FXZ5N4CZMYMIM.json","graph_json":"https://pith.science/api/pith-number/Q5I5P46V7EK44FXZ5N4CZMYMIM/graph.json","events_json":"https://pith.science/api/pith-number/Q5I5P46V7EK44FXZ5N4CZMYMIM/events.json","paper":"https://pith.science/paper/Q5I5P46V"},"agent_actions":{"view_html":"https://pith.science/pith/Q5I5P46V7EK44FXZ5N4CZMYMIM","download_json":"https://pith.science/pith/Q5I5P46V7EK44FXZ5N4CZMYMIM.json","view_paper":"https://pith.science/paper/Q5I5P46V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6526&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5I5P46V7EK44FXZ5N4CZMYMIM/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5I5P46V7EK44FXZ5N4CZMYMIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5I5P46V7EK44FXZ5N4CZMYMIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5I5P46V7EK44FXZ5N4CZMYMIM/action/storage_attestation","attest_author":"https://pith.science/pith/Q5I5P46V7EK44FXZ5N4CZMYMIM/action/author_attestation","sign_citation":"https://pith.science/pith/Q5I5P46V7EK44FXZ5N4CZMYMIM/action/citation_signature","submit_replication":"https://pith.science/pith/Q5I5P46V7EK44FXZ5N4CZMYMIM/action/replication_record"}},"created_at":"2026-05-18T02:51:42.265548+00:00","updated_at":"2026-05-18T02:51:42.265548+00:00"}