{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TQHYKYFSE6HMC2YWJNNJSSISHK","short_pith_number":"pith:TQHYKYFS","canonical_record":{"source":{"id":"2401.03652","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T03:47:18Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"beb327432144358166f9f9fe6b648899ccfb06381a7cd7142d2a7e45aa920c07","abstract_canon_sha256":"b415a159f2266a08d8f2373bf0406e5f6035e8afa841b4a8f3281a9e03b26201"},"schema_version":"1.0"},"canonical_sha256":"9c0f8560b2278ec16b164b5a9949123ab9cad5f40d1b8bf44fb41846aee50d6c","source":{"kind":"arxiv","id":"2401.03652","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.03652","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"2401.03652v3","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.03652","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"TQHYKYFSE6HM","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"TQHYKYFSE6HMC2YW","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"TQHYKYFS","created_at":"2026-07-05T09:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TQHYKYFSE6HMC2YWJNNJSSISHK","target":"record","payload":{"canonical_record":{"source":{"id":"2401.03652","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T03:47:18Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"beb327432144358166f9f9fe6b648899ccfb06381a7cd7142d2a7e45aa920c07","abstract_canon_sha256":"b415a159f2266a08d8f2373bf0406e5f6035e8afa841b4a8f3281a9e03b26201"},"schema_version":"1.0"},"canonical_sha256":"9c0f8560b2278ec16b164b5a9949123ab9cad5f40d1b8bf44fb41846aee50d6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:48.567926Z","signature_b64":"Y6oQe5vogH0xIklVpIponAB5rWVAez2jSHUkkaXBiUsEIj1PeTgueWCZq9TY4KKKiLFcsWQ7BqY0DNTLPPKsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c0f8560b2278ec16b164b5a9949123ab9cad5f40d1b8bf44fb41846aee50d6c","last_reissued_at":"2026-07-05T09:30:48.567379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:48.567379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.03652","source_version":3,"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-05T09:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MJTtUmH0lW8tqEP8YO6jqVFjNUbPgVunmDa5gWMXRi4U1vhIIpJOI7xYkt0QPq6GC1WXDb6U5BlSZJk9RNtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:39:10.316338Z"},"content_sha256":"6a68880f91e84a4206993a13f919ca80a033fad2def06249392147604d8c8027","schema_version":"1.0","event_id":"sha256:6a68880f91e84a4206993a13f919ca80a033fad2def06249392147604d8c8027"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TQHYKYFSE6HMC2YWJNNJSSISHK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Metzler positive systems on hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Guofeng Zhang, Hildeberto Jard\\'on-Kojakhmetov, Ming Cao, Shaoxuan Cui","submitted_at":"2024-01-08T03:47:18Z","abstract_excerpt":"In graph-theoretical terms, an edge in a graph connects two vertices while a hyperedge of a hypergraph connects any more than one vertices. If the hypergraph's hyperedges further connect the same number of vertices, it is said to be uniform. In algebraic graph theory, a graph can be characterized by an adjacency matrix, and similarly, a uniform hypergraph can be characterized by an adjacency tensor. This similarity enables us to extend existing tools of matrix analysis for studying dynamical systems evolving on graphs to the study of a class of polynomial dynamical systems evolving on hypergra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.03652","kind":"arxiv","version":3},"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/2401.03652/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-05T09:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQJFAOFWn/fwgMbI53nclYeTEj7Pi21wLOJ1GeJC/yMndUsyg7HijdHKC1e8/lflhbkBWiNt5xwgqyDUlRiWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:39:10.316721Z"},"content_sha256":"d367ab0caf386ad9f86ab1d8bb1dc3be875e29b4368f8e238af9808ba4641f3a","schema_version":"1.0","event_id":"sha256:d367ab0caf386ad9f86ab1d8bb1dc3be875e29b4368f8e238af9808ba4641f3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQHYKYFSE6HMC2YWJNNJSSISHK/bundle.json","state_url":"https://pith.science/pith/TQHYKYFSE6HMC2YWJNNJSSISHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQHYKYFSE6HMC2YWJNNJSSISHK/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-07-07T13:39:10Z","links":{"resolver":"https://pith.science/pith/TQHYKYFSE6HMC2YWJNNJSSISHK","bundle":"https://pith.science/pith/TQHYKYFSE6HMC2YWJNNJSSISHK/bundle.json","state":"https://pith.science/pith/TQHYKYFSE6HMC2YWJNNJSSISHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQHYKYFSE6HMC2YWJNNJSSISHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TQHYKYFSE6HMC2YWJNNJSSISHK","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":"b415a159f2266a08d8f2373bf0406e5f6035e8afa841b4a8f3281a9e03b26201","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T03:47:18Z","title_canon_sha256":"beb327432144358166f9f9fe6b648899ccfb06381a7cd7142d2a7e45aa920c07"},"schema_version":"1.0","source":{"id":"2401.03652","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.03652","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"2401.03652v3","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.03652","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"TQHYKYFSE6HM","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"TQHYKYFSE6HMC2YW","created_at":"2026-07-05T09:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"TQHYKYFS","created_at":"2026-07-05T09:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:d367ab0caf386ad9f86ab1d8bb1dc3be875e29b4368f8e238af9808ba4641f3a","target":"graph","created_at":"2026-07-05T09:30:48Z","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/2401.03652/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In graph-theoretical terms, an edge in a graph connects two vertices while a hyperedge of a hypergraph connects any more than one vertices. If the hypergraph's hyperedges further connect the same number of vertices, it is said to be uniform. In algebraic graph theory, a graph can be characterized by an adjacency matrix, and similarly, a uniform hypergraph can be characterized by an adjacency tensor. This similarity enables us to extend existing tools of matrix analysis for studying dynamical systems evolving on graphs to the study of a class of polynomial dynamical systems evolving on hypergra","authors_text":"Guofeng Zhang, Hildeberto Jard\\'on-Kojakhmetov, Ming Cao, Shaoxuan Cui","cross_cats":["cs.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T03:47:18Z","title":"On Metzler positive systems on hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.03652","kind":"arxiv","version":3},"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:6a68880f91e84a4206993a13f919ca80a033fad2def06249392147604d8c8027","target":"record","created_at":"2026-07-05T09:30:48Z","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":"b415a159f2266a08d8f2373bf0406e5f6035e8afa841b4a8f3281a9e03b26201","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T03:47:18Z","title_canon_sha256":"beb327432144358166f9f9fe6b648899ccfb06381a7cd7142d2a7e45aa920c07"},"schema_version":"1.0","source":{"id":"2401.03652","kind":"arxiv","version":3}},"canonical_sha256":"9c0f8560b2278ec16b164b5a9949123ab9cad5f40d1b8bf44fb41846aee50d6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c0f8560b2278ec16b164b5a9949123ab9cad5f40d1b8bf44fb41846aee50d6c","first_computed_at":"2026-07-05T09:30:48.567379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:30:48.567379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y6oQe5vogH0xIklVpIponAB5rWVAez2jSHUkkaXBiUsEIj1PeTgueWCZq9TY4KKKiLFcsWQ7BqY0DNTLPPKsAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:30:48.567926Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.03652","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a68880f91e84a4206993a13f919ca80a033fad2def06249392147604d8c8027","sha256:d367ab0caf386ad9f86ab1d8bb1dc3be875e29b4368f8e238af9808ba4641f3a"],"state_sha256":"250d3598d825934544ff298a01ea791aec280f400f2379b0a72d49fee41b864f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSD921aUfUh+pDdW7wjqAIA7MkFqtg1nurRsNhag5mPaEJtV3Z/PYMS4+OodNADxh7Fioq8stCLq8Coc8PTxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:39:10.318692Z","bundle_sha256":"7c65b2ef38fe2dee8238cd8858de3a978638ae07f5dfe581ba7d484092c5ac88"}}