{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5OQQNCZOAKENG322NHMLNVKVW5","short_pith_number":"pith:5OQQNCZO","schema_version":"1.0","canonical_sha256":"eba1068b2e0288d36f5a69d8b6d555b7563e834596d4c82a17f8f0258634ad55","source":{"kind":"arxiv","id":"1408.5514","version":1},"attestation_state":"computed","paper":{"title":"Bounds for D-finite closure properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.SC","authors_text":"Manuel Kauers","submitted_at":"2014-08-23T16:56:26Z","abstract_excerpt":"We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree bounds that are parameterized with respect to the order and reflect the phenomenon that higher order operators may have lower degrees (order-degree curves)."},"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":"1408.5514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-08-23T16:56:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b89f57c1d29a474bc289533a369aae4b207c66587b1101c941127253ed6093c3","abstract_canon_sha256":"977ef41f25da4cacbfeef215ad03d52559bee9dad1f2a0de119a7d47b385c285"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:24.974958Z","signature_b64":"XZvb0b+GXFmAPqiJXGz3HgVYewcZmHlBDFm+9xmb5xF/oGwR3zRl+Jxy62qzPLQqdu9DtKdG1fhHZq0PJw7rBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eba1068b2e0288d36f5a69d8b6d555b7563e834596d4c82a17f8f0258634ad55","last_reissued_at":"2026-05-18T02:44:24.974549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:24.974549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for D-finite closure properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.SC","authors_text":"Manuel Kauers","submitted_at":"2014-08-23T16:56:26Z","abstract_excerpt":"We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree bounds that are parameterized with respect to the order and reflect the phenomenon that higher order operators may have lower degrees (order-degree curves)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5514","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":"1408.5514","created_at":"2026-05-18T02:44:24.974612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5514v1","created_at":"2026-05-18T02:44:24.974612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5514","created_at":"2026-05-18T02:44:24.974612+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OQQNCZOAKEN","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OQQNCZOAKENG322","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OQQNCZO","created_at":"2026-05-18T12:28:14.216126+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/5OQQNCZOAKENG322NHMLNVKVW5","json":"https://pith.science/pith/5OQQNCZOAKENG322NHMLNVKVW5.json","graph_json":"https://pith.science/api/pith-number/5OQQNCZOAKENG322NHMLNVKVW5/graph.json","events_json":"https://pith.science/api/pith-number/5OQQNCZOAKENG322NHMLNVKVW5/events.json","paper":"https://pith.science/paper/5OQQNCZO"},"agent_actions":{"view_html":"https://pith.science/pith/5OQQNCZOAKENG322NHMLNVKVW5","download_json":"https://pith.science/pith/5OQQNCZOAKENG322NHMLNVKVW5.json","view_paper":"https://pith.science/paper/5OQQNCZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5514&json=true","fetch_graph":"https://pith.science/api/pith-number/5OQQNCZOAKENG322NHMLNVKVW5/graph.json","fetch_events":"https://pith.science/api/pith-number/5OQQNCZOAKENG322NHMLNVKVW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OQQNCZOAKENG322NHMLNVKVW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OQQNCZOAKENG322NHMLNVKVW5/action/storage_attestation","attest_author":"https://pith.science/pith/5OQQNCZOAKENG322NHMLNVKVW5/action/author_attestation","sign_citation":"https://pith.science/pith/5OQQNCZOAKENG322NHMLNVKVW5/action/citation_signature","submit_replication":"https://pith.science/pith/5OQQNCZOAKENG322NHMLNVKVW5/action/replication_record"}},"created_at":"2026-05-18T02:44:24.974612+00:00","updated_at":"2026-05-18T02:44:24.974612+00:00"}