{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KYRCCAW6SCS3VMA4MECONZSSGH","short_pith_number":"pith:KYRCCAW6","canonical_record":{"source":{"id":"1706.03951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-13T08:21:50Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"title_canon_sha256":"cf3f35ad57dd81fb95b2610be0f88c7733dd9bb5c1e5027c07df053a675be932","abstract_canon_sha256":"0979e5176ca19c7a6b8b00fb5b49d8d8dc4f6e40ffe155a2b7545a9da85f0d60"},"schema_version":"1.0"},"canonical_sha256":"56222102de90a5bab01c6104e6e65231faf32eeac8c7bac8ad6eaf07b47290ca","source":{"kind":"arxiv","id":"1706.03951","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03951","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03951v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03951","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"KYRCCAW6SCS3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KYRCCAW6SCS3VMA4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KYRCCAW6","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KYRCCAW6SCS3VMA4MECONZSSGH","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-13T08:21:50Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"title_canon_sha256":"cf3f35ad57dd81fb95b2610be0f88c7733dd9bb5c1e5027c07df053a675be932","abstract_canon_sha256":"0979e5176ca19c7a6b8b00fb5b49d8d8dc4f6e40ffe155a2b7545a9da85f0d60"},"schema_version":"1.0"},"canonical_sha256":"56222102de90a5bab01c6104e6e65231faf32eeac8c7bac8ad6eaf07b47290ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:50.802539Z","signature_b64":"7OH7szUIuqdkIJrKZA3iXW85IaRuzjM/EGgC4v2Vhw1xOyG6vseOAHXUa62SU7shVn2132ytAwozxYI2stghBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56222102de90a5bab01c6104e6e65231faf32eeac8c7bac8ad6eaf07b47290ca","last_reissued_at":"2026-05-18T00:07:50.801815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:50.801815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03951","source_version":2,"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-18T00:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c90Y1Zbae5r60I/gjU9o8dmUFU9tZiRwuxgrL4LhAt/PjXjw5rmqoDZ/q7hm1ypKf1T/hvFSUa4jztpC3g3uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:19:12.400572Z"},"content_sha256":"10ffde2f00c171cc6bb7279aba672e362f384099814c08a2208b0a8fa00e87a8","schema_version":"1.0","event_id":"sha256:10ffde2f00c171cc6bb7279aba672e362f384099814c08a2208b0a8fa00e87a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KYRCCAW6SCS3VMA4MECONZSSGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization over Degree Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Antoine Deza, Asaf Levin, Shmuel Onn, Syed M. Meesum","submitted_at":"2017-06-13T08:21:50Z","abstract_excerpt":"We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that deciding if a given sequence is the degree sequence of a 3-hypergraph is NP-complete, thereby solving a 30 year long open problem. This implies that optimization over hypergraphs is hard already for simple concave functions. In contrast, we show that for graphs, if the functions at vertices are the same, then the problem is polynomial time solvable. We also p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03951","kind":"arxiv","version":2},"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-18T00:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrjRMnxKWWePq9PgPgFMQBx9xol8A+4g5fCVP1zrRENEGP9jYs0gph4U3JIrbp2ol6QTuDWuM++VAuoO569QCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:19:12.400960Z"},"content_sha256":"17d5c712c76494bfdf2aaab20cb0225ffe2749897ac919002d9c07fb58e87b9d","schema_version":"1.0","event_id":"sha256:17d5c712c76494bfdf2aaab20cb0225ffe2749897ac919002d9c07fb58e87b9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYRCCAW6SCS3VMA4MECONZSSGH/bundle.json","state_url":"https://pith.science/pith/KYRCCAW6SCS3VMA4MECONZSSGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYRCCAW6SCS3VMA4MECONZSSGH/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-11T09:19:12Z","links":{"resolver":"https://pith.science/pith/KYRCCAW6SCS3VMA4MECONZSSGH","bundle":"https://pith.science/pith/KYRCCAW6SCS3VMA4MECONZSSGH/bundle.json","state":"https://pith.science/pith/KYRCCAW6SCS3VMA4MECONZSSGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYRCCAW6SCS3VMA4MECONZSSGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KYRCCAW6SCS3VMA4MECONZSSGH","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":"0979e5176ca19c7a6b8b00fb5b49d8d8dc4f6e40ffe155a2b7545a9da85f0d60","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-13T08:21:50Z","title_canon_sha256":"cf3f35ad57dd81fb95b2610be0f88c7733dd9bb5c1e5027c07df053a675be932"},"schema_version":"1.0","source":{"id":"1706.03951","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03951","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03951v2","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03951","created_at":"2026-05-18T00:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"KYRCCAW6SCS3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KYRCCAW6SCS3VMA4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KYRCCAW6","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:17d5c712c76494bfdf2aaab20cb0225ffe2749897ac919002d9c07fb58e87b9d","target":"graph","created_at":"2026-05-18T00:07:50Z","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":"We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that deciding if a given sequence is the degree sequence of a 3-hypergraph is NP-complete, thereby solving a 30 year long open problem. This implies that optimization over hypergraphs is hard already for simple concave functions. In contrast, we show that for graphs, if the functions at vertices are the same, then the problem is polynomial time solvable. We also p","authors_text":"Antoine Deza, Asaf Levin, Shmuel Onn, Syed M. Meesum","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-13T08:21:50Z","title":"Optimization over Degree Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03951","kind":"arxiv","version":2},"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:10ffde2f00c171cc6bb7279aba672e362f384099814c08a2208b0a8fa00e87a8","target":"record","created_at":"2026-05-18T00:07:50Z","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":"0979e5176ca19c7a6b8b00fb5b49d8d8dc4f6e40ffe155a2b7545a9da85f0d60","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-13T08:21:50Z","title_canon_sha256":"cf3f35ad57dd81fb95b2610be0f88c7733dd9bb5c1e5027c07df053a675be932"},"schema_version":"1.0","source":{"id":"1706.03951","kind":"arxiv","version":2}},"canonical_sha256":"56222102de90a5bab01c6104e6e65231faf32eeac8c7bac8ad6eaf07b47290ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56222102de90a5bab01c6104e6e65231faf32eeac8c7bac8ad6eaf07b47290ca","first_computed_at":"2026-05-18T00:07:50.801815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:50.801815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OH7szUIuqdkIJrKZA3iXW85IaRuzjM/EGgC4v2Vhw1xOyG6vseOAHXUa62SU7shVn2132ytAwozxYI2stghBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:50.802539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03951","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10ffde2f00c171cc6bb7279aba672e362f384099814c08a2208b0a8fa00e87a8","sha256:17d5c712c76494bfdf2aaab20cb0225ffe2749897ac919002d9c07fb58e87b9d"],"state_sha256":"d1d2d8c91ee02ac83c870bab1e4091e46e9bef569f36dc6cf519739c24240074"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nm9rmJiYIw/q7H/oNpsiDHKfMtihxYgWE8v9oy/FK9erQ1LGrBEzpz6/2J+e0gg9n2Y13doYzuGBta2l6na2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:19:12.403092Z","bundle_sha256":"8ae48b9b65bf1c0d688b900c0e2cc4027ecd7f40ba863c39d3a0e3a7b3cdfb66"}}