{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MRWQC44T3755WDT5Y745WGEQE5","short_pith_number":"pith:MRWQC44T","canonical_record":{"source":{"id":"2502.01077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-02-03T05:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"54b1e90e19fd3c35e2971f7e8657a0b0d93eb2b19e9564efe8bd811ea144d37d","abstract_canon_sha256":"2bf9ca54e3be683bbeeb8c99ac6ba765e79db9d27d20474857001d241a30abf0"},"schema_version":"1.0"},"canonical_sha256":"646d017393dffbdb0e7dc7f9db1890274c3fbb664fcee1c6af9beb5233a136d4","source":{"kind":"arxiv","id":"2502.01077","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01077","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01077v2","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01077","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"MRWQC44T3755","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"pith_short_16","alias_value":"MRWQC44T3755WDT5","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"pith_short_8","alias_value":"MRWQC44T","created_at":"2026-07-05T11:36:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MRWQC44T3755WDT5Y745WGEQE5","target":"record","payload":{"canonical_record":{"source":{"id":"2502.01077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-02-03T05:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"54b1e90e19fd3c35e2971f7e8657a0b0d93eb2b19e9564efe8bd811ea144d37d","abstract_canon_sha256":"2bf9ca54e3be683bbeeb8c99ac6ba765e79db9d27d20474857001d241a30abf0"},"schema_version":"1.0"},"canonical_sha256":"646d017393dffbdb0e7dc7f9db1890274c3fbb664fcee1c6af9beb5233a136d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:27.673125Z","signature_b64":"VmlxzPzbIB2JF/FK00Nj7jBm1Vjy8AGDKceYfnRVU952a1MTwFlkEn9ay3qdGH6BVSzuZbZtOFETWgCjTZ5QCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"646d017393dffbdb0e7dc7f9db1890274c3fbb664fcee1c6af9beb5233a136d4","last_reissued_at":"2026-07-05T11:36:27.672674Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:27.672674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.01077","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-07-05T11:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJC34v0twZsKUV1a0hxiGRge2+ZViN79wl8RllU+lXmePKQriNzYDa8PfZ6zg+MXgLwAKasVag25RbV4qDyKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:21:27.915288Z"},"content_sha256":"ca4ba9582b79e7ecac84d74e3b27061409d0080a857b8ccd6356d0bb4ae59a92","schema_version":"1.0","event_id":"sha256:ca4ba9582b79e7ecac84d74e3b27061409d0080a857b8ccd6356d0bb4ae59a92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MRWQC44T3755WDT5Y745WGEQE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for Fractional Matrix Programming Problems with Applications in FBL MU-MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Eduard Jorswieck, Lajos Hanzo, Mohammad Soleymani, Robert Schober","submitted_at":"2025-02-03T05:37:15Z","abstract_excerpt":"An efficient framework is conceived for fractional matrix programming (FMP) optimization problems (OPs) namely for minimization and maximization. In each generic OP, either the objective or the constraints are functions of multiple arbitrary continuous-domain fractional functions (FFs). This ensures the framework's versatility, enabling it to solve a broader range of OPs than classical FMP solvers, like Dinkelbach-based algorithms. Specifically, the generalized Dinkelbach algorithm can only solve multiple-ratio FMP problems. By contrast, our framework solves OPs associated with a sum or produc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01077","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.01077/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-05T11:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXPYO60Ht9IV30506NdR7Jue4eMOHMlXNpfunchfVDUXipLpjtSSpBgXFObBqsGdu8GeAabOhSDAKh2GuhXJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:21:27.915654Z"},"content_sha256":"c19116fedca2656bde88b8ecc664e3457aa4e78b6dc056ac5a14dfc7a3a02287","schema_version":"1.0","event_id":"sha256:c19116fedca2656bde88b8ecc664e3457aa4e78b6dc056ac5a14dfc7a3a02287"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRWQC44T3755WDT5Y745WGEQE5/bundle.json","state_url":"https://pith.science/pith/MRWQC44T3755WDT5Y745WGEQE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRWQC44T3755WDT5Y745WGEQE5/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-08-04T23:21:27Z","links":{"resolver":"https://pith.science/pith/MRWQC44T3755WDT5Y745WGEQE5","bundle":"https://pith.science/pith/MRWQC44T3755WDT5Y745WGEQE5/bundle.json","state":"https://pith.science/pith/MRWQC44T3755WDT5Y745WGEQE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRWQC44T3755WDT5Y745WGEQE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MRWQC44T3755WDT5Y745WGEQE5","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":"2bf9ca54e3be683bbeeb8c99ac6ba765e79db9d27d20474857001d241a30abf0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-02-03T05:37:15Z","title_canon_sha256":"54b1e90e19fd3c35e2971f7e8657a0b0d93eb2b19e9564efe8bd811ea144d37d"},"schema_version":"1.0","source":{"id":"2502.01077","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01077","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01077v2","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01077","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"MRWQC44T3755","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"pith_short_16","alias_value":"MRWQC44T3755WDT5","created_at":"2026-07-05T11:36:27Z"},{"alias_kind":"pith_short_8","alias_value":"MRWQC44T","created_at":"2026-07-05T11:36:27Z"}],"graph_snapshots":[{"event_id":"sha256:c19116fedca2656bde88b8ecc664e3457aa4e78b6dc056ac5a14dfc7a3a02287","target":"graph","created_at":"2026-07-05T11:36:27Z","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/2502.01077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An efficient framework is conceived for fractional matrix programming (FMP) optimization problems (OPs) namely for minimization and maximization. In each generic OP, either the objective or the constraints are functions of multiple arbitrary continuous-domain fractional functions (FFs). This ensures the framework's versatility, enabling it to solve a broader range of OPs than classical FMP solvers, like Dinkelbach-based algorithms. Specifically, the generalized Dinkelbach algorithm can only solve multiple-ratio FMP problems. By contrast, our framework solves OPs associated with a sum or produc","authors_text":"Eduard Jorswieck, Lajos Hanzo, Mohammad Soleymani, Robert Schober","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-02-03T05:37:15Z","title":"A Framework for Fractional Matrix Programming Problems with Applications in FBL MU-MIMO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01077","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:ca4ba9582b79e7ecac84d74e3b27061409d0080a857b8ccd6356d0bb4ae59a92","target":"record","created_at":"2026-07-05T11:36:27Z","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":"2bf9ca54e3be683bbeeb8c99ac6ba765e79db9d27d20474857001d241a30abf0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-02-03T05:37:15Z","title_canon_sha256":"54b1e90e19fd3c35e2971f7e8657a0b0d93eb2b19e9564efe8bd811ea144d37d"},"schema_version":"1.0","source":{"id":"2502.01077","kind":"arxiv","version":2}},"canonical_sha256":"646d017393dffbdb0e7dc7f9db1890274c3fbb664fcee1c6af9beb5233a136d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"646d017393dffbdb0e7dc7f9db1890274c3fbb664fcee1c6af9beb5233a136d4","first_computed_at":"2026-07-05T11:36:27.672674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:27.672674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VmlxzPzbIB2JF/FK00Nj7jBm1Vjy8AGDKceYfnRVU952a1MTwFlkEn9ay3qdGH6BVSzuZbZtOFETWgCjTZ5QCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:27.673125Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01077","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca4ba9582b79e7ecac84d74e3b27061409d0080a857b8ccd6356d0bb4ae59a92","sha256:c19116fedca2656bde88b8ecc664e3457aa4e78b6dc056ac5a14dfc7a3a02287"],"state_sha256":"367cc5791808ebde569d8b8536ec1b22603991a8c591e04ee448ec75112bd774"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twtLRfjkzGXAzFWenTWZ+hDY7EMWkwME1EQvYvl2A5AWs+hoLQTdzHkATeg/AuQyf1P1f634qVa4BrlUYcp3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T23:21:27.919196Z","bundle_sha256":"9bb151017623b3b290944e93ef7d96f3242734cfb9c4c0432aab2ca028e789d1"}}