{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EZUQ4JBBZNBZ7RDDFYKK5S45YF","short_pith_number":"pith:EZUQ4JBB","canonical_record":{"source":{"id":"1508.07275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-08-28T16:52:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8d909d0b8322e9d026333c78036801823b6b81db5e91c07f0e0e0540c4937b2a","abstract_canon_sha256":"ab93956f4afde0864480c587528f4239fe01afd716174ad1263010b5588de814"},"schema_version":"1.0"},"canonical_sha256":"26690e2421cb439fc4632e14aecb9dc140b82b0d5d9be56e0640d7a5a68b8c95","source":{"kind":"arxiv","id":"1508.07275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07275","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07275v1","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07275","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"EZUQ4JBBZNBZ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EZUQ4JBBZNBZ7RDD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EZUQ4JBB","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EZUQ4JBBZNBZ7RDDFYKK5S45YF","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-08-28T16:52:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8d909d0b8322e9d026333c78036801823b6b81db5e91c07f0e0e0540c4937b2a","abstract_canon_sha256":"ab93956f4afde0864480c587528f4239fe01afd716174ad1263010b5588de814"},"schema_version":"1.0"},"canonical_sha256":"26690e2421cb439fc4632e14aecb9dc140b82b0d5d9be56e0640d7a5a68b8c95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:36.461615Z","signature_b64":"bcqo8fLiiu5MjZhX3xfWNKwbNAIp0dAgGViNTsSxfsQslpxT9S5MPY1zH9bsGSX76lh6OHlpW49gvNG2b6LIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26690e2421cb439fc4632e14aecb9dc140b82b0d5d9be56e0640d7a5a68b8c95","last_reissued_at":"2026-05-18T01:34:36.460941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:36.460941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07275","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-18T01:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lekAvumBse5KuhJUlbKnbBnn07669H+2rk7FdB+bnuTM0XR7nsqvV+7h5tXSyjl4RpYvfr1AWrKINeLqcdDECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:34:19.296146Z"},"content_sha256":"f93ab4b786e5f43be818f5204fdf79bf9d3987117dc5f9694a590a5dfde63749","schema_version":"1.0","event_id":"sha256:f93ab4b786e5f43be818f5204fdf79bf9d3987117dc5f9694a590a5dfde63749"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EZUQ4JBBZNBZ7RDDFYKK5S45YF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Comparison Between Decision Trees and Decision Tree Forest Models for Software Development Effort Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Ali Bou Nassif, Danny Ho, Luiz Fernando Capretz, Mohammad Azzeh","submitted_at":"2015-08-28T16:52:21Z","abstract_excerpt":"Accurate software effort estimation has been a challenge for many software practitioners and project managers. Underestimation leads to disruption in the projects estimated cost and delivery. On the other hand, overestimation causes outbidding and financial losses in business. Many software estimation models exist; however, none have been proven to be the best in all situations. In this paper, a decision tree forest (DTF) model is compared to a traditional decision tree (DT) model, as well as a multiple linear regression model (MLR). The evaluation was conducted using ISBSG and Desharnais indu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07275","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-18T01:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G26q8YI3cNdaju9otDH999SwFzWkSda3jVlP+/zdUS2LtzTMbrcfI30PwAp1PdmR6JGJ/glJG3NFtBvkoNrwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:34:19.296596Z"},"content_sha256":"31037c0d96b19a26f5f3a1a0e70f54e33d1e29270ff211b36a9095e5d5fea4a5","schema_version":"1.0","event_id":"sha256:31037c0d96b19a26f5f3a1a0e70f54e33d1e29270ff211b36a9095e5d5fea4a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZUQ4JBBZNBZ7RDDFYKK5S45YF/bundle.json","state_url":"https://pith.science/pith/EZUQ4JBBZNBZ7RDDFYKK5S45YF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZUQ4JBBZNBZ7RDDFYKK5S45YF/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-06-07T13:34:19Z","links":{"resolver":"https://pith.science/pith/EZUQ4JBBZNBZ7RDDFYKK5S45YF","bundle":"https://pith.science/pith/EZUQ4JBBZNBZ7RDDFYKK5S45YF/bundle.json","state":"https://pith.science/pith/EZUQ4JBBZNBZ7RDDFYKK5S45YF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZUQ4JBBZNBZ7RDDFYKK5S45YF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EZUQ4JBBZNBZ7RDDFYKK5S45YF","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":"ab93956f4afde0864480c587528f4239fe01afd716174ad1263010b5588de814","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-08-28T16:52:21Z","title_canon_sha256":"8d909d0b8322e9d026333c78036801823b6b81db5e91c07f0e0e0540c4937b2a"},"schema_version":"1.0","source":{"id":"1508.07275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07275","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07275v1","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07275","created_at":"2026-05-18T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"EZUQ4JBBZNBZ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EZUQ4JBBZNBZ7RDD","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EZUQ4JBB","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:31037c0d96b19a26f5f3a1a0e70f54e33d1e29270ff211b36a9095e5d5fea4a5","target":"graph","created_at":"2026-05-18T01:34:36Z","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":"Accurate software effort estimation has been a challenge for many software practitioners and project managers. Underestimation leads to disruption in the projects estimated cost and delivery. On the other hand, overestimation causes outbidding and financial losses in business. Many software estimation models exist; however, none have been proven to be the best in all situations. In this paper, a decision tree forest (DTF) model is compared to a traditional decision tree (DT) model, as well as a multiple linear regression model (MLR). The evaluation was conducted using ISBSG and Desharnais indu","authors_text":"Ali Bou Nassif, Danny Ho, Luiz Fernando Capretz, Mohammad Azzeh","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-08-28T16:52:21Z","title":"A Comparison Between Decision Trees and Decision Tree Forest Models for Software Development Effort Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07275","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:f93ab4b786e5f43be818f5204fdf79bf9d3987117dc5f9694a590a5dfde63749","target":"record","created_at":"2026-05-18T01:34:36Z","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":"ab93956f4afde0864480c587528f4239fe01afd716174ad1263010b5588de814","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-08-28T16:52:21Z","title_canon_sha256":"8d909d0b8322e9d026333c78036801823b6b81db5e91c07f0e0e0540c4937b2a"},"schema_version":"1.0","source":{"id":"1508.07275","kind":"arxiv","version":1}},"canonical_sha256":"26690e2421cb439fc4632e14aecb9dc140b82b0d5d9be56e0640d7a5a68b8c95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26690e2421cb439fc4632e14aecb9dc140b82b0d5d9be56e0640d7a5a68b8c95","first_computed_at":"2026-05-18T01:34:36.460941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:36.460941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bcqo8fLiiu5MjZhX3xfWNKwbNAIp0dAgGViNTsSxfsQslpxT9S5MPY1zH9bsGSX76lh6OHlpW49gvNG2b6LIBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:36.461615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f93ab4b786e5f43be818f5204fdf79bf9d3987117dc5f9694a590a5dfde63749","sha256:31037c0d96b19a26f5f3a1a0e70f54e33d1e29270ff211b36a9095e5d5fea4a5"],"state_sha256":"46d9c59a0c097941eb4350a775215dca71f0d94d91ebf1af32143ad950c6569f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSW3ZBXAOIOGeu9aI/k/Tvj5NuzCiMZV0SBiTTUIrGo384W5etxsLuLjJrjhu241k1DEEpSYBZ0tIsh8N5xOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T13:34:19.299466Z","bundle_sha256":"6c96fec128c661dbfa7bebfd6ca6269d3c2d8589c7aee3e89b7c8f9f2e4a0b8c"}}