{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KPVCY6TSUJQ7CBGYISF44VTQ7I","short_pith_number":"pith:KPVCY6TS","canonical_record":{"source":{"id":"1110.2735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:07Z","cross_cats_sorted":[],"title_canon_sha256":"fb2e3b4e13bc39e2385ec772696dcc21a3f64539b44e2a5ce5786d53e3775726","abstract_canon_sha256":"aa8b63f10eae7504e296cebc1a4a3c05c729263401a9986c5cdfe0cb8d06579f"},"schema_version":"1.0"},"canonical_sha256":"53ea2c7a72a261f104d8448bce5670fa0061e34d4dfbd1a9739f828696a26112","source":{"kind":"arxiv","id":"1110.2735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2735","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2735v1","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2735","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"KPVCY6TSUJQ7","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KPVCY6TSUJQ7CBGY","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KPVCY6TS","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KPVCY6TSUJQ7CBGYISF44VTQ7I","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:07Z","cross_cats_sorted":[],"title_canon_sha256":"fb2e3b4e13bc39e2385ec772696dcc21a3f64539b44e2a5ce5786d53e3775726","abstract_canon_sha256":"aa8b63f10eae7504e296cebc1a4a3c05c729263401a9986c5cdfe0cb8d06579f"},"schema_version":"1.0"},"canonical_sha256":"53ea2c7a72a261f104d8448bce5670fa0061e34d4dfbd1a9739f828696a26112","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:07.636941Z","signature_b64":"9or5/sGvPxmjQ/nOeY+hyFDqNmMuR5j1QgqggNc1Y8jQZ87KCMg/90lZp+bJqALkdINGf/qdeVqocpeSUDEaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53ea2c7a72a261f104d8448bce5670fa0061e34d4dfbd1a9739f828696a26112","last_reissued_at":"2026-05-18T04:11:07.636286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:07.636286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2735","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-18T04:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmxyZUQbstFSfWEPTNmzVatESKW2EOkwpUsfa2isiLtK7aQKcU54JuMplK3rWmi4wvfi1Cyyi4qPp2/v5hJhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:38:52.316434Z"},"content_sha256":"e08d27bf3bb9836b30c18fe35cb790589c457b279aca8a10700a0a2a22ed6dac","schema_version":"1.0","event_id":"sha256:e08d27bf3bb9836b30c18fe35cb790589c457b279aca8a10700a0a2a22ed6dac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KPVCY6TSUJQ7CBGYISF44VTQ7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Understanding Algorithm Performance on an Oversubscribed Scheduling Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"A. E. Howe, L. Barbulescu, L. D. Whitley, M. Roberts","submitted_at":"2011-10-12T18:21:07Z","abstract_excerpt":"The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet, through careful experimentation and modeling of performance in real problem instances, we can relate characteristics of the best algorithms to characteristics of the application. In particular, we find that plateaus dominate the search spaces (thus favoring algorithms that make larger changes to solutions) and that some randomization in exploration is critical to good performance (due to the lack of gradient informa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2735","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-18T04:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItEShT2jnBLCMcFkvGCk3VbbbULWbpxp016NVs9vCA1aTiXtPHo1ENF08/RD9mtMyT6Oe8ErOJZeCm5Bio5YDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:38:52.316780Z"},"content_sha256":"0d040da1e868d33ca36260b6ee4f687f9bfa570d7f45f9a162db76af23d6b342","schema_version":"1.0","event_id":"sha256:0d040da1e868d33ca36260b6ee4f687f9bfa570d7f45f9a162db76af23d6b342"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPVCY6TSUJQ7CBGYISF44VTQ7I/bundle.json","state_url":"https://pith.science/pith/KPVCY6TSUJQ7CBGYISF44VTQ7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPVCY6TSUJQ7CBGYISF44VTQ7I/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-05-29T23:38:52Z","links":{"resolver":"https://pith.science/pith/KPVCY6TSUJQ7CBGYISF44VTQ7I","bundle":"https://pith.science/pith/KPVCY6TSUJQ7CBGYISF44VTQ7I/bundle.json","state":"https://pith.science/pith/KPVCY6TSUJQ7CBGYISF44VTQ7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPVCY6TSUJQ7CBGYISF44VTQ7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KPVCY6TSUJQ7CBGYISF44VTQ7I","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":"aa8b63f10eae7504e296cebc1a4a3c05c729263401a9986c5cdfe0cb8d06579f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:07Z","title_canon_sha256":"fb2e3b4e13bc39e2385ec772696dcc21a3f64539b44e2a5ce5786d53e3775726"},"schema_version":"1.0","source":{"id":"1110.2735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2735","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2735v1","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2735","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"KPVCY6TSUJQ7","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KPVCY6TSUJQ7CBGY","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KPVCY6TS","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:0d040da1e868d33ca36260b6ee4f687f9bfa570d7f45f9a162db76af23d6b342","target":"graph","created_at":"2026-05-18T04:11:07Z","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":"The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet, through careful experimentation and modeling of performance in real problem instances, we can relate characteristics of the best algorithms to characteristics of the application. In particular, we find that plateaus dominate the search spaces (thus favoring algorithms that make larger changes to solutions) and that some randomization in exploration is critical to good performance (due to the lack of gradient informa","authors_text":"A. E. Howe, L. Barbulescu, L. D. Whitley, M. Roberts","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:07Z","title":"Understanding Algorithm Performance on an Oversubscribed Scheduling Application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2735","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:e08d27bf3bb9836b30c18fe35cb790589c457b279aca8a10700a0a2a22ed6dac","target":"record","created_at":"2026-05-18T04:11:07Z","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":"aa8b63f10eae7504e296cebc1a4a3c05c729263401a9986c5cdfe0cb8d06579f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:07Z","title_canon_sha256":"fb2e3b4e13bc39e2385ec772696dcc21a3f64539b44e2a5ce5786d53e3775726"},"schema_version":"1.0","source":{"id":"1110.2735","kind":"arxiv","version":1}},"canonical_sha256":"53ea2c7a72a261f104d8448bce5670fa0061e34d4dfbd1a9739f828696a26112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53ea2c7a72a261f104d8448bce5670fa0061e34d4dfbd1a9739f828696a26112","first_computed_at":"2026-05-18T04:11:07.636286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:07.636286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9or5/sGvPxmjQ/nOeY+hyFDqNmMuR5j1QgqggNc1Y8jQZ87KCMg/90lZp+bJqALkdINGf/qdeVqocpeSUDEaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:07.636941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e08d27bf3bb9836b30c18fe35cb790589c457b279aca8a10700a0a2a22ed6dac","sha256:0d040da1e868d33ca36260b6ee4f687f9bfa570d7f45f9a162db76af23d6b342"],"state_sha256":"22ad9fe2a2f45e585d62701433d239fc37b07d3f931cf108860b2b0236374f61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXDUpkpl6Y/BaHRFlAxUr4loYlvV8+O0oPr7K3qIwmJ8XbJMBnM8zXUqmEaiX+nHohC2MSQ9P1kgBJ5RFq9RBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:38:52.318767Z","bundle_sha256":"ca5b3f8542cfecf073f6ed74156e50326d144287c87af4bb4174f712615e5b35"}}