{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ITNCQNEEO4CNP4S325OYRTCX3N","short_pith_number":"pith:ITNCQNEE","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"},"canonical_sha256":"44da2834847704d7f25bd75d88cc57db5b14414ed5880a67fbb1604c0eb7853e","source":{"kind":"arxiv","id":"1902.05808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05808","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05808v1","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05808","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"ITNCQNEEO4CN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"ITNCQNEEO4CNP4S3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"ITNCQNEE","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ITNCQNEEO4CNP4S325OYRTCX3N","target":"record","payload":{"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"},"canonical_sha256":"44da2834847704d7f25bd75d88cc57db5b14414ed5880a67fbb1604c0eb7853e","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"},"source_kind":"arxiv","source_id":"1902.05808","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-17T23:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVw6BIq7f9GBo637/VCNSYWN2i4NAKRp9KXeeuzgpKjIz0DQ4187kqtN+WdduXUYNzYyyJz3VjHqM5Jy4aZmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:37:25.371990Z"},"content_sha256":"2752ec16a17d6ec164a3ab40af090dd4d5332ee84796350a12d0062a9656cb3c","schema_version":"1.0","event_id":"sha256:2752ec16a17d6ec164a3ab40af090dd4d5332ee84796350a12d0062a9656cb3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ITNCQNEEO4CNP4S325OYRTCX3N","target":"graph","payload":{"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"},"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-17T23:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fedsl7zHDzS771BKAErpsmlJoxzE7W3/B79WpM151pqOvSk2yBlBkNwCiEeRjqGxNtfBTDn3pgwRSaL5kzcGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:37:25.372492Z"},"content_sha256":"13dd947eb70a1da48415e3f36c8424efe14f01a7f20d3846b1d713308b3f09a6","schema_version":"1.0","event_id":"sha256:13dd947eb70a1da48415e3f36c8424efe14f01a7f20d3846b1d713308b3f09a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/bundle.json","state_url":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITNCQNEEO4CNP4S325OYRTCX3N/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-24T17:37:25Z","links":{"resolver":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N","bundle":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/bundle.json","state":"https://pith.science/pith/ITNCQNEEO4CNP4S325OYRTCX3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITNCQNEEO4CNP4S325OYRTCX3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ITNCQNEEO4CNP4S325OYRTCX3N","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":"9d525b6bfe6b26b63806cb84c7c718b48aa049b07edfc0b89fd7fb6ecdf0f994","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-15T13:43:31Z","title_canon_sha256":"459cbf4bc1749c80477d965b5dd818a0adcada86dd504da5b103a6e14810d50b"},"schema_version":"1.0","source":{"id":"1902.05808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05808","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05808v1","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05808","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"ITNCQNEEO4CN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"ITNCQNEEO4CNP4S3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"ITNCQNEE","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:13dd947eb70a1da48415e3f36c8424efe14f01a7f20d3846b1d713308b3f09a6","target":"graph","created_at":"2026-05-17T23:53:56Z","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":"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,","authors_text":"Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille H\\'eam","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-15T13:43:31Z","title":"A Comparison of Random Task Graph Generation Methods for Scheduling Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05808","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:2752ec16a17d6ec164a3ab40af090dd4d5332ee84796350a12d0062a9656cb3c","target":"record","created_at":"2026-05-17T23:53:56Z","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":"9d525b6bfe6b26b63806cb84c7c718b48aa049b07edfc0b89fd7fb6ecdf0f994","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-15T13:43:31Z","title_canon_sha256":"459cbf4bc1749c80477d965b5dd818a0adcada86dd504da5b103a6e14810d50b"},"schema_version":"1.0","source":{"id":"1902.05808","kind":"arxiv","version":1}},"canonical_sha256":"44da2834847704d7f25bd75d88cc57db5b14414ed5880a67fbb1604c0eb7853e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44da2834847704d7f25bd75d88cc57db5b14414ed5880a67fbb1604c0eb7853e","first_computed_at":"2026-05-17T23:53:56.064885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:56.064885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3kJYj7GFaYAgbnfyzkES9kU1YpgBXHT0NY0RI1eFsX6eK93e4uD40pVn1PDFYxje2FauUtzsLhBwuhKYpswsCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:56.065578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2752ec16a17d6ec164a3ab40af090dd4d5332ee84796350a12d0062a9656cb3c","sha256:13dd947eb70a1da48415e3f36c8424efe14f01a7f20d3846b1d713308b3f09a6"],"state_sha256":"5022ab4ca5eb5923f83c78fb0667246338b94f0224782e38fcb9b4a0ed90cfdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qULBNaaAorn9+V39tFrSz5kT/UwAJLveAfSgc59hexMRwBKVF+pBbjY3W8QXJ8yeQrK9IPW7GGDQGl9gdcv7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:37:25.375197Z","bundle_sha256":"7f9cee4e02ee6937bef4d7a87843d73c3b6a5bb2810caef33f15e91215c8a7e4"}}