{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:PE26CSKW7MBTGJ5Z4JQSF72NWC","short_pith_number":"pith:PE26CSKW","canonical_record":{"source":{"id":"math/0012099","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2000-12-12T21:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"78587b5b9e9516d9bb2c8ebded6e25d36dde8529f70264b9f171289822f6a4f1","abstract_canon_sha256":"01d4cd8ef90a2ac12dab860aa152b7fb07e929ea0ce79feb90050b25f2d49292"},"schema_version":"1.0"},"canonical_sha256":"7935e14956fb033327b9e26122ff4db0be02277576ffd6ee652261e627219d27","source":{"kind":"arxiv","id":"math/0012099","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0012099","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"math/0012099v1","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0012099","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"PE26CSKW7MBT","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"pith_short_16","alias_value":"PE26CSKW7MBTGJ5Z","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"pith_short_8","alias_value":"PE26CSKW","created_at":"2026-07-04T14:34:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:PE26CSKW7MBTGJ5Z4JQSF72NWC","target":"record","payload":{"canonical_record":{"source":{"id":"math/0012099","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2000-12-12T21:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"78587b5b9e9516d9bb2c8ebded6e25d36dde8529f70264b9f171289822f6a4f1","abstract_canon_sha256":"01d4cd8ef90a2ac12dab860aa152b7fb07e929ea0ce79feb90050b25f2d49292"},"schema_version":"1.0"},"canonical_sha256":"7935e14956fb033327b9e26122ff4db0be02277576ffd6ee652261e627219d27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:34:58.701758Z","signature_b64":"6xM48DXKUnT4mZe7ddvjfnVHj96WfaRjPaHxfODVa61Py80HLpFSrOiPcwMPDEUNEafQsUEkiei5JnC2pAhPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7935e14956fb033327b9e26122ff4db0be02277576ffd6ee652261e627219d27","last_reissued_at":"2026-07-04T14:34:58.701259Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:34:58.701259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0012099","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-07-04T14:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnslBuvSJ7sncPQTVK6qprCzPcPOe1laTP67QDZ0RqWpbxKDctcoFcj6gIqI7yNdK15lEty4T/6Fw80NjrBPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:09:06.293631Z"},"content_sha256":"a0cc3b690e0b25328e5822019afd7cd726242840be1d142f3eb50b688ac931de","schema_version":"1.0","event_id":"sha256:a0cc3b690e0b25328e5822019afd7cd726242840be1d142f3eb50b688ac931de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:PE26CSKW7MBTGJ5Z4JQSF72NWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition of polytopes and polynomials","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.G.B. Lauder, S. Gao","submitted_at":"2000-12-12T21:29:25Z","abstract_excerpt":"Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral polygons is NP-complete then present a pseudo-polynomial time algorithm for decomposing polygons. For higher dimensional polytopes, we give a heuristic algorithm which is based upon projections and uses randomization. Applications of our algorithm include absolute irreducibility testing and factorization of polynomials via their Newton polytopes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0012099","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0012099/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-04T14:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UzLszygqScpEMM1umyHraisFWnNEM2+mYL55cOCcorMABSMkUS1zfrGs+zx/LMNyVj3CoMstlTPNbW1v9rC4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:09:06.294006Z"},"content_sha256":"ea99e29594f993140c3c3fd67b5cac30589ede49daed975746f2029d8d9eb813","schema_version":"1.0","event_id":"sha256:ea99e29594f993140c3c3fd67b5cac30589ede49daed975746f2029d8d9eb813"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PE26CSKW7MBTGJ5Z4JQSF72NWC/bundle.json","state_url":"https://pith.science/pith/PE26CSKW7MBTGJ5Z4JQSF72NWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PE26CSKW7MBTGJ5Z4JQSF72NWC/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-05T13:09:06Z","links":{"resolver":"https://pith.science/pith/PE26CSKW7MBTGJ5Z4JQSF72NWC","bundle":"https://pith.science/pith/PE26CSKW7MBTGJ5Z4JQSF72NWC/bundle.json","state":"https://pith.science/pith/PE26CSKW7MBTGJ5Z4JQSF72NWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PE26CSKW7MBTGJ5Z4JQSF72NWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:PE26CSKW7MBTGJ5Z4JQSF72NWC","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":"01d4cd8ef90a2ac12dab860aa152b7fb07e929ea0ce79feb90050b25f2d49292","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2000-12-12T21:29:25Z","title_canon_sha256":"78587b5b9e9516d9bb2c8ebded6e25d36dde8529f70264b9f171289822f6a4f1"},"schema_version":"1.0","source":{"id":"math/0012099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0012099","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"math/0012099v1","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0012099","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"PE26CSKW7MBT","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"pith_short_16","alias_value":"PE26CSKW7MBTGJ5Z","created_at":"2026-07-04T14:34:58Z"},{"alias_kind":"pith_short_8","alias_value":"PE26CSKW","created_at":"2026-07-04T14:34:58Z"}],"graph_snapshots":[{"event_id":"sha256:ea99e29594f993140c3c3fd67b5cac30589ede49daed975746f2029d8d9eb813","target":"graph","created_at":"2026-07-04T14:34:58Z","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/math/0012099/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral polygons is NP-complete then present a pseudo-polynomial time algorithm for decomposing polygons. For higher dimensional polytopes, we give a heuristic algorithm which is based upon projections and uses randomization. Applications of our algorithm include absolute irreducibility testing and factorization of polynomials via their Newton polytopes.","authors_text":"A.G.B. Lauder, S. Gao","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2000-12-12T21:29:25Z","title":"Decomposition of polytopes and polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0012099","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:a0cc3b690e0b25328e5822019afd7cd726242840be1d142f3eb50b688ac931de","target":"record","created_at":"2026-07-04T14:34:58Z","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":"01d4cd8ef90a2ac12dab860aa152b7fb07e929ea0ce79feb90050b25f2d49292","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2000-12-12T21:29:25Z","title_canon_sha256":"78587b5b9e9516d9bb2c8ebded6e25d36dde8529f70264b9f171289822f6a4f1"},"schema_version":"1.0","source":{"id":"math/0012099","kind":"arxiv","version":1}},"canonical_sha256":"7935e14956fb033327b9e26122ff4db0be02277576ffd6ee652261e627219d27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7935e14956fb033327b9e26122ff4db0be02277576ffd6ee652261e627219d27","first_computed_at":"2026-07-04T14:34:58.701259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:34:58.701259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6xM48DXKUnT4mZe7ddvjfnVHj96WfaRjPaHxfODVa61Py80HLpFSrOiPcwMPDEUNEafQsUEkiei5JnC2pAhPAw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:34:58.701758Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0012099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0cc3b690e0b25328e5822019afd7cd726242840be1d142f3eb50b688ac931de","sha256:ea99e29594f993140c3c3fd67b5cac30589ede49daed975746f2029d8d9eb813"],"state_sha256":"e2038b3a61ea4f4b9a0e9318b01358d4d47868d6da77a6e39baad00178710ce0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuJQCrCJdNfUZKnUEJ8eXVPwAG0fj0Ubq8rp3t6BKZ8uC/HwIep1aD10oZnNDYdAHBSGOcikJBZSdmkFDBcWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T13:09:06.296427Z","bundle_sha256":"f2602037b9494674fc2f2abb51eb5e1256ce8fc2974c24c53747cccd596bc454"}}