{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FPG4O42QW7UXWTRRUYUGYZAOE4","short_pith_number":"pith:FPG4O42Q","canonical_record":{"source":{"id":"1312.3072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"815f48fdab31081f861057b776386147ed9988c2c724f0c06e9cbba77bde52d3","abstract_canon_sha256":"5e7ca69571f5c5374faf9f22b00d8bb8c4c49be778efced37a10e896d7e5da97"},"schema_version":"1.0"},"canonical_sha256":"2bcdc77350b7e97b4e31a6286c640e273caab6274d66ea203e64c8efeae37133","source":{"kind":"arxiv","id":"1312.3072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3072","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3072v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3072","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"FPG4O42QW7UX","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FPG4O42QW7UXWTRR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FPG4O42Q","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FPG4O42QW7UXWTRRUYUGYZAOE4","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"815f48fdab31081f861057b776386147ed9988c2c724f0c06e9cbba77bde52d3","abstract_canon_sha256":"5e7ca69571f5c5374faf9f22b00d8bb8c4c49be778efced37a10e896d7e5da97"},"schema_version":"1.0"},"canonical_sha256":"2bcdc77350b7e97b4e31a6286c640e273caab6274d66ea203e64c8efeae37133","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:00.556577Z","signature_b64":"N/9NARKkYaxco7HZunjko05/RJWlBT81E5tusCxlmm91iIAVywy+CGRIIAyZ3mIaAfNqLkMRs+tvb0oessQCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bcdc77350b7e97b4e31a6286c640e273caab6274d66ea203e64c8efeae37133","last_reissued_at":"2026-05-18T03:05:00.555775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:00.555775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3072","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-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qHZqICZJwN8acdoL246OyeJufnuWvOhzNu2GTdCw8AfntZt7hDzgOBCQm5q/Gn9ZBcRl/ENHcWnyZN2dLm7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:40:31.762802Z"},"content_sha256":"b1606dc6281e361d5966399493a431201ea909cdb025044b2d4bf98e7211d334","schema_version":"1.0","event_id":"sha256:b1606dc6281e361d5966399493a431201ea909cdb025044b2d4bf98e7211d334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FPG4O42QW7UXWTRRUYUGYZAOE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forests and Trees among Gallai Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Felix Joos, Van Bang Le","submitted_at":"2013-12-11T08:28:10Z","abstract_excerpt":"The Gallai graph $\\Gamma(G)$ of a graph $G$ has the edges of $G$ as its vertices and two distinct vertices $e$ and $f$ of $\\Gamma(G)$ are adjacent in $\\Gamma(G)$ if the edges $e$ and $f$ of $G$ are adjacent in $G$ but do not span a triangle in $G$. Clearly, $\\Gamma(G)$ is a subgraph of the line graph of $G$. While line graphs can be recognized efficiently the complexity of recognizing Gallai graphs is unknown. In the present paper we characterize those graphs whose Gallai graphs are forests or trees, respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3072","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-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4T5oYb9vUzs95uceoQDc5QSJF+2QFs4WoFB8vSAAK60Xt1bYuxOIew5ej/+Dr1TJFAk0Hd6JcJj3/zqL7vs/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:40:31.763147Z"},"content_sha256":"8bcf13db373a88521a70348d2dbafcb2a8120df10bd69e0d1d300aa57402e44c","schema_version":"1.0","event_id":"sha256:8bcf13db373a88521a70348d2dbafcb2a8120df10bd69e0d1d300aa57402e44c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPG4O42QW7UXWTRRUYUGYZAOE4/bundle.json","state_url":"https://pith.science/pith/FPG4O42QW7UXWTRRUYUGYZAOE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPG4O42QW7UXWTRRUYUGYZAOE4/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-04T05:40:31Z","links":{"resolver":"https://pith.science/pith/FPG4O42QW7UXWTRRUYUGYZAOE4","bundle":"https://pith.science/pith/FPG4O42QW7UXWTRRUYUGYZAOE4/bundle.json","state":"https://pith.science/pith/FPG4O42QW7UXWTRRUYUGYZAOE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPG4O42QW7UXWTRRUYUGYZAOE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FPG4O42QW7UXWTRRUYUGYZAOE4","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":"5e7ca69571f5c5374faf9f22b00d8bb8c4c49be778efced37a10e896d7e5da97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:28:10Z","title_canon_sha256":"815f48fdab31081f861057b776386147ed9988c2c724f0c06e9cbba77bde52d3"},"schema_version":"1.0","source":{"id":"1312.3072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3072","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3072v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3072","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"FPG4O42QW7UX","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FPG4O42QW7UXWTRR","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FPG4O42Q","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:8bcf13db373a88521a70348d2dbafcb2a8120df10bd69e0d1d300aa57402e44c","target":"graph","created_at":"2026-05-18T03:05:00Z","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":"The Gallai graph $\\Gamma(G)$ of a graph $G$ has the edges of $G$ as its vertices and two distinct vertices $e$ and $f$ of $\\Gamma(G)$ are adjacent in $\\Gamma(G)$ if the edges $e$ and $f$ of $G$ are adjacent in $G$ but do not span a triangle in $G$. Clearly, $\\Gamma(G)$ is a subgraph of the line graph of $G$. While line graphs can be recognized efficiently the complexity of recognizing Gallai graphs is unknown. In the present paper we characterize those graphs whose Gallai graphs are forests or trees, respectively.","authors_text":"Dieter Rautenbach, Felix Joos, Van Bang Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:28:10Z","title":"Forests and Trees among Gallai Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3072","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:b1606dc6281e361d5966399493a431201ea909cdb025044b2d4bf98e7211d334","target":"record","created_at":"2026-05-18T03:05:00Z","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":"5e7ca69571f5c5374faf9f22b00d8bb8c4c49be778efced37a10e896d7e5da97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:28:10Z","title_canon_sha256":"815f48fdab31081f861057b776386147ed9988c2c724f0c06e9cbba77bde52d3"},"schema_version":"1.0","source":{"id":"1312.3072","kind":"arxiv","version":1}},"canonical_sha256":"2bcdc77350b7e97b4e31a6286c640e273caab6274d66ea203e64c8efeae37133","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bcdc77350b7e97b4e31a6286c640e273caab6274d66ea203e64c8efeae37133","first_computed_at":"2026-05-18T03:05:00.555775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:00.555775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N/9NARKkYaxco7HZunjko05/RJWlBT81E5tusCxlmm91iIAVywy+CGRIIAyZ3mIaAfNqLkMRs+tvb0oessQCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:00.556577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1606dc6281e361d5966399493a431201ea909cdb025044b2d4bf98e7211d334","sha256:8bcf13db373a88521a70348d2dbafcb2a8120df10bd69e0d1d300aa57402e44c"],"state_sha256":"de1ed63178ccbf67cba7daaffc55758390a1592a44caeee7a60fd38e529ee845"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4DbUHu55EWp3aNKuFgsF6CCljSN+ptloVjn4F7IcT/KpjcBTAgs198ItvnZVKjyNAUvEKpYNC3pz7wdtFxiDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:40:31.765113Z","bundle_sha256":"0e0c0a252e38f54561c93a9016c9fdef3b23f1470eb4399db0a9251577f2e89e"}}