{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2PNZWXCRLUENMYLMZHT6S3WPP5","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":"0890444a46110147d9da6f0e096fff41923cacc3fbda50ec59c0199555c8f993","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-25T22:01:30Z","title_canon_sha256":"2c3ac7585565cefc48106f784a4bb5ae34a21f6f2c5df39718a83ca1cd5fcd5d"},"schema_version":"1.0","source":{"id":"2411.16963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16963","created_at":"2026-07-05T09:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16963v1","created_at":"2026-07-05T09:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16963","created_at":"2026-07-05T09:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"2PNZWXCRLUEN","created_at":"2026-07-05T09:40:25Z"},{"alias_kind":"pith_short_16","alias_value":"2PNZWXCRLUENMYLM","created_at":"2026-07-05T09:40:25Z"},{"alias_kind":"pith_short_8","alias_value":"2PNZWXCR","created_at":"2026-07-05T09:40:25Z"}],"graph_snapshots":[{"event_id":"sha256:2fdf20bc980e23e1f9464f217e88051646aabebcb7912103cb45c8b65438f89b","target":"graph","created_at":"2026-07-05T09:40:25Z","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/2411.16963/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is fixed. It is demonstrated that in some cases fixing the structure makes the problem easier, whereas in general the problem remains NP-complete.","authors_text":"Nimrod Megiddo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16963","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:999070b274109321cc4af4d54029f5a507fcc0d07e2ffda5b996c715abc03335","target":"record","created_at":"2026-07-05T09:40:25Z","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":"0890444a46110147d9da6f0e096fff41923cacc3fbda50ec59c0199555c8f993","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-25T22:01:30Z","title_canon_sha256":"2c3ac7585565cefc48106f784a4bb5ae34a21f6f2c5df39718a83ca1cd5fcd5d"},"schema_version":"1.0","source":{"id":"2411.16963","kind":"arxiv","version":1}},"canonical_sha256":"d3db9b5c515d08d6616cc9e7e96ecf7f6bec1c3582e1d71724b85a12356f74f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3db9b5c515d08d6616cc9e7e96ecf7f6bec1c3582e1d71724b85a12356f74f7","first_computed_at":"2026-07-05T09:40:25.282682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:25.282682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jhFChH4fOYPOlXEuooY7oCVuaqmvXwLpqXda3ndyIqQUSuJ2OGjDxDkxXFdkw29AZZaeIcc+P1WqTiClmPM2Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:25.283098Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:999070b274109321cc4af4d54029f5a507fcc0d07e2ffda5b996c715abc03335","sha256:2fdf20bc980e23e1f9464f217e88051646aabebcb7912103cb45c8b65438f89b"],"state_sha256":"e18883dfb9e3342655d30c4f82b3bba0b0ef35b6be637590bae059424324918e"}