{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4UFAVBOVK7UFXGF3PW3Z7E7FCL","short_pith_number":"pith:4UFAVBOV","canonical_record":{"source":{"id":"1203.3636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-16T08:42:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1d1ce57dfb4d7c3d3292aec98755412201140cdc236c968b29dcc4096cff8f65","abstract_canon_sha256":"2aee6e1b500e8b9de8311c498597b85323efaad04f6e1d32a4754d52ba97851f"},"schema_version":"1.0"},"canonical_sha256":"e50a0a85d557e85b98bb7db79f93e512e3e0bf3470c41354325eba45795bc5bc","source":{"kind":"arxiv","id":"1203.3636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3636","created_at":"2026-05-18T03:59:50Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3636v1","created_at":"2026-05-18T03:59:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3636","created_at":"2026-05-18T03:59:50Z"},{"alias_kind":"pith_short_12","alias_value":"4UFAVBOVK7UF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4UFAVBOVK7UFXGF3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4UFAVBOV","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4UFAVBOVK7UFXGF3PW3Z7E7FCL","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-16T08:42:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1d1ce57dfb4d7c3d3292aec98755412201140cdc236c968b29dcc4096cff8f65","abstract_canon_sha256":"2aee6e1b500e8b9de8311c498597b85323efaad04f6e1d32a4754d52ba97851f"},"schema_version":"1.0"},"canonical_sha256":"e50a0a85d557e85b98bb7db79f93e512e3e0bf3470c41354325eba45795bc5bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:50.368493Z","signature_b64":"+sWlZ1lXahY6JgMd9sW4f5c9/fGV40f+/1V69m6ZsAfUEfXf/RCbOvreF9Q2DJuxUaf6F8GeAS9RzfrG6PoACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e50a0a85d557e85b98bb7db79f93e512e3e0bf3470c41354325eba45795bc5bc","last_reissued_at":"2026-05-18T03:59:50.367726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:50.367726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3636","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-18T03:59:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0J0FDkEU5e3h1f+4WAw+hXB1LgVnS15d4CDrUX/5cuv2KuGCwGEOxLikUerADjjX46ULnAPik7iSWRCZf5i3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:19:35.979173Z"},"content_sha256":"7832d32c60618f8348526230333a39e20983e078637b9247b72358c0431e469b","schema_version":"1.0","event_id":"sha256:7832d32c60618f8348526230333a39e20983e078637b9247b72358c0431e469b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4UFAVBOVK7UFXGF3PW3Z7E7FCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Attack the NP-complete Dag Realization Problem in Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Annabell Berger, Matthias M\\\"uller-Hannemann","submitted_at":"2012-03-16T08:42:58Z","abstract_excerpt":"We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a dag (no parallel arcs allowed) with labeled vertex set V:= {v_1,...,v_n} such that for all v_i in V indegree and outdegree of v_i match exactly the given numbers a_i and b_i, respectively? Recently this decision problem has been shown to be NP-complete by Nichterlein (2011). However, we can show that several important classes of sequences are efficiently solvable.\n  In previous work (Berger and Mueller-Hannemann, FCT20"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3636","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-18T03:59:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/i02SqLg6BL90kLBi4TA9UeKlrbExoR8c6B5KZKpyQBawWK7zAMWzDutCo76xLIIlBGC+s6WpBzGYQ/7amtBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:19:35.979538Z"},"content_sha256":"1e4f3d9a546975aab021628d60b77f3409a3d0a87e69ae684056da41d843e4da","schema_version":"1.0","event_id":"sha256:1e4f3d9a546975aab021628d60b77f3409a3d0a87e69ae684056da41d843e4da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UFAVBOVK7UFXGF3PW3Z7E7FCL/bundle.json","state_url":"https://pith.science/pith/4UFAVBOVK7UFXGF3PW3Z7E7FCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UFAVBOVK7UFXGF3PW3Z7E7FCL/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-31T03:19:35Z","links":{"resolver":"https://pith.science/pith/4UFAVBOVK7UFXGF3PW3Z7E7FCL","bundle":"https://pith.science/pith/4UFAVBOVK7UFXGF3PW3Z7E7FCL/bundle.json","state":"https://pith.science/pith/4UFAVBOVK7UFXGF3PW3Z7E7FCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UFAVBOVK7UFXGF3PW3Z7E7FCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4UFAVBOVK7UFXGF3PW3Z7E7FCL","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":"2aee6e1b500e8b9de8311c498597b85323efaad04f6e1d32a4754d52ba97851f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-16T08:42:58Z","title_canon_sha256":"1d1ce57dfb4d7c3d3292aec98755412201140cdc236c968b29dcc4096cff8f65"},"schema_version":"1.0","source":{"id":"1203.3636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3636","created_at":"2026-05-18T03:59:50Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3636v1","created_at":"2026-05-18T03:59:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3636","created_at":"2026-05-18T03:59:50Z"},{"alias_kind":"pith_short_12","alias_value":"4UFAVBOVK7UF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4UFAVBOVK7UFXGF3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4UFAVBOV","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:1e4f3d9a546975aab021628d60b77f3409a3d0a87e69ae684056da41d843e4da","target":"graph","created_at":"2026-05-18T03:59: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 study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a dag (no parallel arcs allowed) with labeled vertex set V:= {v_1,...,v_n} such that for all v_i in V indegree and outdegree of v_i match exactly the given numbers a_i and b_i, respectively? Recently this decision problem has been shown to be NP-complete by Nichterlein (2011). However, we can show that several important classes of sequences are efficiently solvable.\n  In previous work (Berger and Mueller-Hannemann, FCT20","authors_text":"Annabell Berger, Matthias M\\\"uller-Hannemann","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-16T08:42:58Z","title":"How to Attack the NP-complete Dag Realization Problem in Practice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3636","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:7832d32c60618f8348526230333a39e20983e078637b9247b72358c0431e469b","target":"record","created_at":"2026-05-18T03:59: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":"2aee6e1b500e8b9de8311c498597b85323efaad04f6e1d32a4754d52ba97851f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-16T08:42:58Z","title_canon_sha256":"1d1ce57dfb4d7c3d3292aec98755412201140cdc236c968b29dcc4096cff8f65"},"schema_version":"1.0","source":{"id":"1203.3636","kind":"arxiv","version":1}},"canonical_sha256":"e50a0a85d557e85b98bb7db79f93e512e3e0bf3470c41354325eba45795bc5bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e50a0a85d557e85b98bb7db79f93e512e3e0bf3470c41354325eba45795bc5bc","first_computed_at":"2026-05-18T03:59:50.367726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:50.367726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+sWlZ1lXahY6JgMd9sW4f5c9/fGV40f+/1V69m6ZsAfUEfXf/RCbOvreF9Q2DJuxUaf6F8GeAS9RzfrG6PoACw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:50.368493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7832d32c60618f8348526230333a39e20983e078637b9247b72358c0431e469b","sha256:1e4f3d9a546975aab021628d60b77f3409a3d0a87e69ae684056da41d843e4da"],"state_sha256":"7bbb15dfcd807bbf555dc2902f6a82844a02dbdd28755b5b7dbb7479ae9a3ffe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZg2rlr2eQxSnfvPgW8tCfoTUTM+aGelyflyHlzzvZLCuxHcxdwy8sWrM8V89qQLFci7EiMgM7YtYGgm+pQ9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:19:35.981476Z","bundle_sha256":"80b6ea5c243805115f91786a0506bdf28f27210393d0fa23c1ff2a0c722f73c9"}}