{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2B5Z732K6ET7YHB5QQ6FDF5ZU5","short_pith_number":"pith:2B5Z732K","schema_version":"1.0","canonical_sha256":"d07b9fef4af127fc1c3d843c5197b9a7600c78a71ce7c1894601cb8c2f8fc563","source":{"kind":"arxiv","id":"1804.07793","version":1},"attestation_state":"computed","paper":{"title":"Assessing Combinatorial Design for Analyzing System Performance of a Computer Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amin S. Mohammad, Bestoun S. Ahmed, Hemin T. Essa","submitted_at":"2018-04-20T18:37:53Z","abstract_excerpt":"Generally, combinatorial design concerns with the arrangement of a finite set of elements into patterns (subsets, words, arrays) according to specified rules. The usefulness of this design method is that the number of input combination can be reduced dramatically but all of them are covered by the combinatorial set. This paper presents the application of this design method in communication networks. Communication engineers can use this novel method to generate test cases for producing a cost-effective set of experiments to recognize the factors that have the least and most impact on the system"},"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":"1804.07793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-04-20T18:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"ae12021ce4e439c65178106817e7064a975dc58fdc68b4d8f82a679c549321b3","abstract_canon_sha256":"b784f973f12f73bff56b28f7cefceba3a17f9c91303472876579a97db500d6e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:52.791644Z","signature_b64":"kdFbxm+edzbMWu6zvWHCz20oburhU6kW/HunmsjjzhARKmW+7HPuMpfsIutoLY4GkIeBYQh6ZKrzs43EzRs4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d07b9fef4af127fc1c3d843c5197b9a7600c78a71ce7c1894601cb8c2f8fc563","last_reissued_at":"2026-05-18T00:17:52.791004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:52.791004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assessing Combinatorial Design for Analyzing System Performance of a Computer Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amin S. Mohammad, Bestoun S. Ahmed, Hemin T. Essa","submitted_at":"2018-04-20T18:37:53Z","abstract_excerpt":"Generally, combinatorial design concerns with the arrangement of a finite set of elements into patterns (subsets, words, arrays) according to specified rules. The usefulness of this design method is that the number of input combination can be reduced dramatically but all of them are covered by the combinatorial set. This paper presents the application of this design method in communication networks. Communication engineers can use this novel method to generate test cases for producing a cost-effective set of experiments to recognize the factors that have the least and most impact on the system"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07793","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":"1804.07793","created_at":"2026-05-18T00:17:52.791090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07793v1","created_at":"2026-05-18T00:17:52.791090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07793","created_at":"2026-05-18T00:17:52.791090+00:00"},{"alias_kind":"pith_short_12","alias_value":"2B5Z732K6ET7","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2B5Z732K6ET7YHB5","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2B5Z732K","created_at":"2026-05-18T12:31:59.375834+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/2B5Z732K6ET7YHB5QQ6FDF5ZU5","json":"https://pith.science/pith/2B5Z732K6ET7YHB5QQ6FDF5ZU5.json","graph_json":"https://pith.science/api/pith-number/2B5Z732K6ET7YHB5QQ6FDF5ZU5/graph.json","events_json":"https://pith.science/api/pith-number/2B5Z732K6ET7YHB5QQ6FDF5ZU5/events.json","paper":"https://pith.science/paper/2B5Z732K"},"agent_actions":{"view_html":"https://pith.science/pith/2B5Z732K6ET7YHB5QQ6FDF5ZU5","download_json":"https://pith.science/pith/2B5Z732K6ET7YHB5QQ6FDF5ZU5.json","view_paper":"https://pith.science/paper/2B5Z732K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07793&json=true","fetch_graph":"https://pith.science/api/pith-number/2B5Z732K6ET7YHB5QQ6FDF5ZU5/graph.json","fetch_events":"https://pith.science/api/pith-number/2B5Z732K6ET7YHB5QQ6FDF5ZU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2B5Z732K6ET7YHB5QQ6FDF5ZU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2B5Z732K6ET7YHB5QQ6FDF5ZU5/action/storage_attestation","attest_author":"https://pith.science/pith/2B5Z732K6ET7YHB5QQ6FDF5ZU5/action/author_attestation","sign_citation":"https://pith.science/pith/2B5Z732K6ET7YHB5QQ6FDF5ZU5/action/citation_signature","submit_replication":"https://pith.science/pith/2B5Z732K6ET7YHB5QQ6FDF5ZU5/action/replication_record"}},"created_at":"2026-05-18T00:17:52.791090+00:00","updated_at":"2026-05-18T00:17:52.791090+00:00"}