{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7B2UPKIAMD224ERZU52UB4UCBS","short_pith_number":"pith:7B2UPKIA","canonical_record":{"source":{"id":"2607.12597","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-14T10:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"6280f1d55a93fa8a1de3a91b746ea813539ab12f0f121d8deb299c58c7b507c2","abstract_canon_sha256":"eea9415bca81f56c2294d34c1ebe1407355b60aa14e62e06ebc25be54103631d"},"schema_version":"1.0"},"canonical_sha256":"f87547a90060f5ae1239a77540f2820c9a1839d056c8e0f90569661299cf0736","source":{"kind":"arxiv","id":"2607.12597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.12597","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"2607.12597v1","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.12597","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"7B2UPKIAMD22","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"pith_short_16","alias_value":"7B2UPKIAMD224ERZ","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"pith_short_8","alias_value":"7B2UPKIA","created_at":"2026-07-15T01:22:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7B2UPKIAMD224ERZU52UB4UCBS","target":"record","payload":{"canonical_record":{"source":{"id":"2607.12597","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-14T10:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"6280f1d55a93fa8a1de3a91b746ea813539ab12f0f121d8deb299c58c7b507c2","abstract_canon_sha256":"eea9415bca81f56c2294d34c1ebe1407355b60aa14e62e06ebc25be54103631d"},"schema_version":"1.0"},"canonical_sha256":"f87547a90060f5ae1239a77540f2820c9a1839d056c8e0f90569661299cf0736","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-15T01:22:05.916202Z","signature_b64":"dGsgWjEUusmTHp1KdQNL6FUymMwQCk6q6koZ4+xJZhzSSVXWUd24fcJgsDY0Ujo9a8st5CPsRy+PkjfelXpMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f87547a90060f5ae1239a77540f2820c9a1839d056c8e0f90569661299cf0736","last_reissued_at":"2026-07-15T01:22:05.915339Z","signature_status":"signed_v1","first_computed_at":"2026-07-15T01:22:05.915339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.12597","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-15T01:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeXkDITmh1GZxqUDRcA5uqJ4jfJd5iEKojH8JDcrtB7imQgt3E6asBuaG70VWQBtDeUYDRnOgWqBQxNAajOYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T03:06:13.342665Z"},"content_sha256":"621327e793ab57a63a8d16947a5a5b4914082088d195ef83e2d19b21485d193c","schema_version":"1.0","event_id":"sha256:621327e793ab57a63a8d16947a5a5b4914082088d195ef83e2d19b21485d193c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7B2UPKIAMD224ERZU52UB4UCBS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating Extremes in Graceful Labelings of Full Binary Trees and Spider Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bogdan Dumitru, Mihai Nacu","submitted_at":"2026-07-14T10:14:29Z","abstract_excerpt":"We study a pinned form of graceful labeling. For full binary trees, we ask whether some deepest root-to-leaf path can carry the alternating extreme pattern $0,n-1,1,n-2,\\dots$. Such a spine uses the extreme labels and largest differences, forcing all off-spine vertices and edges to use the middle labels and smaller differences, respectively. We prove this pinned-spine conjecture for comb full binary trees, verify it computationally for all rooted non-isomorphic full binary trees through order $23$, and give an example showing that a pinned-spine labeling cannot always be chosen as an $\\alpha$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.12597","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/2607.12597/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-15T01:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/J144rWzsYPkBidBrJq8z190+JygCenSMo2LrBac4cOUIS3Do0a0t5mE/3kOSQ8Kn2XNtGwI9sWVHGKTZr3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T03:06:13.343035Z"},"content_sha256":"a3e545196406af1ca306c59129eefb7074d05c75c917c742b628791c2d88e188","schema_version":"1.0","event_id":"sha256:a3e545196406af1ca306c59129eefb7074d05c75c917c742b628791c2d88e188"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7B2UPKIAMD224ERZU52UB4UCBS/bundle.json","state_url":"https://pith.science/pith/7B2UPKIAMD224ERZU52UB4UCBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7B2UPKIAMD224ERZU52UB4UCBS/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-07-18T03:06:13Z","links":{"resolver":"https://pith.science/pith/7B2UPKIAMD224ERZU52UB4UCBS","bundle":"https://pith.science/pith/7B2UPKIAMD224ERZU52UB4UCBS/bundle.json","state":"https://pith.science/pith/7B2UPKIAMD224ERZU52UB4UCBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7B2UPKIAMD224ERZU52UB4UCBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7B2UPKIAMD224ERZU52UB4UCBS","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":"eea9415bca81f56c2294d34c1ebe1407355b60aa14e62e06ebc25be54103631d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-14T10:14:29Z","title_canon_sha256":"6280f1d55a93fa8a1de3a91b746ea813539ab12f0f121d8deb299c58c7b507c2"},"schema_version":"1.0","source":{"id":"2607.12597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.12597","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"2607.12597v1","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.12597","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"7B2UPKIAMD22","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"pith_short_16","alias_value":"7B2UPKIAMD224ERZ","created_at":"2026-07-15T01:22:05Z"},{"alias_kind":"pith_short_8","alias_value":"7B2UPKIA","created_at":"2026-07-15T01:22:05Z"}],"graph_snapshots":[{"event_id":"sha256:a3e545196406af1ca306c59129eefb7074d05c75c917c742b628791c2d88e188","target":"graph","created_at":"2026-07-15T01:22:05Z","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/2607.12597/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a pinned form of graceful labeling. For full binary trees, we ask whether some deepest root-to-leaf path can carry the alternating extreme pattern $0,n-1,1,n-2,\\dots$. Such a spine uses the extreme labels and largest differences, forcing all off-spine vertices and edges to use the middle labels and smaller differences, respectively. We prove this pinned-spine conjecture for comb full binary trees, verify it computationally for all rooted non-isomorphic full binary trees through order $23$, and give an example showing that a pinned-spine labeling cannot always be chosen as an $\\alpha$-","authors_text":"Bogdan Dumitru, Mihai Nacu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-14T10:14:29Z","title":"Alternating Extremes in Graceful Labelings of Full Binary Trees and Spider Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.12597","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:621327e793ab57a63a8d16947a5a5b4914082088d195ef83e2d19b21485d193c","target":"record","created_at":"2026-07-15T01:22:05Z","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":"eea9415bca81f56c2294d34c1ebe1407355b60aa14e62e06ebc25be54103631d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-14T10:14:29Z","title_canon_sha256":"6280f1d55a93fa8a1de3a91b746ea813539ab12f0f121d8deb299c58c7b507c2"},"schema_version":"1.0","source":{"id":"2607.12597","kind":"arxiv","version":1}},"canonical_sha256":"f87547a90060f5ae1239a77540f2820c9a1839d056c8e0f90569661299cf0736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f87547a90060f5ae1239a77540f2820c9a1839d056c8e0f90569661299cf0736","first_computed_at":"2026-07-15T01:22:05.915339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-15T01:22:05.915339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dGsgWjEUusmTHp1KdQNL6FUymMwQCk6q6koZ4+xJZhzSSVXWUd24fcJgsDY0Ujo9a8st5CPsRy+PkjfelXpMCQ==","signature_status":"signed_v1","signed_at":"2026-07-15T01:22:05.916202Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.12597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:621327e793ab57a63a8d16947a5a5b4914082088d195ef83e2d19b21485d193c","sha256:a3e545196406af1ca306c59129eefb7074d05c75c917c742b628791c2d88e188"],"state_sha256":"393baddbcfaf24df142926caac2c87c563b09d6a840e1b3e4cdaf17b888c9139"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqFNzujRPNu5VDSZXmKbSJ7D9rZf25UobcbXyKVCrAEHMrLno48hfL3xPfZ1dbjjzMDAWqSByL3xXSjCKoAxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T03:06:13.345124Z","bundle_sha256":"af9eebdd15f25ac8b173ddbe1374c8aea46b2d1e5bc0359603aa0bd548db5ef9"}}