{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2YGHHJJLJKAIEDADTS3PXSUOWA","short_pith_number":"pith:2YGHHJJL","canonical_record":{"source":{"id":"1702.06121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T14:51:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aa1306ed0c34e50f17a84ddb2bb84b0be708c76cad57de9718bf2c601d1cc093","abstract_canon_sha256":"3d4496ba4bd2df97cb729692acaf1387b37b5fb43722e5e5e1a0e218a0984937"},"schema_version":"1.0"},"canonical_sha256":"d60c73a52b4a80820c039cb6fbca8eb00b65eb99238cee62e408483e049354fd","source":{"kind":"arxiv","id":"1702.06121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06121","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06121v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06121","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"2YGHHJJLJKAI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YGHHJJLJKAIEDAD","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YGHHJJL","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2YGHHJJLJKAIEDADTS3PXSUOWA","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T14:51:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aa1306ed0c34e50f17a84ddb2bb84b0be708c76cad57de9718bf2c601d1cc093","abstract_canon_sha256":"3d4496ba4bd2df97cb729692acaf1387b37b5fb43722e5e5e1a0e218a0984937"},"schema_version":"1.0"},"canonical_sha256":"d60c73a52b4a80820c039cb6fbca8eb00b65eb99238cee62e408483e049354fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:14.901197Z","signature_b64":"oW6JCblq8mtu0fLLqMQw88QdAz0T2xQue1PSkXlTbnpAnAIeJtwBDEXtb1iNfT4twdVoeLrhnnjeuOoJ2HtqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d60c73a52b4a80820c039cb6fbca8eb00b65eb99238cee62e408483e049354fd","last_reissued_at":"2026-05-18T00:50:14.900730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:14.900730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06121","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-18T00:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBYkuj2MHHQrVLGiGhll8l7HfmcPJ2isxjK9q3jF3bX5BxKh5lQZH/gcJIFFIeZ0G3jwgx2j1/DeO3avOJcXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:21:59.618029Z"},"content_sha256":"efd4fd63957711b3a9a0789957fd55e88be0b08504c6fa03077baa6517ad27eb","schema_version":"1.0","event_id":"sha256:efd4fd63957711b3a9a0789957fd55e88be0b08504c6fa03077baa6517ad27eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2YGHHJJLJKAIEDADTS3PXSUOWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing binary matrices under window constraints from their row and column sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Andreas Alpers, Peter Gritzmann","submitted_at":"2017-02-20T14:51:14Z","abstract_excerpt":"The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical consistency and reconstruction problems for two directions in discrete tomography can be solved in polynomial time, it turns out that these window constraints cause various unexpected complexity jumps back and forth from polynomial-time solvability to $\\mathbb{N}\\mathbb{P}$-hardness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06121","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-18T00:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZC4wADMNRCCOjlu7tvsvENnO1Ykkl++cuEwjqtf+1M6BExApDndo8LFPFSLFSTHTdZYZWudPMkSPrqgjrqmjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:21:59.618403Z"},"content_sha256":"a90266377bcf09a3e3114d2a059fd4bb3d0d7979042404be96b7d72a58e7fe22","schema_version":"1.0","event_id":"sha256:a90266377bcf09a3e3114d2a059fd4bb3d0d7979042404be96b7d72a58e7fe22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YGHHJJLJKAIEDADTS3PXSUOWA/bundle.json","state_url":"https://pith.science/pith/2YGHHJJLJKAIEDADTS3PXSUOWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YGHHJJLJKAIEDADTS3PXSUOWA/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-26T02:21:59Z","links":{"resolver":"https://pith.science/pith/2YGHHJJLJKAIEDADTS3PXSUOWA","bundle":"https://pith.science/pith/2YGHHJJLJKAIEDADTS3PXSUOWA/bundle.json","state":"https://pith.science/pith/2YGHHJJLJKAIEDADTS3PXSUOWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YGHHJJLJKAIEDADTS3PXSUOWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2YGHHJJLJKAIEDADTS3PXSUOWA","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":"3d4496ba4bd2df97cb729692acaf1387b37b5fb43722e5e5e1a0e218a0984937","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T14:51:14Z","title_canon_sha256":"aa1306ed0c34e50f17a84ddb2bb84b0be708c76cad57de9718bf2c601d1cc093"},"schema_version":"1.0","source":{"id":"1702.06121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06121","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06121v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06121","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"2YGHHJJLJKAI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YGHHJJLJKAIEDAD","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YGHHJJL","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:a90266377bcf09a3e3114d2a059fd4bb3d0d7979042404be96b7d72a58e7fe22","target":"graph","created_at":"2026-05-18T00:50:14Z","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 present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical consistency and reconstruction problems for two directions in discrete tomography can be solved in polynomial time, it turns out that these window constraints cause various unexpected complexity jumps back and forth from polynomial-time solvability to $\\mathbb{N}\\mathbb{P}$-hardness.","authors_text":"Andreas Alpers, Peter Gritzmann","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T14:51:14Z","title":"Reconstructing binary matrices under window constraints from their row and column sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06121","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:efd4fd63957711b3a9a0789957fd55e88be0b08504c6fa03077baa6517ad27eb","target":"record","created_at":"2026-05-18T00:50:14Z","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":"3d4496ba4bd2df97cb729692acaf1387b37b5fb43722e5e5e1a0e218a0984937","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T14:51:14Z","title_canon_sha256":"aa1306ed0c34e50f17a84ddb2bb84b0be708c76cad57de9718bf2c601d1cc093"},"schema_version":"1.0","source":{"id":"1702.06121","kind":"arxiv","version":1}},"canonical_sha256":"d60c73a52b4a80820c039cb6fbca8eb00b65eb99238cee62e408483e049354fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d60c73a52b4a80820c039cb6fbca8eb00b65eb99238cee62e408483e049354fd","first_computed_at":"2026-05-18T00:50:14.900730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:14.900730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oW6JCblq8mtu0fLLqMQw88QdAz0T2xQue1PSkXlTbnpAnAIeJtwBDEXtb1iNfT4twdVoeLrhnnjeuOoJ2HtqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:14.901197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efd4fd63957711b3a9a0789957fd55e88be0b08504c6fa03077baa6517ad27eb","sha256:a90266377bcf09a3e3114d2a059fd4bb3d0d7979042404be96b7d72a58e7fe22"],"state_sha256":"a3ff9984b8117a4c27382de67bffec26b4300df595d134a3f171cde6b365ff00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcR9qJusUBOI2wSDVT0pAe4upytHpYPk1ytWMRgDejWM/LdLgtE0ocKYeuNOms9Pvbn6UeJWm1uw2LqARy0pBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:21:59.621551Z","bundle_sha256":"ae6a01b4e42904bb0e4fa77d11d31ef7dba2e3ceddf84cec48e969b238576829"}}