{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TMQH4GPUBXWTI6AV4S6HH5W7CO","short_pith_number":"pith:TMQH4GPU","canonical_record":{"source":{"id":"2406.19278","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T15:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"568b8f0aa67ba20455e55a053985537c689377c01017bdefd0e3ce33b5abd02d","abstract_canon_sha256":"faec68b98567e45299a4c14e784ff8ff616234f0c16a0c85cd4189c668273af4"},"schema_version":"1.0"},"canonical_sha256":"9b207e19f40ded347815e4bc73f6df1396295b78893d320dc3e8f4b5bbb822aa","source":{"kind":"arxiv","id":"2406.19278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19278","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19278v1","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19278","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"TMQH4GPUBXWT","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"pith_short_16","alias_value":"TMQH4GPUBXWTI6AV","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"pith_short_8","alias_value":"TMQH4GPU","created_at":"2026-07-05T08:37:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TMQH4GPUBXWTI6AV4S6HH5W7CO","target":"record","payload":{"canonical_record":{"source":{"id":"2406.19278","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T15:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"568b8f0aa67ba20455e55a053985537c689377c01017bdefd0e3ce33b5abd02d","abstract_canon_sha256":"faec68b98567e45299a4c14e784ff8ff616234f0c16a0c85cd4189c668273af4"},"schema_version":"1.0"},"canonical_sha256":"9b207e19f40ded347815e4bc73f6df1396295b78893d320dc3e8f4b5bbb822aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:32.688094Z","signature_b64":"UAm8N66SuRw+SuJgq1NH3Wp94NsEdzmH62NKwiFtGeTQSys4/iVvVSm4bgDqGkyN4tUcG13yLuaoCUDEu6s5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b207e19f40ded347815e4bc73f6df1396295b78893d320dc3e8f4b5bbb822aa","last_reissued_at":"2026-07-05T08:37:32.687652Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:32.687652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.19278","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-05T08:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9TnUSDFez+YNAIELglI+X4Dh7mS5erFIqkG9Ht5mCpOIDJuCTj+rV6Y7KdQiOegqHJN3a5wohzyCmyb6FaqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:52:11.856617Z"},"content_sha256":"7fcbc914ce6979deff70a5ae742ed00303ecd8a35917791b370886479a435479","schema_version":"1.0","event_id":"sha256:7fcbc914ce6979deff70a5ae742ed00303ecd8a35917791b370886479a435479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TMQH4GPUBXWTI6AV4S6HH5W7CO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $n/2$-bound for locating-dominating sets in subcubic graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anni Hakanen, Dipayan Chakraborty, Tuomo Lehtil\\\"a","submitted_at":"2024-06-27T15:48:53Z","abstract_excerpt":"The location-domination number is conjectured to be at most half of the order for twin-free graphs with no isolated vertices. We prove that this conjecture holds and is tight for subcubic graphs. We also show that the same upper bound holds for subcubic graphs with open twins of degree 3 and closed twins of any degree, but not for subcubic graphs with open twins of degree 1 or 2. These results then imply that the same upper bound holds for all cubic graphs (with or without twins) except $K_4$ and $K_{3,3}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19278","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/2406.19278/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-05T08:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V39UXy+m4qiBqKdy7aGYJBeKffjoCLWUKLTzcYrt6rmxcgysV0crwRzemC26cGWAohrptBTH4Fv23JWg+kZ+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:52:11.857165Z"},"content_sha256":"d4e97a152f24e74a70d9b990faf34af7ba0f3fb22cccde3ff3e716af58d72c33","schema_version":"1.0","event_id":"sha256:d4e97a152f24e74a70d9b990faf34af7ba0f3fb22cccde3ff3e716af58d72c33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMQH4GPUBXWTI6AV4S6HH5W7CO/bundle.json","state_url":"https://pith.science/pith/TMQH4GPUBXWTI6AV4S6HH5W7CO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMQH4GPUBXWTI6AV4S6HH5W7CO/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-13T06:52:11Z","links":{"resolver":"https://pith.science/pith/TMQH4GPUBXWTI6AV4S6HH5W7CO","bundle":"https://pith.science/pith/TMQH4GPUBXWTI6AV4S6HH5W7CO/bundle.json","state":"https://pith.science/pith/TMQH4GPUBXWTI6AV4S6HH5W7CO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMQH4GPUBXWTI6AV4S6HH5W7CO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TMQH4GPUBXWTI6AV4S6HH5W7CO","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":"faec68b98567e45299a4c14e784ff8ff616234f0c16a0c85cd4189c668273af4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T15:48:53Z","title_canon_sha256":"568b8f0aa67ba20455e55a053985537c689377c01017bdefd0e3ce33b5abd02d"},"schema_version":"1.0","source":{"id":"2406.19278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19278","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19278v1","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19278","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"TMQH4GPUBXWT","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"pith_short_16","alias_value":"TMQH4GPUBXWTI6AV","created_at":"2026-07-05T08:37:32Z"},{"alias_kind":"pith_short_8","alias_value":"TMQH4GPU","created_at":"2026-07-05T08:37:32Z"}],"graph_snapshots":[{"event_id":"sha256:d4e97a152f24e74a70d9b990faf34af7ba0f3fb22cccde3ff3e716af58d72c33","target":"graph","created_at":"2026-07-05T08:37:32Z","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/2406.19278/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The location-domination number is conjectured to be at most half of the order for twin-free graphs with no isolated vertices. We prove that this conjecture holds and is tight for subcubic graphs. We also show that the same upper bound holds for subcubic graphs with open twins of degree 3 and closed twins of any degree, but not for subcubic graphs with open twins of degree 1 or 2. These results then imply that the same upper bound holds for all cubic graphs (with or without twins) except $K_4$ and $K_{3,3}$.","authors_text":"Anni Hakanen, Dipayan Chakraborty, Tuomo Lehtil\\\"a","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T15:48:53Z","title":"The $n/2$-bound for locating-dominating sets in subcubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19278","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:7fcbc914ce6979deff70a5ae742ed00303ecd8a35917791b370886479a435479","target":"record","created_at":"2026-07-05T08:37:32Z","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":"faec68b98567e45299a4c14e784ff8ff616234f0c16a0c85cd4189c668273af4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-27T15:48:53Z","title_canon_sha256":"568b8f0aa67ba20455e55a053985537c689377c01017bdefd0e3ce33b5abd02d"},"schema_version":"1.0","source":{"id":"2406.19278","kind":"arxiv","version":1}},"canonical_sha256":"9b207e19f40ded347815e4bc73f6df1396295b78893d320dc3e8f4b5bbb822aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b207e19f40ded347815e4bc73f6df1396295b78893d320dc3e8f4b5bbb822aa","first_computed_at":"2026-07-05T08:37:32.687652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:37:32.687652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UAm8N66SuRw+SuJgq1NH3Wp94NsEdzmH62NKwiFtGeTQSys4/iVvVSm4bgDqGkyN4tUcG13yLuaoCUDEu6s5AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:37:32.688094Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.19278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fcbc914ce6979deff70a5ae742ed00303ecd8a35917791b370886479a435479","sha256:d4e97a152f24e74a70d9b990faf34af7ba0f3fb22cccde3ff3e716af58d72c33"],"state_sha256":"51d67d0e79aef063b2be87b6f10d516f786cb00b42592151af40236672a2c610"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Crbxd4PKD+oKK7BbGpoNncAWQ4FkSFrUvguyqc+JUb0mCfTWiAnP4ipHuLtjlX3N/W/jWYlRWkk+1wAspFkXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T06:52:11.862609Z","bundle_sha256":"e6c97585a607cbdfb7c75b77a8f4ebbe939ee227cbe5dd9dd3eb79be325fd19f"}}