{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LGKB5V6N3OJDW3BADIPAPTK36O","short_pith_number":"pith:LGKB5V6N","canonical_record":{"source":{"id":"1905.05276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-13T20:31:02Z","cross_cats_sorted":["cs.DM","cs.LO","cs.SI","math.GN","math.IT"],"title_canon_sha256":"04de640f1d16082292dca0e5ac641d7797a8476eaa59c3471a10c91c785aa2a3","abstract_canon_sha256":"30037bc5e836fc7725bcea5b64bde332428586b345fd00d2780385493d023178"},"schema_version":"1.0"},"canonical_sha256":"59941ed7cddb923b6c201a1e07cd5bf3b6d65148768e6e9a26569f6a37625ba3","source":{"kind":"arxiv","id":"1905.05276","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05276","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05276v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05276","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"LGKB5V6N3OJD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LGKB5V6N3OJDW3BA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LGKB5V6N","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LGKB5V6N3OJDW3BADIPAPTK36O","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-13T20:31:02Z","cross_cats_sorted":["cs.DM","cs.LO","cs.SI","math.GN","math.IT"],"title_canon_sha256":"04de640f1d16082292dca0e5ac641d7797a8476eaa59c3471a10c91c785aa2a3","abstract_canon_sha256":"30037bc5e836fc7725bcea5b64bde332428586b345fd00d2780385493d023178"},"schema_version":"1.0"},"canonical_sha256":"59941ed7cddb923b6c201a1e07cd5bf3b6d65148768e6e9a26569f6a37625ba3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:16.951471Z","signature_b64":"HOz4spAwAAUhV1T0TXY1dsW+2xq6CbMKnUEadaeXB9M4jff8TjI101RgrHK6XULyYrJdt+y/XWBsQh/jjd75CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59941ed7cddb923b6c201a1e07cd5bf3b6d65148768e6e9a26569f6a37625ba3","last_reissued_at":"2026-05-17T23:46:16.951001Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:16.951001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05276","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-17T23:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epChA+g+jRxRpYJMpU2sv4hEWGpRWcvKKVEzaZrGXT2JoHe9xlBTUspDZkrtZeMCDQ0Xcr1r5l70TKoxRhYXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:29:16.525233Z"},"content_sha256":"ee1991f1431ec6963da4d2b83300fed5c8cfc27c0076d83a65a3001bfd002b7b","schema_version":"1.0","event_id":"sha256:ee1991f1431ec6963da4d2b83300fed5c8cfc27c0076d83a65a3001bfd002b7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LGKB5V6N3OJDW3BADIPAPTK36O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transtemporal edges and crosslayer edges in incompressible high-order networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LO","cs.SI","math.GN","math.IT"],"primary_cat":"cs.IT","authors_text":"Artur Ziviani, Felipe S. Abrah\\~ao, Klaus Wehmuth","submitted_at":"2019-05-13T20:31:02Z","abstract_excerpt":"This work presents some outcomes of a theoretical investigation of incompressible high-order networks defined by a generalized graph representation. We study some of their network topological properties and how these may be related to real-world complex networks. We show that these networks have very short diameter, high k-connectivity, degrees of the order of half of the network size within a strong-asymptotically dominated standard deviation, and rigidity with respect to automorphisms. In addition, we demonstrate that incompressible dynamic (or dynamic multilayered) networks have transtempor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05276","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-17T23:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJHtn4GC2w6vLoTPjdjfBwW0VlOpoOHDXOcNBbVk+8v08mPV/1hqV1reL3oimPwAcUZ+R7D1trWpbiQ3RDQGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:29:16.525916Z"},"content_sha256":"1694ed1457dab0ec71783df61ad85049cad7a96c5c2ee15cde7e080baf756157","schema_version":"1.0","event_id":"sha256:1694ed1457dab0ec71783df61ad85049cad7a96c5c2ee15cde7e080baf756157"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGKB5V6N3OJDW3BADIPAPTK36O/bundle.json","state_url":"https://pith.science/pith/LGKB5V6N3OJDW3BADIPAPTK36O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGKB5V6N3OJDW3BADIPAPTK36O/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-05T06:29:16Z","links":{"resolver":"https://pith.science/pith/LGKB5V6N3OJDW3BADIPAPTK36O","bundle":"https://pith.science/pith/LGKB5V6N3OJDW3BADIPAPTK36O/bundle.json","state":"https://pith.science/pith/LGKB5V6N3OJDW3BADIPAPTK36O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGKB5V6N3OJDW3BADIPAPTK36O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LGKB5V6N3OJDW3BADIPAPTK36O","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":"30037bc5e836fc7725bcea5b64bde332428586b345fd00d2780385493d023178","cross_cats_sorted":["cs.DM","cs.LO","cs.SI","math.GN","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-13T20:31:02Z","title_canon_sha256":"04de640f1d16082292dca0e5ac641d7797a8476eaa59c3471a10c91c785aa2a3"},"schema_version":"1.0","source":{"id":"1905.05276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05276","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05276v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05276","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"LGKB5V6N3OJD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LGKB5V6N3OJDW3BA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LGKB5V6N","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:1694ed1457dab0ec71783df61ad85049cad7a96c5c2ee15cde7e080baf756157","target":"graph","created_at":"2026-05-17T23:46:16Z","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":"This work presents some outcomes of a theoretical investigation of incompressible high-order networks defined by a generalized graph representation. We study some of their network topological properties and how these may be related to real-world complex networks. We show that these networks have very short diameter, high k-connectivity, degrees of the order of half of the network size within a strong-asymptotically dominated standard deviation, and rigidity with respect to automorphisms. In addition, we demonstrate that incompressible dynamic (or dynamic multilayered) networks have transtempor","authors_text":"Artur Ziviani, Felipe S. Abrah\\~ao, Klaus Wehmuth","cross_cats":["cs.DM","cs.LO","cs.SI","math.GN","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-13T20:31:02Z","title":"Transtemporal edges and crosslayer edges in incompressible high-order networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05276","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:ee1991f1431ec6963da4d2b83300fed5c8cfc27c0076d83a65a3001bfd002b7b","target":"record","created_at":"2026-05-17T23:46:16Z","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":"30037bc5e836fc7725bcea5b64bde332428586b345fd00d2780385493d023178","cross_cats_sorted":["cs.DM","cs.LO","cs.SI","math.GN","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-13T20:31:02Z","title_canon_sha256":"04de640f1d16082292dca0e5ac641d7797a8476eaa59c3471a10c91c785aa2a3"},"schema_version":"1.0","source":{"id":"1905.05276","kind":"arxiv","version":1}},"canonical_sha256":"59941ed7cddb923b6c201a1e07cd5bf3b6d65148768e6e9a26569f6a37625ba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59941ed7cddb923b6c201a1e07cd5bf3b6d65148768e6e9a26569f6a37625ba3","first_computed_at":"2026-05-17T23:46:16.951001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:16.951001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HOz4spAwAAUhV1T0TXY1dsW+2xq6CbMKnUEadaeXB9M4jff8TjI101RgrHK6XULyYrJdt+y/XWBsQh/jjd75CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:16.951471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee1991f1431ec6963da4d2b83300fed5c8cfc27c0076d83a65a3001bfd002b7b","sha256:1694ed1457dab0ec71783df61ad85049cad7a96c5c2ee15cde7e080baf756157"],"state_sha256":"8718237446b44184f86d3fb31a41b508c9e680bbdc5f1ad3a25939d0ebf88119"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeGe9sSxm19mMFum9AYw9/Q4pWNT0fc6q4Y9azbWT9bLJjB5W/H6B4CHnmIAHzn9lJKXQWC6c+aPpwkr2cXoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:29:16.529577Z","bundle_sha256":"3d784585482641f492695c8b38b276e615de458abc089aa5d627162a40b05f51"}}