{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:L6JTFX3PMYEXB7UZFYEZK7VCY6","short_pith_number":"pith:L6JTFX3P","canonical_record":{"source":{"id":"2404.19453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-04-30T11:10:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"93c906857b7990574fc1547df49ea8f0ea4e83d319fb14a2aef6a5c011b050b0","abstract_canon_sha256":"6366b8c872fb9aff174c63961587f5259e063dfe1ed054edbeed1b78af7d66dd"},"schema_version":"1.0"},"canonical_sha256":"5f9332df6f660970fe992e09957ea2c788f8189a55fc578d43fdc1bfe263d8de","source":{"kind":"arxiv","id":"2404.19453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.19453","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"2404.19453v1","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19453","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"L6JTFX3PMYEX","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"pith_short_16","alias_value":"L6JTFX3PMYEXB7UZ","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"pith_short_8","alias_value":"L6JTFX3P","created_at":"2026-07-05T09:37:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:L6JTFX3PMYEXB7UZFYEZK7VCY6","target":"record","payload":{"canonical_record":{"source":{"id":"2404.19453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-04-30T11:10:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"93c906857b7990574fc1547df49ea8f0ea4e83d319fb14a2aef6a5c011b050b0","abstract_canon_sha256":"6366b8c872fb9aff174c63961587f5259e063dfe1ed054edbeed1b78af7d66dd"},"schema_version":"1.0"},"canonical_sha256":"5f9332df6f660970fe992e09957ea2c788f8189a55fc578d43fdc1bfe263d8de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:36.965558Z","signature_b64":"z0jWlki4o14wZCwyrMihb+FYheO2erqpF+DG8zRQOeawRLdez11SWquGeN2ZOrER7rFNv7HoRqfgNHMRJ4g7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f9332df6f660970fe992e09957ea2c788f8189a55fc578d43fdc1bfe263d8de","last_reissued_at":"2026-07-05T09:37:36.965127Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:36.965127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.19453","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-07-05T09:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7A1EtV81Y6EwK3GH1kj/+VDxG5XrraKqU/GDD169/GXVb1uJEWVf3vX2XbVr3tro6HWqytiD2YkCmoIpepNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:06:06.138057Z"},"content_sha256":"09816d6bda505c0530c1815bf1905e360484558e24fc297463924ccaee91b565","schema_version":"1.0","event_id":"sha256:09816d6bda505c0530c1815bf1905e360484558e24fc297463924ccaee91b565"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:L6JTFX3PMYEXB7UZFYEZK7VCY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Parameters for Dense Temporal Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jessica Enright, Kitty Meeks, Laura Larios-Jones, Samuel D. Hand","submitted_at":"2024-04-30T11:10:25Z","abstract_excerpt":"Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has been recent progress in defining structural parameters which describe tractable cases by simultaneously restricting the underlying structure and the times at which edges appear in the graph. These all rely on the temporal graph being sparse in some sense. We introduce temporal analogues of three increasingly restrictive static graph parameters -- cliquewidth, modular-width and neighbourhood diversity -- which take sm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19453","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.19453/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:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6rvn/QnfNqs5iHkFdgpTpKbP0+IFlT6sakOrXrWD27wTt+EcHlrndY2H3TIaAXEDfT+n16dH4wInjHx0oL89AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:06:06.139226Z"},"content_sha256":"abc3a12c67d9b67b6f53711a3127210ca225be3946b63be71bca4e64d938f2b0","schema_version":"1.0","event_id":"sha256:abc3a12c67d9b67b6f53711a3127210ca225be3946b63be71bca4e64d938f2b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6JTFX3PMYEXB7UZFYEZK7VCY6/bundle.json","state_url":"https://pith.science/pith/L6JTFX3PMYEXB7UZFYEZK7VCY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6JTFX3PMYEXB7UZFYEZK7VCY6/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-04T14:06:06Z","links":{"resolver":"https://pith.science/pith/L6JTFX3PMYEXB7UZFYEZK7VCY6","bundle":"https://pith.science/pith/L6JTFX3PMYEXB7UZFYEZK7VCY6/bundle.json","state":"https://pith.science/pith/L6JTFX3PMYEXB7UZFYEZK7VCY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6JTFX3PMYEXB7UZFYEZK7VCY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:L6JTFX3PMYEXB7UZFYEZK7VCY6","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":"6366b8c872fb9aff174c63961587f5259e063dfe1ed054edbeed1b78af7d66dd","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-04-30T11:10:25Z","title_canon_sha256":"93c906857b7990574fc1547df49ea8f0ea4e83d319fb14a2aef6a5c011b050b0"},"schema_version":"1.0","source":{"id":"2404.19453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.19453","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"2404.19453v1","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19453","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"L6JTFX3PMYEX","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"pith_short_16","alias_value":"L6JTFX3PMYEXB7UZ","created_at":"2026-07-05T09:37:36Z"},{"alias_kind":"pith_short_8","alias_value":"L6JTFX3P","created_at":"2026-07-05T09:37:36Z"}],"graph_snapshots":[{"event_id":"sha256:abc3a12c67d9b67b6f53711a3127210ca225be3946b63be71bca4e64d938f2b0","target":"graph","created_at":"2026-07-05T09:37:36Z","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/2404.19453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has been recent progress in defining structural parameters which describe tractable cases by simultaneously restricting the underlying structure and the times at which edges appear in the graph. These all rely on the temporal graph being sparse in some sense. We introduce temporal analogues of three increasingly restrictive static graph parameters -- cliquewidth, modular-width and neighbourhood diversity -- which take sm","authors_text":"Jessica Enright, Kitty Meeks, Laura Larios-Jones, Samuel D. Hand","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-04-30T11:10:25Z","title":"Structural Parameters for Dense Temporal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19453","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:09816d6bda505c0530c1815bf1905e360484558e24fc297463924ccaee91b565","target":"record","created_at":"2026-07-05T09:37:36Z","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":"6366b8c872fb9aff174c63961587f5259e063dfe1ed054edbeed1b78af7d66dd","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-04-30T11:10:25Z","title_canon_sha256":"93c906857b7990574fc1547df49ea8f0ea4e83d319fb14a2aef6a5c011b050b0"},"schema_version":"1.0","source":{"id":"2404.19453","kind":"arxiv","version":1}},"canonical_sha256":"5f9332df6f660970fe992e09957ea2c788f8189a55fc578d43fdc1bfe263d8de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f9332df6f660970fe992e09957ea2c788f8189a55fc578d43fdc1bfe263d8de","first_computed_at":"2026-07-05T09:37:36.965127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:36.965127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z0jWlki4o14wZCwyrMihb+FYheO2erqpF+DG8zRQOeawRLdez11SWquGeN2ZOrER7rFNv7HoRqfgNHMRJ4g7Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:36.965558Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.19453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09816d6bda505c0530c1815bf1905e360484558e24fc297463924ccaee91b565","sha256:abc3a12c67d9b67b6f53711a3127210ca225be3946b63be71bca4e64d938f2b0"],"state_sha256":"33bdf3ec1cabf145806f6700843cdad51b2f866485452357c365291e4544e4f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2rTeIskuJ+8VVhv1rl0j3Kko7qmzSoz50xJzDV7S/EfUSEuuD+kd2tCyuXJCgdU2mzEXZrfgjRa4bh0SacxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:06:06.189432Z","bundle_sha256":"cc9daa681d82717903cb751ebe7009fb0b50c79d385c19fc3d1554ca0b0257fe"}}