{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:O3JPGQF4YAGGFDOOCOXWJQ3DEU","short_pith_number":"pith:O3JPGQF4","canonical_record":{"source":{"id":"1209.1256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-09-06T11:19:20Z","cross_cats_sorted":[],"title_canon_sha256":"d6c41df1c425e1e8409961da60b2d6b5c8640cf8ab3741772f984208371e1082","abstract_canon_sha256":"b416bfb9c8fecd9ef6bcea462f126d51600e5e45daa064ac17ad7cd84722b1d6"},"schema_version":"1.0"},"canonical_sha256":"76d2f340bcc00c628dce13af64c3632533a32332cf09787c4a656744eb76c0b2","source":{"kind":"arxiv","id":"1209.1256","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1256","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1256v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1256","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"O3JPGQF4YAGG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O3JPGQF4YAGGFDOO","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O3JPGQF4","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:O3JPGQF4YAGGFDOOCOXWJQ3DEU","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-09-06T11:19:20Z","cross_cats_sorted":[],"title_canon_sha256":"d6c41df1c425e1e8409961da60b2d6b5c8640cf8ab3741772f984208371e1082","abstract_canon_sha256":"b416bfb9c8fecd9ef6bcea462f126d51600e5e45daa064ac17ad7cd84722b1d6"},"schema_version":"1.0"},"canonical_sha256":"76d2f340bcc00c628dce13af64c3632533a32332cf09787c4a656744eb76c0b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:44.039328Z","signature_b64":"ic7l6XKKgpAypxE9EvWzgmt+ndESE0KrM/H0QAdVFq3X6+tkwFJj5gzy83ztIfH5xiuA2nhjdDmkqcd9gN3RBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76d2f340bcc00c628dce13af64c3632533a32332cf09787c4a656744eb76c0b2","last_reissued_at":"2026-05-18T01:22:44.038738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:44.038738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1256","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:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YhjHcbepkQbqchjdK9dVrMfCOZKdo0dW6TUPqnyVlKR+mYKu6iaqpuMdBg4w4+189Rr5fTT9pSRpS/VSFRr/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:22:09.177647Z"},"content_sha256":"be63de4b3c2dd25afde47e40869a01de53916f8e99c719bc75ca3883ad4560ca","schema_version":"1.0","event_id":"sha256:be63de4b3c2dd25afde47e40869a01de53916f8e99c719bc75ca3883ad4560ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:O3JPGQF4YAGGFDOOCOXWJQ3DEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Decreasing Failure Rate property for general counting process. Results based on conditional interarrival times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"C.Sang\\\"uesa, F. G. Bad\\'ia","submitted_at":"2012-09-06T11:19:20Z","abstract_excerpt":"In the present paper we consider general counting processes stopped at a random time $T$, independent of the process. Provided that $T$ has the decreasing failure rate (DFR) property, we give sufficient conditions on the arrival times so that the number of events occurring before $T$ preserves the DFR property of $T$. These conditions involve the study of the conditional interarrival times. As a main application, we prove the DFR property in a context of maintenance models in reliability, by the consideration of Kijima type I virtual age models under quite general assumptions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1256","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:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+sKzhDXt8JdhV2pUhz6EM+rShac0II7soHw27e0NT3KKSFOH2SbfkgSXMDnIssgK/t4sHSWL4GPMFdVUmP/iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:22:09.177986Z"},"content_sha256":"d87deec7cc7247a7db8bff48eb3e27061208ee991899db7d1f5b2b3d62b1f85f","schema_version":"1.0","event_id":"sha256:d87deec7cc7247a7db8bff48eb3e27061208ee991899db7d1f5b2b3d62b1f85f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3JPGQF4YAGGFDOOCOXWJQ3DEU/bundle.json","state_url":"https://pith.science/pith/O3JPGQF4YAGGFDOOCOXWJQ3DEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3JPGQF4YAGGFDOOCOXWJQ3DEU/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-25T02:22:09Z","links":{"resolver":"https://pith.science/pith/O3JPGQF4YAGGFDOOCOXWJQ3DEU","bundle":"https://pith.science/pith/O3JPGQF4YAGGFDOOCOXWJQ3DEU/bundle.json","state":"https://pith.science/pith/O3JPGQF4YAGGFDOOCOXWJQ3DEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3JPGQF4YAGGFDOOCOXWJQ3DEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:O3JPGQF4YAGGFDOOCOXWJQ3DEU","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":"b416bfb9c8fecd9ef6bcea462f126d51600e5e45daa064ac17ad7cd84722b1d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-09-06T11:19:20Z","title_canon_sha256":"d6c41df1c425e1e8409961da60b2d6b5c8640cf8ab3741772f984208371e1082"},"schema_version":"1.0","source":{"id":"1209.1256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1256","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1256v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1256","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"O3JPGQF4YAGG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O3JPGQF4YAGGFDOO","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O3JPGQF4","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:d87deec7cc7247a7db8bff48eb3e27061208ee991899db7d1f5b2b3d62b1f85f","target":"graph","created_at":"2026-05-18T01:22:44Z","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":"In the present paper we consider general counting processes stopped at a random time $T$, independent of the process. Provided that $T$ has the decreasing failure rate (DFR) property, we give sufficient conditions on the arrival times so that the number of events occurring before $T$ preserves the DFR property of $T$. These conditions involve the study of the conditional interarrival times. As a main application, we prove the DFR property in a context of maintenance models in reliability, by the consideration of Kijima type I virtual age models under quite general assumptions.","authors_text":"C.Sang\\\"uesa, F. G. Bad\\'ia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-09-06T11:19:20Z","title":"On the Decreasing Failure Rate property for general counting process. Results based on conditional interarrival times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1256","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:be63de4b3c2dd25afde47e40869a01de53916f8e99c719bc75ca3883ad4560ca","target":"record","created_at":"2026-05-18T01:22:44Z","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":"b416bfb9c8fecd9ef6bcea462f126d51600e5e45daa064ac17ad7cd84722b1d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-09-06T11:19:20Z","title_canon_sha256":"d6c41df1c425e1e8409961da60b2d6b5c8640cf8ab3741772f984208371e1082"},"schema_version":"1.0","source":{"id":"1209.1256","kind":"arxiv","version":1}},"canonical_sha256":"76d2f340bcc00c628dce13af64c3632533a32332cf09787c4a656744eb76c0b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76d2f340bcc00c628dce13af64c3632533a32332cf09787c4a656744eb76c0b2","first_computed_at":"2026-05-18T01:22:44.038738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:44.038738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ic7l6XKKgpAypxE9EvWzgmt+ndESE0KrM/H0QAdVFq3X6+tkwFJj5gzy83ztIfH5xiuA2nhjdDmkqcd9gN3RBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:44.039328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be63de4b3c2dd25afde47e40869a01de53916f8e99c719bc75ca3883ad4560ca","sha256:d87deec7cc7247a7db8bff48eb3e27061208ee991899db7d1f5b2b3d62b1f85f"],"state_sha256":"de9813824191941b911055842ff990cad3a3324307f5b468af8a6d735b714cce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZ9xQDq0TjdwSL5bvrRJ8tAaKBNoU0mrD6/HdeZnjg+UxjXARyQcX/avPvaJ7dl/eV9BglbAkZHzBi/xSFcDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T02:22:09.179984Z","bundle_sha256":"7ffafb4e154600ca577de8fccc3d1d6e4b93c2394b702a737e13d92377f339c7"}}