{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ITNCQNEEO4CNP4S325OYRTCX3N","short_pith_number":"pith:ITNCQNEE","schema_version":"1.0","canonical_sha256":"44da2834847704d7f25bd75d88cc57db5b14414ed5880a67fbb1604c0eb7853e","source":{"kind":"arxiv","id":"1902.05808","version":1},"attestation_state":"computed","paper":{"title":"A Comparison of Random Task Graph Generation Methods for Scheduling Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille H\\'eam","submitted_at":"2019-02-15T13:43:31Z","abstract_excerpt":"How to generate instances with relevant properties and without bias remains an open problem of critical importance for a fair comparison of heuristics. In the context of scheduling with precedence constraints, the instance consists of a task graph that determines a partial order on task executions. To avoid selecting instances among a set populated mainly with trivial ones, we rely on properties that quantify the characteristics specific to difficult instances. Among numerous identified such properties, the mass measures how much a task graph can be decomposed into smaller ones. This property,"},"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":"1902.05808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-15T13:43:31Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"459cbf4bc1749c80477d965b5dd818a0adcada86dd504da5b103a6e14810d50b","abstract_canon_sha256":"9d525b6bfe6b26b63806cb84c7c718b48aa049b07edfc0b89fd7fb6ecdf0f994"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:56.065578Z","signature_b64":"3kJYj7GFaYAgbnfyzkES9kU1YpgBXHT0NY0RI1eFsX6eK93e4uD40pVn1PDFYxje2FauUtzsLhBwuhKYpswsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44da2834847704d7f25bd75d88cc57db5b14414ed5880a67fbb1604c0eb7853e","last_reissued_at":"2026-05-17T23:53:56.064885Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:56.064885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison of Random Task Graph Generation Methods for Scheduling Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille H\\'eam","submitted_at":"2019-02-15T13:43:31Z","abstract_excerpt":"How to generate instances with relevant properties and without bias remains an open problem of critical importance for a fair comparison of heuristics. In the context of scheduling with precedence constraints, the instance consists of a task graph that determines a partial order on task executions. To avoid selecting instances among a set populated mainly with trivial ones, we rely on properties that quantify the characteristics specific to difficult instances. Among numerous identified such properties, the mass measures how much a task graph can be decomposed into smaller ones. This property,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05808","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":"1902.05808","created_at":"2026-05-17T23:53:56.064987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05808v1","created_at":"2026-05-17T23:53:56.064987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05808","created_at":"2026-05-17T23:53:56.064987+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITNCQNEEO4CN","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITNCQNEEO4CNP4S3","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITNCQNEE","created_at":"2026-05-18T12:33:18.533446+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/ITNCQNEEO4CNP4S325OYRTCX3N","json":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N.json","graph_json":"https://pith.science/api/pith-number/ITNCQNEEO4CNP4S325OYRTCX3N/graph.json","events_json":"https://pith.science/api/pith-number/ITNCQNEEO4CNP4S325OYRTCX3N/events.json","paper":"https://pith.science/paper/ITNCQNEE"},"agent_actions":{"view_html":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N","download_json":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N.json","view_paper":"https://pith.science/paper/ITNCQNEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05808&json=true","fetch_graph":"https://pith.science/api/pith-number/ITNCQNEEO4CNP4S325OYRTCX3N/graph.json","fetch_events":"https://pith.science/api/pith-number/ITNCQNEEO4CNP4S325OYRTCX3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/action/storage_attestation","attest_author":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/action/author_attestation","sign_citation":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/action/citation_signature","submit_replication":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/action/replication_record"}},"created_at":"2026-05-17T23:53:56.064987+00:00","updated_at":"2026-05-17T23:53:56.064987+00:00"}