{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M2BLQCXNEMQKQX6UKJQKMOTVSC","short_pith_number":"pith:M2BLQCXN","canonical_record":{"source":{"id":"1904.06923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T09:22:41Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"2d740dd0fa5297a2fd54dc42c4f62f5f316d2bc41c5f030a9a3ada179414e0ff","abstract_canon_sha256":"5761f932c3d037b15cb13d35e080835940c617389319b11894a4408b544fc5a0"},"schema_version":"1.0"},"canonical_sha256":"6682b80aed2320a85fd45260a63a75908bdace818e2ca18854362b259c7a6184","source":{"kind":"arxiv","id":"1904.06923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06923","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06923v1","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06923","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"M2BLQCXNEMQK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M2BLQCXNEMQKQX6U","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M2BLQCXN","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M2BLQCXNEMQKQX6UKJQKMOTVSC","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T09:22:41Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"2d740dd0fa5297a2fd54dc42c4f62f5f316d2bc41c5f030a9a3ada179414e0ff","abstract_canon_sha256":"5761f932c3d037b15cb13d35e080835940c617389319b11894a4408b544fc5a0"},"schema_version":"1.0"},"canonical_sha256":"6682b80aed2320a85fd45260a63a75908bdace818e2ca18854362b259c7a6184","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:35.755442Z","signature_b64":"HSfs623h1Se3dYjK1YYcGUaQ3bD9HRA9dWegu5/WIN4CM/4/EZlHKjwRCNv7f7Y9PCbRNlofHLWTs5ttSrG+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6682b80aed2320a85fd45260a63a75908bdace818e2ca18854362b259c7a6184","last_reissued_at":"2026-05-17T23:48:35.754214Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:35.754214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06923","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:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykpWncoBiENPqYEI03dBK0sZXW5f1Jlve+RqzBCDQ9QpBHQw0PUmbMEH7JHH32DB4z5ErovaLsg68bN1Zb9jAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:45:00.224745Z"},"content_sha256":"fc7e9435fe83c31af89efb17d56161609fafc133984fb508b2861d7a09d902c6","schema_version":"1.0","event_id":"sha256:fc7e9435fe83c31af89efb17d56161609fafc133984fb508b2861d7a09d902c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M2BLQCXNEMQKQX6UKJQKMOTVSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some results on double triangle descendants of $K_5$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Karen Yeats, Marni Mishna, Mohamed Laradji","submitted_at":"2019-04-15T09:22:41Z","abstract_excerpt":"Double triangle expansion is an operation on $4$-regular graphs with at least one triangle which replaces a triangle with two triangles in a particular way. We study the class of graphs which can be obtained by repeated double triangle expansion beginning with the complete graph $K_5$. These are called double triangle descendants of $K_5$. We enumerate, with explicit rational generating functions, those double triangle descendants of $K_5$ with at most four more vertices than triangles. We also prove that the minimum number of triangles in any $K_5$ descendant is four. Double triangle descenda"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06923","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:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7bEgEyx2YSOEI14sRcTMrcjGaSfZgncrEU124fbQknM3SQZ9u4rRV8kVgQgbTYoRgW6SXTfjLx23zAF0EuzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:45:00.225087Z"},"content_sha256":"2b5d6cc42e21ac3a2df348f4f614c06b48e6fb483553d4d2d609af8dffa9d654","schema_version":"1.0","event_id":"sha256:2b5d6cc42e21ac3a2df348f4f614c06b48e6fb483553d4d2d609af8dffa9d654"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2BLQCXNEMQKQX6UKJQKMOTVSC/bundle.json","state_url":"https://pith.science/pith/M2BLQCXNEMQKQX6UKJQKMOTVSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2BLQCXNEMQKQX6UKJQKMOTVSC/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-24T11:45:00Z","links":{"resolver":"https://pith.science/pith/M2BLQCXNEMQKQX6UKJQKMOTVSC","bundle":"https://pith.science/pith/M2BLQCXNEMQKQX6UKJQKMOTVSC/bundle.json","state":"https://pith.science/pith/M2BLQCXNEMQKQX6UKJQKMOTVSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2BLQCXNEMQKQX6UKJQKMOTVSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M2BLQCXNEMQKQX6UKJQKMOTVSC","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":"5761f932c3d037b15cb13d35e080835940c617389319b11894a4408b544fc5a0","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T09:22:41Z","title_canon_sha256":"2d740dd0fa5297a2fd54dc42c4f62f5f316d2bc41c5f030a9a3ada179414e0ff"},"schema_version":"1.0","source":{"id":"1904.06923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06923","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06923v1","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06923","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"M2BLQCXNEMQK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M2BLQCXNEMQKQX6U","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M2BLQCXN","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2b5d6cc42e21ac3a2df348f4f614c06b48e6fb483553d4d2d609af8dffa9d654","target":"graph","created_at":"2026-05-17T23:48:35Z","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":"Double triangle expansion is an operation on $4$-regular graphs with at least one triangle which replaces a triangle with two triangles in a particular way. We study the class of graphs which can be obtained by repeated double triangle expansion beginning with the complete graph $K_5$. These are called double triangle descendants of $K_5$. We enumerate, with explicit rational generating functions, those double triangle descendants of $K_5$ with at most four more vertices than triangles. We also prove that the minimum number of triangles in any $K_5$ descendant is four. Double triangle descenda","authors_text":"Karen Yeats, Marni Mishna, Mohamed Laradji","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T09:22:41Z","title":"Some results on double triangle descendants of $K_5$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06923","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:fc7e9435fe83c31af89efb17d56161609fafc133984fb508b2861d7a09d902c6","target":"record","created_at":"2026-05-17T23:48:35Z","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":"5761f932c3d037b15cb13d35e080835940c617389319b11894a4408b544fc5a0","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-15T09:22:41Z","title_canon_sha256":"2d740dd0fa5297a2fd54dc42c4f62f5f316d2bc41c5f030a9a3ada179414e0ff"},"schema_version":"1.0","source":{"id":"1904.06923","kind":"arxiv","version":1}},"canonical_sha256":"6682b80aed2320a85fd45260a63a75908bdace818e2ca18854362b259c7a6184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6682b80aed2320a85fd45260a63a75908bdace818e2ca18854362b259c7a6184","first_computed_at":"2026-05-17T23:48:35.754214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:35.754214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HSfs623h1Se3dYjK1YYcGUaQ3bD9HRA9dWegu5/WIN4CM/4/EZlHKjwRCNv7f7Y9PCbRNlofHLWTs5ttSrG+Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:35.755442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc7e9435fe83c31af89efb17d56161609fafc133984fb508b2861d7a09d902c6","sha256:2b5d6cc42e21ac3a2df348f4f614c06b48e6fb483553d4d2d609af8dffa9d654"],"state_sha256":"e6ffb759b3b3d7e6c4991172face7db4d9901773d2f3877349b48a442da32a98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47TyJw0/u8TJdVsR/twTxUBAeRUaoDRrm1lFk2pjJWuJ1GsyxhdLQ0MF8D/P8Uv1tcSN7empxHeF2cINek4DAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T11:45:00.227024Z","bundle_sha256":"a5a7de4e28accd6a0909bf9d42c8170a317f4dadf086975920040501e0be8de4"}}