{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JFU3BGUXE4DYUJZMOCTRDVWF6A","short_pith_number":"pith:JFU3BGUX","canonical_record":{"source":{"id":"1704.00705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-03T17:45:10Z","cross_cats_sorted":["cs.CV","cs.DC"],"title_canon_sha256":"8e8640da8e5425843b2a3ec43f0b5c7b77ba3b90ef282b01e760be8d467e04e5","abstract_canon_sha256":"b67506110df436819f2f44f47420a4b6fb4900bd3b71ef4c8ff2541587ae9cd1"},"schema_version":"1.0"},"canonical_sha256":"4969b09a9727078a272c70a711d6c5f00106e12e652de64099c5cc32d7f583f8","source":{"kind":"arxiv","id":"1704.00705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00705","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00705v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00705","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"JFU3BGUXE4DY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JFU3BGUXE4DYUJZM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JFU3BGUX","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JFU3BGUXE4DYUJZMOCTRDVWF6A","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-03T17:45:10Z","cross_cats_sorted":["cs.CV","cs.DC"],"title_canon_sha256":"8e8640da8e5425843b2a3ec43f0b5c7b77ba3b90ef282b01e760be8d467e04e5","abstract_canon_sha256":"b67506110df436819f2f44f47420a4b6fb4900bd3b71ef4c8ff2541587ae9cd1"},"schema_version":"1.0"},"canonical_sha256":"4969b09a9727078a272c70a711d6c5f00106e12e652de64099c5cc32d7f583f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:21.553062Z","signature_b64":"TcuQIP2G7j1424koBZXovs+nUuZl9tkcA9grt9TKkRX52beX4E397sH5/usTvU7nP5CVHNYzS3z19GUmzoxCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4969b09a9727078a272c70a711d6c5f00106e12e652de64099c5cc32d7f583f8","last_reissued_at":"2026-05-18T00:47:21.552411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:21.552411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00705","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:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0u8xGJqZrnC/Z+E+Vq9gKY8mNQvpNYwM46JAFnDEzvhmP/Y2IKn2ndHGn//T4ubQ8KqYzE1FuKVE9CGfXyqeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:44:25.936182Z"},"content_sha256":"175736753b1c0972633043b9e61338d0487ceb9349885cb4ba2e4f371ad7ba38","schema_version":"1.0","event_id":"sha256:175736753b1c0972633043b9e61338d0487ceb9349885cb4ba2e4f371ad7ba38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JFU3BGUXE4DYUJZMOCTRDVWF6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Partitioning with Acyclicity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DC"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Merten Popp, Orlando Moreira","submitted_at":"2017-04-03T17:45:10Z","abstract_excerpt":"Graphs are widely used to model execution dependencies in applications. In particular, the NP-complete problem of partitioning a graph under constraints receives enormous attention by researchers because of its applicability in multiprocessor scheduling. We identified the additional constraint of acyclic dependencies between blocks when mapping computer vision and imaging applications to a heterogeneous embedded multiprocessor. Existing algorithms and heuristics do not address this requirement and deliver results that are not applicable for our use-case. In this work, we show that this more co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00705","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:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3jJ9D15FPThKd39Ri9s3qEzdcKE4L1QBcb9PDuNgBiiJWSaP+BkIBy/mtFQed7DAVW1e1wWlnIqLfMRyVJcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:44:25.936561Z"},"content_sha256":"ee113f86c3f6829bef22005e32249e8d8522ee5eed00996bff0b236fc01d0885","schema_version":"1.0","event_id":"sha256:ee113f86c3f6829bef22005e32249e8d8522ee5eed00996bff0b236fc01d0885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFU3BGUXE4DYUJZMOCTRDVWF6A/bundle.json","state_url":"https://pith.science/pith/JFU3BGUXE4DYUJZMOCTRDVWF6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFU3BGUXE4DYUJZMOCTRDVWF6A/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-10T19:44:25Z","links":{"resolver":"https://pith.science/pith/JFU3BGUXE4DYUJZMOCTRDVWF6A","bundle":"https://pith.science/pith/JFU3BGUXE4DYUJZMOCTRDVWF6A/bundle.json","state":"https://pith.science/pith/JFU3BGUXE4DYUJZMOCTRDVWF6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFU3BGUXE4DYUJZMOCTRDVWF6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JFU3BGUXE4DYUJZMOCTRDVWF6A","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":"b67506110df436819f2f44f47420a4b6fb4900bd3b71ef4c8ff2541587ae9cd1","cross_cats_sorted":["cs.CV","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-03T17:45:10Z","title_canon_sha256":"8e8640da8e5425843b2a3ec43f0b5c7b77ba3b90ef282b01e760be8d467e04e5"},"schema_version":"1.0","source":{"id":"1704.00705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00705","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00705v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00705","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"JFU3BGUXE4DY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JFU3BGUXE4DYUJZM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JFU3BGUX","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:ee113f86c3f6829bef22005e32249e8d8522ee5eed00996bff0b236fc01d0885","target":"graph","created_at":"2026-05-18T00:47:21Z","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":"Graphs are widely used to model execution dependencies in applications. In particular, the NP-complete problem of partitioning a graph under constraints receives enormous attention by researchers because of its applicability in multiprocessor scheduling. We identified the additional constraint of acyclic dependencies between blocks when mapping computer vision and imaging applications to a heterogeneous embedded multiprocessor. Existing algorithms and heuristics do not address this requirement and deliver results that are not applicable for our use-case. In this work, we show that this more co","authors_text":"Christian Schulz, Merten Popp, Orlando Moreira","cross_cats":["cs.CV","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-03T17:45:10Z","title":"Graph Partitioning with Acyclicity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00705","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:175736753b1c0972633043b9e61338d0487ceb9349885cb4ba2e4f371ad7ba38","target":"record","created_at":"2026-05-18T00:47:21Z","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":"b67506110df436819f2f44f47420a4b6fb4900bd3b71ef4c8ff2541587ae9cd1","cross_cats_sorted":["cs.CV","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-03T17:45:10Z","title_canon_sha256":"8e8640da8e5425843b2a3ec43f0b5c7b77ba3b90ef282b01e760be8d467e04e5"},"schema_version":"1.0","source":{"id":"1704.00705","kind":"arxiv","version":1}},"canonical_sha256":"4969b09a9727078a272c70a711d6c5f00106e12e652de64099c5cc32d7f583f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4969b09a9727078a272c70a711d6c5f00106e12e652de64099c5cc32d7f583f8","first_computed_at":"2026-05-18T00:47:21.552411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:21.552411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TcuQIP2G7j1424koBZXovs+nUuZl9tkcA9grt9TKkRX52beX4E397sH5/usTvU7nP5CVHNYzS3z19GUmzoxCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:21.553062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:175736753b1c0972633043b9e61338d0487ceb9349885cb4ba2e4f371ad7ba38","sha256:ee113f86c3f6829bef22005e32249e8d8522ee5eed00996bff0b236fc01d0885"],"state_sha256":"a78abc379b0ed491626cf56b899230e5c079290bf5b44e6eab36a417147e7ffb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfdTez7uUPzmhWuUxZPOsfjYaLI34ShkcwQxW06P6yo/4rZ4kxmr6UfLQS9BsvTs41FSjaR4/EEUB2QzQBYICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:44:25.938560Z","bundle_sha256":"80e6cd5b2e64d86faa0a6facdabbd68a59b177eb90c36447ee7bc342f6243df6"}}