{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CIXN4QUZYVK7ITRWOALSUQ7YNI","short_pith_number":"pith:CIXN4QUZ","canonical_record":{"source":{"id":"1201.2231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-11T03:18:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c7609541d10f7365680dacecd1ca23a136e03150dfe862efd47eed309e95f84c","abstract_canon_sha256":"792eb582cc81d9ebb3e3d0cd127ff2f64adafa457a9afd076bf3acdc12aaf278"},"schema_version":"1.0"},"canonical_sha256":"122ede4299c555f44e3670172a43f86a3fd366a985f451b1758eae261a995df3","source":{"kind":"arxiv","id":"1201.2231","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2231","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2231v2","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2231","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"CIXN4QUZYVK7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CIXN4QUZYVK7ITRW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CIXN4QUZ","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CIXN4QUZYVK7ITRWOALSUQ7YNI","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-11T03:18:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c7609541d10f7365680dacecd1ca23a136e03150dfe862efd47eed309e95f84c","abstract_canon_sha256":"792eb582cc81d9ebb3e3d0cd127ff2f64adafa457a9afd076bf3acdc12aaf278"},"schema_version":"1.0"},"canonical_sha256":"122ede4299c555f44e3670172a43f86a3fd366a985f451b1758eae261a995df3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.566354Z","signature_b64":"+XkE61YrXw2+/KsGWNs0CTryw+u+Ek6BJSIIxlGJU3bR3Ntwxb0S/QsNsBoxl7+wOL3rnjcBarhX4zk2pBCHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"122ede4299c555f44e3670172a43f86a3fd366a985f451b1758eae261a995df3","last_reissued_at":"2026-05-18T02:21:18.565833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.565833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2231","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjPsVr6tJMQsafN2KwmBV4wRTpIG8urbrJigEqPlslqmgIhWwV5jE8AUuvhFYx73GfHOQLDZ9bfGXoeo2zvgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:01:33.416269Z"},"content_sha256":"c50d67be74335481a13b8e6b02c7a0aefc48540f674cbf9b8bde24116a29a5f9","schema_version":"1.0","event_id":"sha256:c50d67be74335481a13b8e6b02c7a0aefc48540f674cbf9b8bde24116a29a5f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CIXN4QUZYVK7ITRWOALSUQ7YNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced Functional Dependence Graph and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Satyajit Thakor, Xiaoli Xu, Yong Liang Guan","submitted_at":"2012-01-11T03:18:30Z","abstract_excerpt":"Functional dependence graph (FDG) is an important class of directed graph that captures the dominance relationship among a set of variables. FDG is frequently used in calculating network coding capacity bounds. However, the order of FDG is usually much larger than the original network and the computational complexity of many bounds grows exponentially with the order of FDG. In this paper, we introduce the concept of reduced FDG, which is obtained from the original FDG by keeping only those \"essential\" edges. It is proved that the reduced FDG gives the same capacity region/bounds with the origi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2231","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZG99kcB1c9j+nMU/fgxmVmHlyv7/dOoYB9ICXzk55CaluUDD0vZh+kgWQd/teSjCXQkU1+pW6lXv7kb7ndNRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:01:33.416639Z"},"content_sha256":"cfc527008bbe5ab41dc80208322cb6cde54183674f56feaadb5dbcd7a7350e08","schema_version":"1.0","event_id":"sha256:cfc527008bbe5ab41dc80208322cb6cde54183674f56feaadb5dbcd7a7350e08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIXN4QUZYVK7ITRWOALSUQ7YNI/bundle.json","state_url":"https://pith.science/pith/CIXN4QUZYVK7ITRWOALSUQ7YNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIXN4QUZYVK7ITRWOALSUQ7YNI/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-03T08:01:33Z","links":{"resolver":"https://pith.science/pith/CIXN4QUZYVK7ITRWOALSUQ7YNI","bundle":"https://pith.science/pith/CIXN4QUZYVK7ITRWOALSUQ7YNI/bundle.json","state":"https://pith.science/pith/CIXN4QUZYVK7ITRWOALSUQ7YNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIXN4QUZYVK7ITRWOALSUQ7YNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CIXN4QUZYVK7ITRWOALSUQ7YNI","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":"792eb582cc81d9ebb3e3d0cd127ff2f64adafa457a9afd076bf3acdc12aaf278","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-11T03:18:30Z","title_canon_sha256":"c7609541d10f7365680dacecd1ca23a136e03150dfe862efd47eed309e95f84c"},"schema_version":"1.0","source":{"id":"1201.2231","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2231","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2231v2","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2231","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"CIXN4QUZYVK7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CIXN4QUZYVK7ITRW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CIXN4QUZ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:cfc527008bbe5ab41dc80208322cb6cde54183674f56feaadb5dbcd7a7350e08","target":"graph","created_at":"2026-05-18T02:21:18Z","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":"Functional dependence graph (FDG) is an important class of directed graph that captures the dominance relationship among a set of variables. FDG is frequently used in calculating network coding capacity bounds. However, the order of FDG is usually much larger than the original network and the computational complexity of many bounds grows exponentially with the order of FDG. In this paper, we introduce the concept of reduced FDG, which is obtained from the original FDG by keeping only those \"essential\" edges. It is proved that the reduced FDG gives the same capacity region/bounds with the origi","authors_text":"Satyajit Thakor, Xiaoli Xu, Yong Liang Guan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-11T03:18:30Z","title":"Reduced Functional Dependence Graph and Its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2231","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:c50d67be74335481a13b8e6b02c7a0aefc48540f674cbf9b8bde24116a29a5f9","target":"record","created_at":"2026-05-18T02:21:18Z","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":"792eb582cc81d9ebb3e3d0cd127ff2f64adafa457a9afd076bf3acdc12aaf278","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-11T03:18:30Z","title_canon_sha256":"c7609541d10f7365680dacecd1ca23a136e03150dfe862efd47eed309e95f84c"},"schema_version":"1.0","source":{"id":"1201.2231","kind":"arxiv","version":2}},"canonical_sha256":"122ede4299c555f44e3670172a43f86a3fd366a985f451b1758eae261a995df3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"122ede4299c555f44e3670172a43f86a3fd366a985f451b1758eae261a995df3","first_computed_at":"2026-05-18T02:21:18.565833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.565833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+XkE61YrXw2+/KsGWNs0CTryw+u+Ek6BJSIIxlGJU3bR3Ntwxb0S/QsNsBoxl7+wOL3rnjcBarhX4zk2pBCHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.566354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2231","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c50d67be74335481a13b8e6b02c7a0aefc48540f674cbf9b8bde24116a29a5f9","sha256:cfc527008bbe5ab41dc80208322cb6cde54183674f56feaadb5dbcd7a7350e08"],"state_sha256":"ea17eab39fa85eff64a526623bb77821817bf64b141e38b08bb3f5dbaa938c3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHNNy4bxKMTMG+IyeflJF75R2bRbSP64ME238mt3wPjpu0I5hgJ9KHVdrZ448tadzXt3B7CmY6LGqKKtbkcsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:01:33.418625Z","bundle_sha256":"fd3a1a5f0e2f1ec330d505473afebf0bbe9ca9d47c55e71135fa329b1773556a"}}