{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PH5KZP23R3L3PCSEVEH6Y7LL5A","short_pith_number":"pith:PH5KZP23","canonical_record":{"source":{"id":"1508.06889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-27T15:00:19Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"5f25a271c3fca53cb35acf1a36c7d208671f67c47ed051f73e4054f9a2f61931","abstract_canon_sha256":"83f47e09fc1008c7839721c4d417d3dca2c20a6e2daaecb2382bdf13b515fa7a"},"schema_version":"1.0"},"canonical_sha256":"79faacbf5b8ed7b78a44a90fec7d6be829c47ecf2f57fdcee4edc388e554eb18","source":{"kind":"arxiv","id":"1508.06889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06889","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06889v1","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06889","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"pith_short_12","alias_value":"PH5KZP23R3L3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PH5KZP23R3L3PCSE","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PH5KZP23","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PH5KZP23R3L3PCSEVEH6Y7LL5A","target":"record","payload":{"canonical_record":{"source":{"id":"1508.06889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-27T15:00:19Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"5f25a271c3fca53cb35acf1a36c7d208671f67c47ed051f73e4054f9a2f61931","abstract_canon_sha256":"83f47e09fc1008c7839721c4d417d3dca2c20a6e2daaecb2382bdf13b515fa7a"},"schema_version":"1.0"},"canonical_sha256":"79faacbf5b8ed7b78a44a90fec7d6be829c47ecf2f57fdcee4edc388e554eb18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:40.635304Z","signature_b64":"hCfhLzsuh9a9U1pZtnpQUndc6moLU/i4HAURGnQ91RucN12JWZGx+cLeXWoOiJKeHEm949lJLPbUzKISJ8CWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79faacbf5b8ed7b78a44a90fec7d6be829c47ecf2f57fdcee4edc388e554eb18","last_reissued_at":"2026-05-18T01:34:40.634610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:40.634610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.06889","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-18T01:34:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDQyHCbzYRmadMT8P48w9FpEGNjHuPPkGGUPkzUIEHdbizEs3/yXRisJiN2gTCH2DHEn15WRInDvAMuiVP6JAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:25.265420Z"},"content_sha256":"27d106663396f50615317913bff38a0a2749650a38a4a2e0a9ed3e8e69330faa","schema_version":"1.0","event_id":"sha256:27d106663396f50615317913bff38a0a2749650a38a4a2e0a9ed3e8e69330faa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PH5KZP23R3L3PCSEVEH6Y7LL5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of the Clar number problem and an FPT algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.DM","authors_text":"Attila Bern\\'ath, Erika R. B\\'erczi-Kov\\'acs","submitted_at":"2015-08-27T15:00:19Z","abstract_excerpt":"The Clar number of a (hydro)carbon molecule, introduced by Clar [E. Clar, \\emph{The aromatic sextet}, (1972).], is the maximum number of mutually disjoint resonant hexagons in the molecule. Calculating the Clar number can be formulated as an optimization problem on 2-connected planar graphs. Namely, it is the maximum number of mutually disjoint even faces a perfect matching can simultaneously alternate on. It was proved by Abeledo and Atkinson [H. G. Abeledo and G. W. Atkinson, \\emph{Unimodularity of the clar number problem}, Linear algebra and its applications \\textbf{420} (2007), no. 2, 441-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06889","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-18T01:34:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivK8wQI8TZSQYkSnTPLz+vqHO4Caggc0UGzVNABSXwaWQ1sasiTJf6eA0Qf6ZJgAtoMrxWm4G3PuR1SxAwokCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:25.265773Z"},"content_sha256":"c82d82cfa4a2016ae901ae94907befe6a06ca9317e3e0dffa854f357703341e4","schema_version":"1.0","event_id":"sha256:c82d82cfa4a2016ae901ae94907befe6a06ca9317e3e0dffa854f357703341e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PH5KZP23R3L3PCSEVEH6Y7LL5A/bundle.json","state_url":"https://pith.science/pith/PH5KZP23R3L3PCSEVEH6Y7LL5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PH5KZP23R3L3PCSEVEH6Y7LL5A/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-01T16:44:25Z","links":{"resolver":"https://pith.science/pith/PH5KZP23R3L3PCSEVEH6Y7LL5A","bundle":"https://pith.science/pith/PH5KZP23R3L3PCSEVEH6Y7LL5A/bundle.json","state":"https://pith.science/pith/PH5KZP23R3L3PCSEVEH6Y7LL5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PH5KZP23R3L3PCSEVEH6Y7LL5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PH5KZP23R3L3PCSEVEH6Y7LL5A","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":"83f47e09fc1008c7839721c4d417d3dca2c20a6e2daaecb2382bdf13b515fa7a","cross_cats_sorted":["cs.CE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-27T15:00:19Z","title_canon_sha256":"5f25a271c3fca53cb35acf1a36c7d208671f67c47ed051f73e4054f9a2f61931"},"schema_version":"1.0","source":{"id":"1508.06889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06889","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06889v1","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06889","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"pith_short_12","alias_value":"PH5KZP23R3L3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PH5KZP23R3L3PCSE","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PH5KZP23","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:c82d82cfa4a2016ae901ae94907befe6a06ca9317e3e0dffa854f357703341e4","target":"graph","created_at":"2026-05-18T01:34:40Z","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 Clar number of a (hydro)carbon molecule, introduced by Clar [E. Clar, \\emph{The aromatic sextet}, (1972).], is the maximum number of mutually disjoint resonant hexagons in the molecule. Calculating the Clar number can be formulated as an optimization problem on 2-connected planar graphs. Namely, it is the maximum number of mutually disjoint even faces a perfect matching can simultaneously alternate on. It was proved by Abeledo and Atkinson [H. G. Abeledo and G. W. Atkinson, \\emph{Unimodularity of the clar number problem}, Linear algebra and its applications \\textbf{420} (2007), no. 2, 441-","authors_text":"Attila Bern\\'ath, Erika R. B\\'erczi-Kov\\'acs","cross_cats":["cs.CE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-27T15:00:19Z","title":"The complexity of the Clar number problem and an FPT algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06889","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:27d106663396f50615317913bff38a0a2749650a38a4a2e0a9ed3e8e69330faa","target":"record","created_at":"2026-05-18T01:34:40Z","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":"83f47e09fc1008c7839721c4d417d3dca2c20a6e2daaecb2382bdf13b515fa7a","cross_cats_sorted":["cs.CE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-27T15:00:19Z","title_canon_sha256":"5f25a271c3fca53cb35acf1a36c7d208671f67c47ed051f73e4054f9a2f61931"},"schema_version":"1.0","source":{"id":"1508.06889","kind":"arxiv","version":1}},"canonical_sha256":"79faacbf5b8ed7b78a44a90fec7d6be829c47ecf2f57fdcee4edc388e554eb18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79faacbf5b8ed7b78a44a90fec7d6be829c47ecf2f57fdcee4edc388e554eb18","first_computed_at":"2026-05-18T01:34:40.634610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:40.634610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hCfhLzsuh9a9U1pZtnpQUndc6moLU/i4HAURGnQ91RucN12JWZGx+cLeXWoOiJKeHEm949lJLPbUzKISJ8CWCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:40.635304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27d106663396f50615317913bff38a0a2749650a38a4a2e0a9ed3e8e69330faa","sha256:c82d82cfa4a2016ae901ae94907befe6a06ca9317e3e0dffa854f357703341e4"],"state_sha256":"ae7e28dd62844277059bc81aed477b2e1277f9bf1063e9a89131c4ba550550ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3sou7NDCIVND/eZJi7QLtYB7wy7wNm/HHYcJkzHzFt8cD2wYQCe9sVEpP1KeB3WJy0troLd4UZ6mS2H9xQXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:44:25.267638Z","bundle_sha256":"8fcbe0a136e2425220a6dd4a4cddad70b522b5a73dc25e143027f374033f7416"}}