{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NE2IZ4INLBSQEFYWAA34YX2TR4","short_pith_number":"pith:NE2IZ4IN","schema_version":"1.0","canonical_sha256":"69348cf10d58650217160037cc5f538f3d4111e280c64e17512b12054ecabb4c","source":{"kind":"arxiv","id":"1806.09818","version":1},"attestation_state":"computed","paper":{"title":"Linear Tree Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Martin Hofmann, Sabine Bauer","submitted_at":"2018-06-26T07:16:06Z","abstract_excerpt":"Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus, once we have found an algorithm to solve the constraints generated from a program, we can read off the resource consumption from their solutions.\n  These constraints have the form of pointwise linear inequalities between infinite trees labeled with nonnegative rational numbers. We are interested in the question if a system of such constraints is simultaneou"},"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":"1806.09818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-26T07:16:06Z","cross_cats_sorted":[],"title_canon_sha256":"f4623ff39ee0293f3b2c2e7b9c0bac33274873d04465584fce30e503dcc2fee8","abstract_canon_sha256":"b5eb957ad95663ccd56df1fd4dd30c82c679b8bac9e8ef46ecf9cdee988141f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:23.261915Z","signature_b64":"6ktb9gXG6GoJlltUDJW7hz0CLA4AmcYYWsnZNQ5T9MwtSUMvzjE5QpUKj7fN2StyTC3yn/hEXMNEsD/URM5cDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69348cf10d58650217160037cc5f538f3d4111e280c64e17512b12054ecabb4c","last_reissued_at":"2026-05-18T00:12:23.261252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:23.261252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Tree Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Martin Hofmann, Sabine Bauer","submitted_at":"2018-06-26T07:16:06Z","abstract_excerpt":"Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus, once we have found an algorithm to solve the constraints generated from a program, we can read off the resource consumption from their solutions.\n  These constraints have the form of pointwise linear inequalities between infinite trees labeled with nonnegative rational numbers. We are interested in the question if a system of such constraints is simultaneou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09818","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":"1806.09818","created_at":"2026-05-18T00:12:23.261343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09818v1","created_at":"2026-05-18T00:12:23.261343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09818","created_at":"2026-05-18T00:12:23.261343+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE2IZ4INLBSQ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE2IZ4INLBSQEFYW","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE2IZ4IN","created_at":"2026-05-18T12:32:40.477152+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/NE2IZ4INLBSQEFYWAA34YX2TR4","json":"https://pith.science/pith/NE2IZ4INLBSQEFYWAA34YX2TR4.json","graph_json":"https://pith.science/api/pith-number/NE2IZ4INLBSQEFYWAA34YX2TR4/graph.json","events_json":"https://pith.science/api/pith-number/NE2IZ4INLBSQEFYWAA34YX2TR4/events.json","paper":"https://pith.science/paper/NE2IZ4IN"},"agent_actions":{"view_html":"https://pith.science/pith/NE2IZ4INLBSQEFYWAA34YX2TR4","download_json":"https://pith.science/pith/NE2IZ4INLBSQEFYWAA34YX2TR4.json","view_paper":"https://pith.science/paper/NE2IZ4IN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09818&json=true","fetch_graph":"https://pith.science/api/pith-number/NE2IZ4INLBSQEFYWAA34YX2TR4/graph.json","fetch_events":"https://pith.science/api/pith-number/NE2IZ4INLBSQEFYWAA34YX2TR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE2IZ4INLBSQEFYWAA34YX2TR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE2IZ4INLBSQEFYWAA34YX2TR4/action/storage_attestation","attest_author":"https://pith.science/pith/NE2IZ4INLBSQEFYWAA34YX2TR4/action/author_attestation","sign_citation":"https://pith.science/pith/NE2IZ4INLBSQEFYWAA34YX2TR4/action/citation_signature","submit_replication":"https://pith.science/pith/NE2IZ4INLBSQEFYWAA34YX2TR4/action/replication_record"}},"created_at":"2026-05-18T00:12:23.261343+00:00","updated_at":"2026-05-18T00:12:23.261343+00:00"}