{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XSO2U3HZDN37BTVRGE4RI3PIUL","short_pith_number":"pith:XSO2U3HZ","canonical_record":{"source":{"id":"2403.07120","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-11T19:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"1a84597d263747b8cc54ce54d088cea86d7fa91262b4686705d96ad64dbcef24","abstract_canon_sha256":"aed3075c8530845eafec33ce5563ebcead3c20ec3285b7be1f648f05fa1b2f51"},"schema_version":"1.0"},"canonical_sha256":"bc9daa6cf91b77f0ceb13139146de8a2d979509ce57f3c317d711772b0576c08","source":{"kind":"arxiv","id":"2403.07120","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.07120","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"arxiv_version","alias_value":"2403.07120v3","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07120","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"pith_short_12","alias_value":"XSO2U3HZDN37","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"pith_short_16","alias_value":"XSO2U3HZDN37BTVR","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"pith_short_8","alias_value":"XSO2U3HZ","created_at":"2026-07-05T10:51:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XSO2U3HZDN37BTVRGE4RI3PIUL","target":"record","payload":{"canonical_record":{"source":{"id":"2403.07120","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-11T19:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"1a84597d263747b8cc54ce54d088cea86d7fa91262b4686705d96ad64dbcef24","abstract_canon_sha256":"aed3075c8530845eafec33ce5563ebcead3c20ec3285b7be1f648f05fa1b2f51"},"schema_version":"1.0"},"canonical_sha256":"bc9daa6cf91b77f0ceb13139146de8a2d979509ce57f3c317d711772b0576c08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:20.720868Z","signature_b64":"futWPujke9b7gAVl2zN6+4zme43fF/QGs0IVTEGPfYesLCiNzLbRwzGOT9YX39Ot0E+2Ugq4Crw+IwxzncnXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc9daa6cf91b77f0ceb13139146de8a2d979509ce57f3c317d711772b0576c08","last_reissued_at":"2026-07-05T10:51:20.720403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:20.720403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.07120","source_version":3,"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-07-05T10:51:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjFyMR8dPJ8bM+GLOVkcubJ42zye4rvqivAyl3xQ05gGsulu8m6LfkGdJVKYd17ncXlAxdmnCHdx1djVlF15Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:56:54.544649Z"},"content_sha256":"4008146b1abf4bf4d0219c816c44ba022f6633b24f25a3db22013ad32905efa8","schema_version":"1.0","event_id":"sha256:4008146b1abf4bf4d0219c816c44ba022f6633b24f25a3db22013ad32905efa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XSO2U3HZDN37BTVRGE4RI3PIUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PISA: An Adversarial Approach To Comparing Task Graph Scheduling Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bhaskar Krishnamachari, Jared Coleman","submitted_at":"2024-03-11T19:25:24Z","abstract_excerpt":"Scheduling a task graph representing an application over a heterogeneous network of computers is a fundamental problem in distributed computing. It is known to be not only NP-hard but also not polynomial-time approximable within a constant factor. As a result, many heuristic algorithms have been proposed over the past few decades. Yet it remains largely unclear how these algorithms compare to each other in terms of the quality of schedules they produce. We identify gaps in the traditional benchmarking approach to comparing task scheduling algorithms and propose a simulated annealing-based adve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07120","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.07120/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:51:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/I8+wgg8ESnil/fj/8K8lN3/PZQBdYJtmvL6fc8Kq6oaq7rtd1JH0JkaKqCmfZgPNAx6nPY84O8BwUFH5kB8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:56:54.545027Z"},"content_sha256":"e5fd698bfc2f852adbececd5c3bb457870b5819746ff4ea0a3245389beaac909","schema_version":"1.0","event_id":"sha256:e5fd698bfc2f852adbececd5c3bb457870b5819746ff4ea0a3245389beaac909"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSO2U3HZDN37BTVRGE4RI3PIUL/bundle.json","state_url":"https://pith.science/pith/XSO2U3HZDN37BTVRGE4RI3PIUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSO2U3HZDN37BTVRGE4RI3PIUL/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-07-14T12:56:54Z","links":{"resolver":"https://pith.science/pith/XSO2U3HZDN37BTVRGE4RI3PIUL","bundle":"https://pith.science/pith/XSO2U3HZDN37BTVRGE4RI3PIUL/bundle.json","state":"https://pith.science/pith/XSO2U3HZDN37BTVRGE4RI3PIUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSO2U3HZDN37BTVRGE4RI3PIUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XSO2U3HZDN37BTVRGE4RI3PIUL","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":"aed3075c8530845eafec33ce5563ebcead3c20ec3285b7be1f648f05fa1b2f51","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-11T19:25:24Z","title_canon_sha256":"1a84597d263747b8cc54ce54d088cea86d7fa91262b4686705d96ad64dbcef24"},"schema_version":"1.0","source":{"id":"2403.07120","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.07120","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"arxiv_version","alias_value":"2403.07120v3","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07120","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"pith_short_12","alias_value":"XSO2U3HZDN37","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"pith_short_16","alias_value":"XSO2U3HZDN37BTVR","created_at":"2026-07-05T10:51:20Z"},{"alias_kind":"pith_short_8","alias_value":"XSO2U3HZ","created_at":"2026-07-05T10:51:20Z"}],"graph_snapshots":[{"event_id":"sha256:e5fd698bfc2f852adbececd5c3bb457870b5819746ff4ea0a3245389beaac909","target":"graph","created_at":"2026-07-05T10:51:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.07120/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Scheduling a task graph representing an application over a heterogeneous network of computers is a fundamental problem in distributed computing. It is known to be not only NP-hard but also not polynomial-time approximable within a constant factor. As a result, many heuristic algorithms have been proposed over the past few decades. Yet it remains largely unclear how these algorithms compare to each other in terms of the quality of schedules they produce. We identify gaps in the traditional benchmarking approach to comparing task scheduling algorithms and propose a simulated annealing-based adve","authors_text":"Bhaskar Krishnamachari, Jared Coleman","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-11T19:25:24Z","title":"PISA: An Adversarial Approach To Comparing Task Graph Scheduling Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07120","kind":"arxiv","version":3},"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:4008146b1abf4bf4d0219c816c44ba022f6633b24f25a3db22013ad32905efa8","target":"record","created_at":"2026-07-05T10:51:20Z","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":"aed3075c8530845eafec33ce5563ebcead3c20ec3285b7be1f648f05fa1b2f51","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-03-11T19:25:24Z","title_canon_sha256":"1a84597d263747b8cc54ce54d088cea86d7fa91262b4686705d96ad64dbcef24"},"schema_version":"1.0","source":{"id":"2403.07120","kind":"arxiv","version":3}},"canonical_sha256":"bc9daa6cf91b77f0ceb13139146de8a2d979509ce57f3c317d711772b0576c08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc9daa6cf91b77f0ceb13139146de8a2d979509ce57f3c317d711772b0576c08","first_computed_at":"2026-07-05T10:51:20.720403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:51:20.720403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"futWPujke9b7gAVl2zN6+4zme43fF/QGs0IVTEGPfYesLCiNzLbRwzGOT9YX39Ot0E+2Ugq4Crw+IwxzncnXCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:51:20.720868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.07120","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4008146b1abf4bf4d0219c816c44ba022f6633b24f25a3db22013ad32905efa8","sha256:e5fd698bfc2f852adbececd5c3bb457870b5819746ff4ea0a3245389beaac909"],"state_sha256":"cca3d5c300dbed1cadef5403b53cbc3f5b5143f376d2be4cb556292111883dff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIUpxlQJn2kflbpVBBSHSjdY2vX4rJbM/C6XLcJE8r7sk2IBQiMDt1HZ62P8WLJ9BdID7WqrmknsHXerK9tkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T12:56:54.547678Z","bundle_sha256":"0376bea685064575d0ad0e2a2459a1a6637ffc331899b33e7959b280de7b02ae"}}